Annotation of OpenXM_contrib2/asir2000/engine/nd.c, Revision 1.240
1.240 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.239 2017/09/14 01:34:53 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.234 noro 63: static int nd_gentrace,nd_gensyz,nd_nora,nd_newelim,nd_intersect,nd_lf;
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.231 noro 67: static int *nd_sugarweight;
1.234 noro 68: static int nd_f4red,nd_rank0;
1.1 noro 69:
1.119 noro 70: NumberField get_numberfield();
1.114 noro 71: UINT *nd_det_compute_bound(NDV **dm,int n,int j);
72: void nd_det_reconstruct(NDV **dm,int n,int j,NDV d);
1.152 ohara 73: void nd_heu_nezgcdnpz(VL vl,P *pl,int m,int full,P *pr);
1.118 noro 74: int nd_monic(int m,ND *p);
1.129 noro 75: NDV plain_vect_to_ndv_q(Q *mat,int col,UINT *s0vect);
1.157 noro 76: LIST ndvtopl(int mod,VL vl,VL dvl,NDV p,int rank);
77: NDV pltondv(VL vl,VL dvl,LIST p);
78: void pltozpl(LIST l,Q *cont,LIST *pp);
1.159 noro 79: void ndl_max(UINT *d1,unsigned *d2,UINT *d);
1.167 noro 80: void nmtodp(int mod,NM m,DP *r);
81: NODE reverse_node(NODE n);
82: P ndc_div(int mod,union oNDC a,union oNDC b);
83: P ndctop(int mod,union oNDC c);
84: void finalize_tracelist(int i,P cont);
85: void conv_ilist(int demand,int trace,NODE g,int **indp);
1.172 noro 86: void parse_nd_option(NODE opt);
1.198 noro 87: void dltondl(int n,DL dl,UINT *r);
88: DP ndvtodp(int mod,NDV p);
1.204 noro 89: DP ndtodp(int mod,ND p);
1.215 noro 90: NDV ndvtondvgz(NDV p);
91: NDV ndvgztondv(NDV p);
92: ND ndtondgz(ND p);
93: ND ndgztond(ND p);
1.114 noro 94:
1.221 ohara 95: void Pdp_set_weight(NODE,VECT *);
96: void Pox_cmo_rpc(NODE,Obj *);
97:
1.232 noro 98: ND nd_add_lf(ND p1,ND p2);
99: void nd_mul_c_lf(ND p,GZ mul);
100: void ndv_mul_c_lf(NDV p,GZ mul);
1.239 noro 101: NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
102: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz);
1.240 ! noro 103: NODE nd_f4_red_mod64_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
1.239 noro 104: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz);
1.234 noro 105: NODE nd_f4_red_lf_main(int m,ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
1.232 noro 106: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred);
107: int nd_gauss_elim_lf(mpz_t **mat0,int *sugar,int row,int col,int *colstat);
1.234 noro 108: NODE nd_f4_lf_trace_main(int m,int **indp);
109: void nd_f4_lf_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp);
110:
1.232 noro 111: extern int lf_lazy;
112: extern GZ current_mod_lf;
113:
1.228 noro 114: extern int Denominator,DP_Multiple,MaxDeg;
1.149 noro 115:
1.220 noro 116: #define BLEN (8*sizeof(unsigned long))
117:
118: typedef struct matrix {
119: int row,col;
120: unsigned long **a;
121: } *matrix;
122:
123:
1.1 noro 124: void nd_free_private_storage()
125: {
1.157 noro 126: _nm_free_list = 0;
127: _ndp_free_list = 0;
1.71 noro 128: #if 0
1.157 noro 129: GC_gcollect();
1.71 noro 130: #endif
1.1 noro 131: }
132:
133: void _NM_alloc()
134: {
1.157 noro 135: NM p;
136: int i;
1.1 noro 137:
1.157 noro 138: for ( i = 0; i < 1024; i++ ) {
1.200 noro 139: p = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
1.157 noro 140: p->next = _nm_free_list; _nm_free_list = p;
141: }
1.1 noro 142: }
143:
1.220 noro 144: matrix alloc_matrix(int row,int col)
145: {
146: unsigned long **a;
147: int i,len,blen;
148: matrix mat;
149:
150: mat = (matrix)MALLOC(sizeof(struct matrix));
151: mat->row = row;
152: mat->col = col;
153: mat->a = a = (unsigned long **)MALLOC(row*sizeof(unsigned long *));
154: return mat;
155: }
156:
157:
1.1 noro 158: void _ND_alloc()
159: {
1.157 noro 160: ND p;
161: int i;
1.1 noro 162:
1.157 noro 163: for ( i = 0; i < 1024; i++ ) {
1.200 noro 164: p = (ND)MALLOC(sizeof(struct oND));
1.157 noro 165: p->body = (NM)_nd_free_list; _nd_free_list = p;
166: }
1.1 noro 167: }
168:
169: void _NDP_alloc()
170: {
1.157 noro 171: ND_pairs p;
172: int i;
1.1 noro 173:
1.157 noro 174: for ( i = 0; i < 1024; i++ ) {
1.200 noro 175: p = (ND_pairs)MALLOC(sizeof(struct oND_pairs)
1.157 noro 176: +(nd_wpd-1)*sizeof(UINT));
177: p->next = _ndp_free_list; _ndp_free_list = p;
178: }
1.1 noro 179: }
180:
1.30 noro 181: INLINE int nd_length(ND p)
1.1 noro 182: {
1.157 noro 183: NM m;
184: int i;
1.1 noro 185:
1.157 noro 186: if ( !p )
187: return 0;
188: else {
189: for ( i = 0, m = BDY(p); m; m = NEXT(m), i++ );
190: return i;
191: }
1.1 noro 192: }
193:
1.230 noro 194: extern int dp_negative_weight;
195:
1.61 noro 196: INLINE int ndl_reducible(UINT *d1,UINT *d2)
1.1 noro 197: {
1.157 noro 198: UINT u1,u2;
199: int i,j;
1.1 noro 200:
1.157 noro 201: if ( nd_module && (MPOS(d1) != MPOS(d2)) ) return 0;
202:
1.230 noro 203: if ( !dp_negative_weight && TD(d1) < TD(d2) ) return 0;
1.65 noro 204: #if USE_UNROLL
1.157 noro 205: switch ( nd_bpe ) {
206: case 3:
207: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
208: u1 = d1[i]; u2 = d2[i];
209: if ( (u1&0x38000000) < (u2&0x38000000) ) return 0;
210: if ( (u1& 0x7000000) < (u2& 0x7000000) ) return 0;
211: if ( (u1& 0xe00000) < (u2& 0xe00000) ) return 0;
212: if ( (u1& 0x1c0000) < (u2& 0x1c0000) ) return 0;
213: if ( (u1& 0x38000) < (u2& 0x38000) ) return 0;
214: if ( (u1& 0x7000) < (u2& 0x7000) ) return 0;
215: if ( (u1& 0xe00) < (u2& 0xe00) ) return 0;
216: if ( (u1& 0x1c0) < (u2& 0x1c0) ) return 0;
217: if ( (u1& 0x38) < (u2& 0x38) ) return 0;
218: if ( (u1& 0x7) < (u2& 0x7) ) return 0;
219: }
220: return 1;
221: break;
222: case 4:
223: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
224: u1 = d1[i]; u2 = d2[i];
225: if ( (u1&0xf0000000) < (u2&0xf0000000) ) return 0;
226: if ( (u1& 0xf000000) < (u2& 0xf000000) ) return 0;
227: if ( (u1& 0xf00000) < (u2& 0xf00000) ) return 0;
228: if ( (u1& 0xf0000) < (u2& 0xf0000) ) return 0;
229: if ( (u1& 0xf000) < (u2& 0xf000) ) return 0;
230: if ( (u1& 0xf00) < (u2& 0xf00) ) return 0;
231: if ( (u1& 0xf0) < (u2& 0xf0) ) return 0;
232: if ( (u1& 0xf) < (u2& 0xf) ) return 0;
233: }
234: return 1;
235: break;
236: case 6:
237: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
238: u1 = d1[i]; u2 = d2[i];
239: if ( (u1&0x3f000000) < (u2&0x3f000000) ) return 0;
240: if ( (u1& 0xfc0000) < (u2& 0xfc0000) ) return 0;
241: if ( (u1& 0x3f000) < (u2& 0x3f000) ) return 0;
242: if ( (u1& 0xfc0) < (u2& 0xfc0) ) return 0;
243: if ( (u1& 0x3f) < (u2& 0x3f) ) return 0;
244: }
245: return 1;
246: break;
247: case 8:
248: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
249: u1 = d1[i]; u2 = d2[i];
250: if ( (u1&0xff000000) < (u2&0xff000000) ) return 0;
251: if ( (u1& 0xff0000) < (u2& 0xff0000) ) return 0;
252: if ( (u1& 0xff00) < (u2& 0xff00) ) return 0;
253: if ( (u1& 0xff) < (u2& 0xff) ) return 0;
254: }
255: return 1;
256: break;
257: case 16:
258: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
259: u1 = d1[i]; u2 = d2[i];
260: if ( (u1&0xffff0000) < (u2&0xffff0000) ) return 0;
261: if ( (u1& 0xffff) < (u2& 0xffff) ) return 0;
262: }
263: return 1;
264: break;
265: case 32:
266: for ( i = nd_exporigin; i < nd_wpd; i++ )
267: if ( d1[i] < d2[i] ) return 0;
268: return 1;
269: break;
270: default:
271: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
272: u1 = d1[i]; u2 = d2[i];
273: for ( j = 0; j < nd_epw; j++ )
274: if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0;
275: }
276: return 1;
277: }
1.65 noro 278: #else
1.157 noro 279: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
280: u1 = d1[i]; u2 = d2[i];
281: for ( j = 0; j < nd_epw; j++ )
282: if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0;
283: }
284: return 1;
1.65 noro 285: #endif
1.1 noro 286: }
287:
1.61 noro 288: /*
289: * If the current order is a block order,
290: * then the last block is length 1 and contains
291: * the homo variable. Otherwise, the original
292: * order is either 0 or 2.
293: */
294:
1.164 noro 295: void ndl_homogenize(UINT *d,UINT *r,int obpe,EPOS oepos,int ompos,int weight)
1.23 noro 296: {
1.157 noro 297: int w,i,e,n,omask0;
1.61 noro 298:
1.157 noro 299: omask0 = obpe==32?0xffffffff:((1<<obpe)-1);
300: n = nd_nvar-1;
301: ndl_zero(r);
302: for ( i = 0; i < n; i++ ) {
303: e = GET_EXP_OLD(d,i);
304: PUT_EXP(r,i,e);
305: }
306: w = TD(d);
307: PUT_EXP(r,nd_nvar-1,weight-w);
1.164 noro 308: if ( nd_module ) MPOS(r) = d[ompos];
1.157 noro 309: TD(r) = weight;
310: if ( nd_blockmask ) ndl_weight_mask(r);
1.61 noro 311: }
312:
313: void ndl_dehomogenize(UINT *d)
314: {
1.157 noro 315: UINT mask;
316: UINT h;
317: int i,bits;
318:
319: if ( nd_blockmask ) {
320: h = GET_EXP(d,nd_nvar-1);
321: XOR_EXP(d,nd_nvar-1,h);
322: TD(d) -= h;
323: ndl_weight_mask(d);
324: } else {
325: if ( nd_isrlex ) {
326: if ( nd_bpe == 32 ) {
327: h = d[nd_exporigin];
328: for ( i = nd_exporigin+1; i < nd_wpd; i++ )
329: d[i-1] = d[i];
330: d[i-1] = 0;
331: TD(d) -= h;
332: } else {
333: bits = nd_epw*nd_bpe;
334: mask = bits==32?0xffffffff:((1<<(nd_epw*nd_bpe))-1);
335: h = (d[nd_exporigin]>>((nd_epw-1)*nd_bpe))&nd_mask0;
336: for ( i = nd_exporigin; i < nd_wpd; i++ )
337: d[i] = ((d[i]<<nd_bpe)&mask)
338: |(i+1<nd_wpd?((d[i+1]>>((nd_epw-1)*nd_bpe))&nd_mask0):0);
339: TD(d) -= h;
340: }
341: } else {
342: h = GET_EXP(d,nd_nvar-1);
343: XOR_EXP(d,nd_nvar-1,h);
344: TD(d) -= h;
345: }
346: }
1.23 noro 347: }
348:
1.61 noro 349: void ndl_lcm(UINT *d1,unsigned *d2,UINT *d)
1.1 noro 350: {
1.157 noro 351: UINT t1,t2,u,u1,u2;
352: int i,j,l;
353:
354: if ( nd_module && (MPOS(d1) != MPOS(d2)) )
355: error("ndl_lcm : inconsistent monomials");
356: #if USE_UNROLL
357: switch ( nd_bpe ) {
358: case 3:
359: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
360: u1 = d1[i]; u2 = d2[i];
361: t1 = (u1&0x38000000); t2 = (u2&0x38000000); u = t1>t2?t1:t2;
362: t1 = (u1& 0x7000000); t2 = (u2& 0x7000000); u |= t1>t2?t1:t2;
363: t1 = (u1& 0xe00000); t2 = (u2& 0xe00000); u |= t1>t2?t1:t2;
364: t1 = (u1& 0x1c0000); t2 = (u2& 0x1c0000); u |= t1>t2?t1:t2;
365: t1 = (u1& 0x38000); t2 = (u2& 0x38000); u |= t1>t2?t1:t2;
366: t1 = (u1& 0x7000); t2 = (u2& 0x7000); u |= t1>t2?t1:t2;
367: t1 = (u1& 0xe00); t2 = (u2& 0xe00); u |= t1>t2?t1:t2;
368: t1 = (u1& 0x1c0); t2 = (u2& 0x1c0); u |= t1>t2?t1:t2;
369: t1 = (u1& 0x38); t2 = (u2& 0x38); u |= t1>t2?t1:t2;
370: t1 = (u1& 0x7); t2 = (u2& 0x7); u |= t1>t2?t1:t2;
371: d[i] = u;
372: }
373: break;
374: case 4:
375: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
376: u1 = d1[i]; u2 = d2[i];
377: t1 = (u1&0xf0000000); t2 = (u2&0xf0000000); u = t1>t2?t1:t2;
378: t1 = (u1& 0xf000000); t2 = (u2& 0xf000000); u |= t1>t2?t1:t2;
379: t1 = (u1& 0xf00000); t2 = (u2& 0xf00000); u |= t1>t2?t1:t2;
380: t1 = (u1& 0xf0000); t2 = (u2& 0xf0000); u |= t1>t2?t1:t2;
381: t1 = (u1& 0xf000); t2 = (u2& 0xf000); u |= t1>t2?t1:t2;
382: t1 = (u1& 0xf00); t2 = (u2& 0xf00); u |= t1>t2?t1:t2;
383: t1 = (u1& 0xf0); t2 = (u2& 0xf0); u |= t1>t2?t1:t2;
384: t1 = (u1& 0xf); t2 = (u2& 0xf); u |= t1>t2?t1:t2;
385: d[i] = u;
386: }
387: break;
388: case 6:
389: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
390: u1 = d1[i]; u2 = d2[i];
391: t1 = (u1&0x3f000000); t2 = (u2&0x3f000000); u = t1>t2?t1:t2;
392: t1 = (u1& 0xfc0000); t2 = (u2& 0xfc0000); u |= t1>t2?t1:t2;
393: t1 = (u1& 0x3f000); t2 = (u2& 0x3f000); u |= t1>t2?t1:t2;
394: t1 = (u1& 0xfc0); t2 = (u2& 0xfc0); u |= t1>t2?t1:t2;
395: t1 = (u1& 0x3f); t2 = (u2& 0x3f); u |= t1>t2?t1:t2;
396: d[i] = u;
397: }
398: break;
399: case 8:
400: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
401: u1 = d1[i]; u2 = d2[i];
402: t1 = (u1&0xff000000); t2 = (u2&0xff000000); u = t1>t2?t1:t2;
403: t1 = (u1& 0xff0000); t2 = (u2& 0xff0000); u |= t1>t2?t1:t2;
404: t1 = (u1& 0xff00); t2 = (u2& 0xff00); u |= t1>t2?t1:t2;
405: t1 = (u1& 0xff); t2 = (u2& 0xff); u |= t1>t2?t1:t2;
406: d[i] = u;
407: }
408: break;
409: case 16:
410: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
411: u1 = d1[i]; u2 = d2[i];
412: t1 = (u1&0xffff0000); t2 = (u2&0xffff0000); u = t1>t2?t1:t2;
413: t1 = (u1& 0xffff); t2 = (u2& 0xffff); u |= t1>t2?t1:t2;
414: d[i] = u;
415: }
416: break;
417: case 32:
418: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
419: u1 = d1[i]; u2 = d2[i];
420: d[i] = u1>u2?u1:u2;
421: }
422: break;
423: default:
424: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
425: u1 = d1[i]; u2 = d2[i];
426: for ( j = 0, u = 0; j < nd_epw; j++ ) {
427: t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;
428: }
429: d[i] = u;
430: }
431: break;
432: }
433: #else
434: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
435: u1 = d1[i]; u2 = d2[i];
436: for ( j = 0, u = 0; j < nd_epw; j++ ) {
437: t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;
438: }
439: d[i] = u;
440: }
441: #endif
1.163 noro 442: if ( nd_module ) MPOS(d) = MPOS(d1);
1.157 noro 443: TD(d) = ndl_weight(d);
444: if ( nd_blockmask ) ndl_weight_mask(d);
445: }
446:
1.159 noro 447: void ndl_max(UINT *d1,unsigned *d2,UINT *d)
1.157 noro 448: {
449: UINT t1,t2,u,u1,u2;
450: int i,j,l;
1.1 noro 451:
1.157 noro 452: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
453: u1 = d1[i]; u2 = d2[i];
454: for ( j = 0, u = 0; j < nd_epw; j++ ) {
455: t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;
456: }
457: d[i] = u;
458: }
1.57 noro 459: }
460:
1.61 noro 461: int ndl_weight(UINT *d)
1.1 noro 462: {
1.157 noro 463: UINT t,u;
464: int i,j;
1.1 noro 465:
1.157 noro 466: if ( current_dl_weight_vector )
467: for ( i = 0, t = 0; i < nd_nvar; i++ ) {
468: u = GET_EXP(d,i);
469: t += MUL_WEIGHT(u,i);
470: }
471: else
472: for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) {
473: u = d[i];
474: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
475: t += (u&nd_mask0);
476: }
1.167 noro 477: if ( nd_module && current_module_weight_vector && MPOS(d) )
478: t += current_module_weight_vector[MPOS(d)];
1.157 noro 479: return t;
1.1 noro 480: }
481:
1.231 noro 482: /* for sugarweight */
483:
484: int ndl_weight2(UINT *d)
485: {
486: int t,u;
487: int i,j;
488:
489: for ( i = 0, t = 0; i < nd_nvar; i++ ) {
490: u = GET_EXP(d,i);
491: t += nd_sugarweight[i]*u;
492: }
493: if ( nd_module && current_module_weight_vector && MPOS(d) )
494: t += current_module_weight_vector[MPOS(d)];
495: return t;
496: }
497:
1.61 noro 498: void ndl_weight_mask(UINT *d)
1.43 noro 499: {
1.157 noro 500: UINT t,u;
501: UINT *mask;
502: int i,j,k,l;
503:
504: l = nd_blockmask->n;
505: for ( k = 0; k < l; k++ ) {
506: mask = nd_blockmask->mask[k];
507: if ( current_dl_weight_vector )
508: for ( i = 0, t = 0; i < nd_nvar; i++ ) {
509: u = GET_EXP_MASK(d,i,mask);
510: t += MUL_WEIGHT(u,i);
511: }
512: else
513: for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) {
514: u = d[i]&mask[i];
515: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
516: t += (u&nd_mask0);
517: }
518: d[k+1] = t;
519: }
1.43 noro 520: }
521:
1.61 noro 522: int ndl_lex_compare(UINT *d1,UINT *d2)
1.1 noro 523: {
1.157 noro 524: int i;
1.1 noro 525:
1.157 noro 526: d1 += nd_exporigin;
527: d2 += nd_exporigin;
528: for ( i = nd_exporigin; i < nd_wpd; i++, d1++, d2++ )
529: if ( *d1 > *d2 )
530: return nd_isrlex ? -1 : 1;
531: else if ( *d1 < *d2 )
532: return nd_isrlex ? 1 : -1;
533: return 0;
1.1 noro 534: }
535:
1.61 noro 536: int ndl_block_compare(UINT *d1,UINT *d2)
1.43 noro 537: {
1.157 noro 538: int i,l,j,ord_o,ord_l;
539: struct order_pair *op;
540: UINT t1,t2,m;
541: UINT *mask;
542:
543: l = nd_blockmask->n;
544: op = nd_blockmask->order_pair;
545: for ( j = 0; j < l; j++ ) {
546: mask = nd_blockmask->mask[j];
547: ord_o = op[j].order;
548: if ( ord_o < 2 )
549: if ( (t1=d1[j+1]) > (t2=d2[j+1]) ) return 1;
550: else if ( t1 < t2 ) return -1;
551: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
552: m = mask[i];
553: t1 = d1[i]&m;
554: t2 = d2[i]&m;
555: if ( t1 > t2 )
556: return !ord_o ? -1 : 1;
557: else if ( t1 < t2 )
558: return !ord_o ? 1 : -1;
559: }
560: }
561: return 0;
1.43 noro 562: }
563:
1.96 noro 564: int ndl_matrix_compare(UINT *d1,UINT *d2)
565: {
1.219 noro 566: int i,j,s,row;
1.157 noro 567: int *v;
1.219 noro 568: Q **mat;
569: Q *w;
570: Q t,t1,t2;
1.96 noro 571:
1.157 noro 572: for ( j = 0; j < nd_nvar; j++ )
573: nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j);
1.219 noro 574: if ( nd_top_weight ) {
575: if ( OID(nd_top_weight) == O_VECT ) {
576: mat = (Q **)&BDY((VECT)nd_top_weight);
577: row = 1;
578: } else {
579: mat = (Q **)BDY((MAT)nd_top_weight);
580: row = ((MAT)nd_top_weight)->row;
581: }
582: for ( i = 0; i < row; i++ ) {
583: w = (Q *)mat[i];
584: for ( j = 0, t = 0; j < nd_nvar; j++ ) {
585: STOQ(nd_work_vector[j],t1);
586: mulq(w[j],t1,&t2);
587: addq(t,t2,&t1);
588: t = t1;
589: }
590: if ( t ) {
591: s = SGN(t);
592: if ( s > 0 ) return 1;
593: else if ( s < 0 ) return -1;
594: }
595: }
596: }
1.157 noro 597: for ( i = 0; i < nd_matrix_len; i++ ) {
598: v = nd_matrix[i];
599: for ( j = 0, s = 0; j < nd_nvar; j++ )
600: s += v[j]*nd_work_vector[j];
601: if ( s > 0 ) return 1;
602: else if ( s < 0 ) return -1;
603: }
1.219 noro 604: if ( !ndl_equal(d1,d2) )
605: error("afo");
1.157 noro 606: return 0;
1.96 noro 607: }
608:
1.97 noro 609: int ndl_composite_compare(UINT *d1,UINT *d2)
610: {
1.157 noro 611: int i,j,s,start,end,len,o;
612: int *v;
613: struct sparse_weight *sw;
614:
615: for ( j = 0; j < nd_nvar; j++ )
616: nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j);
617: for ( i = 0; i < nd_worb_len; i++ ) {
618: len = nd_worb[i].length;
619: switch ( nd_worb[i].type ) {
620: case IS_DENSE_WEIGHT:
621: v = nd_worb[i].body.dense_weight;
622: for ( j = 0, s = 0; j < len; j++ )
623: s += v[j]*nd_work_vector[j];
624: if ( s > 0 ) return 1;
625: else if ( s < 0 ) return -1;
626: break;
627: case IS_SPARSE_WEIGHT:
628: sw = nd_worb[i].body.sparse_weight;
629: for ( j = 0, s = 0; j < len; j++ )
630: s += sw[j].value*nd_work_vector[sw[j].pos];
631: if ( s > 0 ) return 1;
632: else if ( s < 0 ) return -1;
633: break;
634: case IS_BLOCK:
635: o = nd_worb[i].body.block.order;
636: start = nd_worb[i].body.block.start;
637: switch ( o ) {
638: case 0:
639: end = start+len;
640: for ( j = start, s = 0; j < end; j++ )
641: s += MUL_WEIGHT(nd_work_vector[j],j);
642: if ( s > 0 ) return 1;
643: else if ( s < 0 ) return -1;
644: for ( j = end-1; j >= start; j-- )
645: if ( nd_work_vector[j] < 0 ) return 1;
646: else if ( nd_work_vector[j] > 0 ) return -1;
647: break;
648: case 1:
649: end = start+len;
650: for ( j = start, s = 0; j < end; j++ )
651: s += MUL_WEIGHT(nd_work_vector[j],j);
652: if ( s > 0 ) return 1;
653: else if ( s < 0 ) return -1;
654: for ( j = start; j < end; j++ )
655: if ( nd_work_vector[j] > 0 ) return 1;
656: else if ( nd_work_vector[j] < 0 ) return -1;
657: break;
658: case 2:
1.236 noro 659: end = start+len;
1.157 noro 660: for ( j = start; j < end; j++ )
661: if ( nd_work_vector[j] > 0 ) return 1;
662: else if ( nd_work_vector[j] < 0 ) return -1;
663: break;
664: }
665: break;
666: }
667: }
668: return 0;
1.97 noro 669: }
670:
1.58 noro 671: /* TDH -> WW -> TD-> RL */
672:
1.61 noro 673: int ndl_ww_lex_compare(UINT *d1,UINT *d2)
1.58 noro 674: {
1.157 noro 675: int i,m,e1,e2;
1.58 noro 676:
1.157 noro 677: if ( TD(d1) > TD(d2) ) return 1;
678: else if ( TD(d1) < TD(d2) ) return -1;
679: m = nd_nvar>>1;
680: for ( i = 0, e1 = e2 = 0; i < m; i++ ) {
681: e1 += current_weyl_weight_vector[i]*(GET_EXP(d1,m+i)-GET_EXP(d1,i));
682: e2 += current_weyl_weight_vector[i]*(GET_EXP(d2,m+i)-GET_EXP(d2,i));
683: }
684: if ( e1 > e2 ) return 1;
685: else if ( e1 < e2 ) return -1;
686: return ndl_lex_compare(d1,d2);
687: }
688:
1.224 noro 689: int ndl_module_weight_compare(UINT *d1,UINT *d2)
690: {
691: int s,j;
692:
693: if ( nd_nvar != nd_poly_weight_len )
694: error("invalid module weight : the length of polynomial weight != the number of variables");
695: s = 0;
696: for ( j = 0; j < nd_nvar; j++ )
697: s += (GET_EXP(d1,j)-GET_EXP(d2,j))*nd_poly_weight[j];
1.226 noro 698: if ( MPOS(d1) >= 1 && MPOS(d2) >= 1 ) {
699: s += nd_module_weight[MPOS(d1)-1]-nd_module_weight[MPOS(d2)-1];
700: }
1.224 noro 701: if ( s > 0 ) return 1;
702: else if ( s < 0 ) return -1;
703: else return 0;
704: }
705:
1.157 noro 706: int ndl_module_grlex_compare(UINT *d1,UINT *d2)
707: {
1.164 noro 708: int i,c;
1.157 noro 709:
1.224 noro 710: if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c;
1.160 noro 711: if ( nd_ispot ) {
1.174 noro 712: if ( nd_pot_nelim && MPOS(d1)>=nd_pot_nelim+1 && MPOS(d2) >= nd_pot_nelim+1 ) {
713: if ( TD(d1) > TD(d2) ) return 1;
714: else if ( TD(d1) < TD(d2) ) return -1;
715: if ( c = ndl_lex_compare(d1,d2) ) return c;
716: if ( MPOS(d1) < MPOS(d2) ) return 1;
717: else if ( MPOS(d1) > MPOS(d2) ) return -1;
718: return 0;
719: }
1.157 noro 720: if ( MPOS(d1) < MPOS(d2) ) return 1;
721: else if ( MPOS(d1) > MPOS(d2) ) return -1;
722: }
723: if ( TD(d1) > TD(d2) ) return 1;
724: else if ( TD(d1) < TD(d2) ) return -1;
1.167 noro 725: if ( c = ndl_lex_compare(d1,d2) ) return c;
1.160 noro 726: if ( !nd_ispot ) {
1.157 noro 727: if ( MPOS(d1) < MPOS(d2) ) return 1;
728: else if ( MPOS(d1) > MPOS(d2) ) return -1;
729: }
730: return 0;
731: }
732:
733: int ndl_module_glex_compare(UINT *d1,UINT *d2)
734: {
1.164 noro 735: int i,c;
1.157 noro 736:
1.224 noro 737: if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c;
1.160 noro 738: if ( nd_ispot ) {
1.157 noro 739: if ( MPOS(d1) < MPOS(d2) ) return 1;
740: else if ( MPOS(d1) > MPOS(d2) ) return -1;
741: }
742: if ( TD(d1) > TD(d2) ) return 1;
743: else if ( TD(d1) < TD(d2) ) return -1;
1.167 noro 744: if ( c = ndl_lex_compare(d1,d2) ) return c;
1.160 noro 745: if ( !nd_ispot ) {
1.157 noro 746: if ( MPOS(d1) < MPOS(d2) ) return 1;
747: else if ( MPOS(d1) > MPOS(d2) ) return -1;
748: }
749: return 0;
750: }
751:
752: int ndl_module_lex_compare(UINT *d1,UINT *d2)
753: {
1.164 noro 754: int i,c;
1.157 noro 755:
1.224 noro 756: if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c;
1.160 noro 757: if ( nd_ispot ) {
1.157 noro 758: if ( MPOS(d1) < MPOS(d2) ) return 1;
759: else if ( MPOS(d1) > MPOS(d2) ) return -1;
760: }
1.167 noro 761: if ( c = ndl_lex_compare(d1,d2) ) return c;
1.160 noro 762: if ( !nd_ispot ) {
1.157 noro 763: if ( MPOS(d1) < MPOS(d2) ) return 1;
764: else if ( MPOS(d1) > MPOS(d2) ) return -1;
765: }
766: return 0;
767: }
768:
769: int ndl_module_block_compare(UINT *d1,UINT *d2)
770: {
771: int i,c;
772:
1.224 noro 773: if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c;
1.160 noro 774: if ( nd_ispot ) {
1.157 noro 775: if ( MPOS(d1) < MPOS(d2) ) return 1;
776: else if ( MPOS(d1) > MPOS(d2) ) return -1;
777: }
778: if ( c = ndl_block_compare(d1,d2) ) return c;
1.160 noro 779: if ( !nd_ispot ) {
1.157 noro 780: if ( MPOS(d1) < MPOS(d2) ) return 1;
781: else if ( MPOS(d1) > MPOS(d2) ) return -1;
782: }
783: return 0;
784: }
785:
786: int ndl_module_matrix_compare(UINT *d1,UINT *d2)
787: {
788: int i,c;
789:
1.224 noro 790: if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c;
1.160 noro 791: if ( nd_ispot ) {
1.157 noro 792: if ( MPOS(d1) < MPOS(d2) ) return 1;
793: else if ( MPOS(d1) > MPOS(d2) ) return -1;
794: }
795: if ( c = ndl_matrix_compare(d1,d2) ) return c;
1.160 noro 796: if ( !nd_ispot ) {
1.157 noro 797: if ( MPOS(d1) < MPOS(d2) ) return 1;
798: else if ( MPOS(d1) > MPOS(d2) ) return -1;
799: }
800: return 0;
801: }
802:
803: int ndl_module_composite_compare(UINT *d1,UINT *d2)
804: {
805: int i,c;
806:
1.224 noro 807: if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c;
1.160 noro 808: if ( nd_ispot ) {
1.157 noro 809: if ( MPOS(d1) > MPOS(d2) ) return 1;
810: else if ( MPOS(d1) < MPOS(d2) ) return -1;
811: }
812: if ( c = ndl_composite_compare(d1,d2) ) return c;
1.160 noro 813: if ( !nd_ispot ) {
1.157 noro 814: if ( MPOS(d1) > MPOS(d2) ) return 1;
815: else if ( MPOS(d1) < MPOS(d2) ) return -1;
816: }
817: return 0;
1.58 noro 818: }
819:
1.61 noro 820: INLINE int ndl_equal(UINT *d1,UINT *d2)
1.1 noro 821: {
1.157 noro 822: int i;
1.1 noro 823:
1.157 noro 824: switch ( nd_wpd ) {
825: case 2:
826: if ( TD(d2) != TD(d1) ) return 0;
827: if ( d2[1] != d1[1] ) return 0;
828: return 1;
829: break;
830: case 3:
831: if ( TD(d2) != TD(d1) ) return 0;
832: if ( d2[1] != d1[1] ) return 0;
833: if ( d2[2] != d1[2] ) return 0;
834: return 1;
835: break;
836: default:
837: for ( i = 0; i < nd_wpd; i++ )
838: if ( *d1++ != *d2++ ) return 0;
839: return 1;
840: break;
841: }
1.1 noro 842: }
843:
1.61 noro 844: INLINE void ndl_copy(UINT *d1,UINT *d2)
1.6 noro 845: {
1.157 noro 846: int i;
1.6 noro 847:
1.157 noro 848: switch ( nd_wpd ) {
849: case 2:
850: TD(d2) = TD(d1);
851: d2[1] = d1[1];
852: break;
853: case 3:
854: TD(d2) = TD(d1);
855: d2[1] = d1[1];
856: d2[2] = d1[2];
857: break;
858: default:
859: for ( i = 0; i < nd_wpd; i++ )
860: d2[i] = d1[i];
861: break;
862: }
1.6 noro 863: }
864:
1.61 noro 865: INLINE void ndl_zero(UINT *d)
866: {
1.157 noro 867: int i;
868: for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;
1.61 noro 869: }
870:
871: INLINE void ndl_add(UINT *d1,UINT *d2,UINT *d)
1.1 noro 872: {
1.157 noro 873: int i;
1.1 noro 874:
1.162 noro 875: if ( nd_module ) {
876: if ( MPOS(d1) && MPOS(d2) && (MPOS(d1) != MPOS(d2)) )
1.167 noro 877: error("ndl_add : invalid operation");
1.162 noro 878: }
1.43 noro 879: #if 1
1.157 noro 880: switch ( nd_wpd ) {
881: case 2:
882: TD(d) = TD(d1)+TD(d2);
883: d[1] = d1[1]+d2[1];
884: break;
885: case 3:
886: TD(d) = TD(d1)+TD(d2);
887: d[1] = d1[1]+d2[1];
888: d[2] = d1[2]+d2[2];
889: break;
890: default:
891: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i];
892: break;
893: }
1.43 noro 894: #else
1.157 noro 895: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i];
1.43 noro 896: #endif
1.6 noro 897: }
898:
1.55 noro 899: /* d1 += d2 */
1.61 noro 900: INLINE void ndl_addto(UINT *d1,UINT *d2)
1.55 noro 901: {
1.157 noro 902: int i;
1.55 noro 903:
1.162 noro 904: if ( nd_module ) {
905: if ( MPOS(d1) && MPOS(d2) && (MPOS(d1) != MPOS(d2)) )
906: error("ndl_addto : invalid operation");
907: }
1.55 noro 908: #if 1
1.157 noro 909: switch ( nd_wpd ) {
910: case 2:
911: TD(d1) += TD(d2);
912: d1[1] += d2[1];
913: break;
914: case 3:
915: TD(d1) += TD(d2);
916: d1[1] += d2[1];
917: d1[2] += d2[2];
918: break;
919: default:
920: for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i];
921: break;
922: }
1.55 noro 923: #else
1.157 noro 924: for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i];
1.55 noro 925: #endif
926: }
927:
1.61 noro 928: INLINE void ndl_sub(UINT *d1,UINT *d2,UINT *d)
1.6 noro 929: {
1.157 noro 930: int i;
1.6 noro 931:
1.157 noro 932: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]-d2[i];
1.1 noro 933: }
934:
1.61 noro 935: int ndl_disjoint(UINT *d1,UINT *d2)
1.1 noro 936: {
1.157 noro 937: UINT t1,t2,u,u1,u2;
938: int i,j;
1.1 noro 939:
1.157 noro 940: if ( nd_module && (MPOS(d1) == MPOS(d2)) ) return 0;
1.65 noro 941: #if USE_UNROLL
1.157 noro 942: switch ( nd_bpe ) {
943: case 3:
944: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
945: u1 = d1[i]; u2 = d2[i];
946: t1 = u1&0x38000000; t2 = u2&0x38000000; if ( t1&&t2 ) return 0;
947: t1 = u1& 0x7000000; t2 = u2& 0x7000000; if ( t1&&t2 ) return 0;
948: t1 = u1& 0xe00000; t2 = u2& 0xe00000; if ( t1&&t2 ) return 0;
949: t1 = u1& 0x1c0000; t2 = u2& 0x1c0000; if ( t1&&t2 ) return 0;
950: t1 = u1& 0x38000; t2 = u2& 0x38000; if ( t1&&t2 ) return 0;
951: t1 = u1& 0x7000; t2 = u2& 0x7000; if ( t1&&t2 ) return 0;
952: t1 = u1& 0xe00; t2 = u2& 0xe00; if ( t1&&t2 ) return 0;
953: t1 = u1& 0x1c0; t2 = u2& 0x1c0; if ( t1&&t2 ) return 0;
954: t1 = u1& 0x38; t2 = u2& 0x38; if ( t1&&t2 ) return 0;
955: t1 = u1& 0x7; t2 = u2& 0x7; if ( t1&&t2 ) return 0;
956: }
957: return 1;
958: break;
959: case 4:
960: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
961: u1 = d1[i]; u2 = d2[i];
962: t1 = u1&0xf0000000; t2 = u2&0xf0000000; if ( t1&&t2 ) return 0;
963: t1 = u1& 0xf000000; t2 = u2& 0xf000000; if ( t1&&t2 ) return 0;
964: t1 = u1& 0xf00000; t2 = u2& 0xf00000; if ( t1&&t2 ) return 0;
965: t1 = u1& 0xf0000; t2 = u2& 0xf0000; if ( t1&&t2 ) return 0;
966: t1 = u1& 0xf000; t2 = u2& 0xf000; if ( t1&&t2 ) return 0;
967: t1 = u1& 0xf00; t2 = u2& 0xf00; if ( t1&&t2 ) return 0;
968: t1 = u1& 0xf0; t2 = u2& 0xf0; if ( t1&&t2 ) return 0;
969: t1 = u1& 0xf; t2 = u2& 0xf; if ( t1&&t2 ) return 0;
970: }
971: return 1;
972: break;
973: case 6:
974: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
975: u1 = d1[i]; u2 = d2[i];
976: t1 = u1&0x3f000000; t2 = u2&0x3f000000; if ( t1&&t2 ) return 0;
977: t1 = u1& 0xfc0000; t2 = u2& 0xfc0000; if ( t1&&t2 ) return 0;
978: t1 = u1& 0x3f000; t2 = u2& 0x3f000; if ( t1&&t2 ) return 0;
979: t1 = u1& 0xfc0; t2 = u2& 0xfc0; if ( t1&&t2 ) return 0;
980: t1 = u1& 0x3f; t2 = u2& 0x3f; if ( t1&&t2 ) return 0;
981: }
982: return 1;
983: break;
984: case 8:
985: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
986: u1 = d1[i]; u2 = d2[i];
987: t1 = u1&0xff000000; t2 = u2&0xff000000; if ( t1&&t2 ) return 0;
988: t1 = u1& 0xff0000; t2 = u2& 0xff0000; if ( t1&&t2 ) return 0;
989: t1 = u1& 0xff00; t2 = u2& 0xff00; if ( t1&&t2 ) return 0;
990: t1 = u1& 0xff; t2 = u2& 0xff; if ( t1&&t2 ) return 0;
991: }
992: return 1;
993: break;
994: case 16:
995: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
996: u1 = d1[i]; u2 = d2[i];
997: t1 = u1&0xffff0000; t2 = u2&0xffff0000; if ( t1&&t2 ) return 0;
998: t1 = u1& 0xffff; t2 = u2& 0xffff; if ( t1&&t2 ) return 0;
999: }
1000: return 1;
1001: break;
1002: case 32:
1003: for ( i = nd_exporigin; i < nd_wpd; i++ )
1004: if ( d1[i] && d2[i] ) return 0;
1005: return 1;
1006: break;
1007: default:
1008: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1009: u1 = d1[i]; u2 = d2[i];
1010: for ( j = 0; j < nd_epw; j++ ) {
1011: if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0;
1012: u1 >>= nd_bpe; u2 >>= nd_bpe;
1013: }
1014: }
1015: return 1;
1016: break;
1017: }
1.65 noro 1018: #else
1.157 noro 1019: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1020: u1 = d1[i]; u2 = d2[i];
1021: for ( j = 0; j < nd_epw; j++ ) {
1022: if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0;
1023: u1 >>= nd_bpe; u2 >>= nd_bpe;
1024: }
1025: }
1026: return 1;
1.65 noro 1027: #endif
1.1 noro 1028: }
1029:
1.114 noro 1030: int ndl_check_bound(UINT *d1,UINT *d2)
1.1 noro 1031: {
1.157 noro 1032: UINT u2;
1033: int i,j,ind,k;
1.1 noro 1034:
1.157 noro 1035: ind = 0;
1.65 noro 1036: #if USE_UNROLL
1.157 noro 1037: switch ( nd_bpe ) {
1038: case 3:
1039: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1040: u2 = d2[i];
1041: if ( d1[ind++]+((u2>>27)&0x7) >= 0x8 ) return 1;
1042: if ( d1[ind++]+((u2>>24)&0x7) >= 0x8 ) return 1;
1043: if ( d1[ind++]+((u2>>21)&0x7) >= 0x8 ) return 1;
1044: if ( d1[ind++]+((u2>>18)&0x7) >= 0x8 ) return 1;
1045: if ( d1[ind++]+((u2>>15)&0x7) >= 0x8 ) return 1;
1046: if ( d1[ind++]+((u2>>12)&0x7) >= 0x8 ) return 1;
1047: if ( d1[ind++]+((u2>>9)&0x7) >= 0x8 ) return 1;
1048: if ( d1[ind++]+((u2>>6)&0x7) >= 0x8 ) return 1;
1049: if ( d1[ind++]+((u2>>3)&0x7) >= 0x8 ) return 1;
1050: if ( d1[ind++]+(u2&0x7) >= 0x8 ) return 1;
1051: }
1052: return 0;
1053: break;
1054: case 4:
1055: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1056: u2 = d2[i];
1057: if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1;
1058: if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1;
1059: if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1;
1060: if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1;
1061: if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1;
1062: if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1;
1063: if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1;
1064: if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1;
1065: }
1066: return 0;
1067: break;
1068: case 6:
1069: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1070: u2 = d2[i];
1071: if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1;
1072: if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1;
1073: if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1;
1074: if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1;
1075: if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1;
1076: }
1077: return 0;
1078: break;
1079: case 8:
1080: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1081: u2 = d2[i];
1082: if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1;
1083: if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1;
1084: if ( d1[ind++]+((u2>>8)&0xff) >= 0x100 ) return 1;
1085: if ( d1[ind++]+(u2&0xff) >= 0x100 ) return 1;
1086: }
1087: return 0;
1088: break;
1089: case 16:
1090: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1091: u2 = d2[i];
1092: if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1;
1093: if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1;
1094: }
1095: return 0;
1096: break;
1097: case 32:
1098: for ( i = nd_exporigin; i < nd_wpd; i++ )
1099: if ( d1[i]+d2[i]<d1[i] ) return 1;
1100: return 0;
1101: break;
1102: default:
1103: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1104: u2 = d2[i];
1105: k = (nd_epw-1)*nd_bpe;
1106: for ( j = 0; j < nd_epw; j++, k -= nd_bpe )
1107: if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1;
1108: }
1109: return 0;
1110: break;
1111: }
1.65 noro 1112: #else
1.157 noro 1113: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1114: u2 = d2[i];
1115: k = (nd_epw-1)*nd_bpe;
1116: for ( j = 0; j < nd_epw; j++, k -= nd_bpe )
1117: if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1;
1118: }
1119: return 0;
1.65 noro 1120: #endif
1.1 noro 1121: }
1122:
1.114 noro 1123: int ndl_check_bound2(int index,UINT *d2)
1124: {
1.157 noro 1125: return ndl_check_bound(nd_bound[index],d2);
1.114 noro 1126: }
1127:
1.61 noro 1128: INLINE int ndl_hash_value(UINT *d)
1.1 noro 1129: {
1.157 noro 1130: int i;
1131: int r;
1.1 noro 1132:
1.157 noro 1133: r = 0;
1134: for ( i = 0; i < nd_wpd; i++ )
1135: r = ((r<<16)+d[i])%REDTAB_LEN;
1136: return r;
1.1 noro 1137: }
1138:
1.63 noro 1139: INLINE int ndl_find_reducer(UINT *dg)
1.1 noro 1140: {
1.157 noro 1141: RHist r;
1142: int d,k,i;
1.1 noro 1143:
1.157 noro 1144: d = ndl_hash_value(dg);
1145: for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) {
1146: if ( ndl_equal(dg,DL(r)) ) {
1147: if ( k > 0 ) nd_notfirst++;
1148: nd_found++;
1149: return r->index;
1150: }
1151: }
1152: if ( Reverse )
1153: for ( i = nd_psn-1; i >= 0; i-- ) {
1154: r = nd_psh[i];
1155: if ( ndl_reducible(dg,DL(r)) ) {
1156: nd_create++;
1157: nd_append_red(dg,i);
1158: return i;
1159: }
1160: }
1161: else
1162: for ( i = 0; i < nd_psn; i++ ) {
1163: r = nd_psh[i];
1164: if ( ndl_reducible(dg,DL(r)) ) {
1165: nd_create++;
1166: nd_append_red(dg,i);
1167: return i;
1168: }
1169: }
1170: return -1;
1.1 noro 1171: }
1172:
1.63 noro 1173: ND nd_merge(ND p1,ND p2)
1174: {
1.157 noro 1175: int n,c;
1176: int t,can,td1,td2;
1177: ND r;
1178: NM m1,m2,mr0,mr,s;
1179:
1180: if ( !p1 ) return p2;
1181: else if ( !p2 ) return p1;
1182: else {
1183: can = 0;
1184: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1185: c = DL_COMPARE(DL(m1),DL(m2));
1186: switch ( c ) {
1187: case 0:
1188: s = m1; m1 = NEXT(m1);
1189: can++; NEXTNM2(mr0,mr,s);
1190: s = m2; m2 = NEXT(m2); FREENM(s);
1191: break;
1192: case 1:
1193: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
1194: break;
1195: case -1:
1196: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
1197: break;
1198: }
1199: }
1200: if ( !mr0 )
1201: if ( m1 ) mr0 = m1;
1202: else if ( m2 ) mr0 = m2;
1203: else return 0;
1204: else if ( m1 ) NEXT(mr) = m1;
1205: else if ( m2 ) NEXT(mr) = m2;
1206: else NEXT(mr) = 0;
1207: BDY(p1) = mr0;
1208: SG(p1) = MAX(SG(p1),SG(p2));
1209: LEN(p1) = LEN(p1)+LEN(p2)-can;
1210: FREEND(p2);
1211: return p1;
1212: }
1.63 noro 1213: }
1214:
1.31 noro 1215: ND nd_add(int mod,ND p1,ND p2)
1.1 noro 1216: {
1.157 noro 1217: int n,c;
1218: int t,can,td1,td2;
1219: ND r;
1220: NM m1,m2,mr0,mr,s;
1221:
1222: if ( !p1 ) return p2;
1223: else if ( !p2 ) return p1;
1224: else if ( mod == -1 ) return nd_add_sf(p1,p2);
1.232 noro 1225: else if ( mod == -2 ) return nd_add_lf(p1,p2);
1.157 noro 1226: else if ( !mod ) return nd_add_q(p1,p2);
1227: else {
1228: can = 0;
1229: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1230: c = DL_COMPARE(DL(m1),DL(m2));
1231: switch ( c ) {
1232: case 0:
1233: t = ((CM(m1))+(CM(m2))) - mod;
1234: if ( t < 0 ) t += mod;
1235: s = m1; m1 = NEXT(m1);
1236: if ( t ) {
1237: can++; NEXTNM2(mr0,mr,s); CM(mr) = (t);
1238: } else {
1239: can += 2; FREENM(s);
1240: }
1241: s = m2; m2 = NEXT(m2); FREENM(s);
1242: break;
1243: case 1:
1244: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
1245: break;
1246: case -1:
1247: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
1248: break;
1249: }
1250: }
1251: if ( !mr0 )
1252: if ( m1 ) mr0 = m1;
1253: else if ( m2 ) mr0 = m2;
1254: else return 0;
1255: else if ( m1 ) NEXT(mr) = m1;
1256: else if ( m2 ) NEXT(mr) = m2;
1257: else NEXT(mr) = 0;
1258: BDY(p1) = mr0;
1259: SG(p1) = MAX(SG(p1),SG(p2));
1260: LEN(p1) = LEN(p1)+LEN(p2)-can;
1261: FREEND(p2);
1262: return p1;
1263: }
1.95 noro 1264: }
1265:
1266: /* XXX on opteron, the inlined manipulation of destructive additon of
1267: * two NM seems to make gcc optimizer get confused, so the part is
1268: * done in a function.
1269: */
1270:
1.113 noro 1271: int nm_destructive_add_q(NM *m1,NM *m2,NM *mr0,NM *mr)
1.95 noro 1272: {
1.157 noro 1273: NM s;
1274: P t;
1275: int can;
1276:
1277: addp(nd_vc,CP(*m1),CP(*m2),&t);
1278: s = *m1; *m1 = NEXT(*m1);
1279: if ( t ) {
1280: can = 1; NEXTNM2(*mr0,*mr,s); CP(*mr) = (t);
1281: } else {
1282: can = 2; FREENM(s);
1283: }
1284: s = *m2; *m2 = NEXT(*m2); FREENM(s);
1285: return can;
1.95 noro 1286: }
1287:
1.113 noro 1288: ND nd_add_q(ND p1,ND p2)
1.95 noro 1289: {
1.157 noro 1290: int n,c,can;
1291: ND r;
1292: NM m1,m2,mr0,mr,s;
1293: P t;
1294:
1295: if ( !p1 ) return p2;
1296: else if ( !p2 ) return p1;
1297: else {
1298: can = 0;
1299: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1300: c = DL_COMPARE(DL(m1),DL(m2));
1301: switch ( c ) {
1302: case 0:
1.95 noro 1303: #if defined(__x86_64__)
1.157 noro 1304: can += nm_destructive_add_q(&m1,&m2,&mr0,&mr);
1.95 noro 1305: #else
1.157 noro 1306: addp(nd_vc,CP(m1),CP(m2),&t);
1307: s = m1; m1 = NEXT(m1);
1308: if ( t ) {
1309: can++; NEXTNM2(mr0,mr,s); CP(mr) = (t);
1310: } else {
1311: can += 2; FREENM(s);
1312: }
1313: s = m2; m2 = NEXT(m2); FREENM(s);
1.95 noro 1314: #endif
1.157 noro 1315: break;
1316: case 1:
1317: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
1318: break;
1319: case -1:
1320: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
1321: break;
1322: }
1323: }
1324: if ( !mr0 )
1325: if ( m1 ) mr0 = m1;
1326: else if ( m2 ) mr0 = m2;
1327: else return 0;
1328: else if ( m1 ) NEXT(mr) = m1;
1329: else if ( m2 ) NEXT(mr) = m2;
1330: else NEXT(mr) = 0;
1331: BDY(p1) = mr0;
1332: SG(p1) = MAX(SG(p1),SG(p2));
1333: LEN(p1) = LEN(p1)+LEN(p2)-can;
1334: FREEND(p2);
1335: return p1;
1336: }
1.17 noro 1337: }
1338:
1.71 noro 1339: ND nd_add_sf(ND p1,ND p2)
1340: {
1.157 noro 1341: int n,c,can;
1342: ND r;
1343: NM m1,m2,mr0,mr,s;
1344: int t;
1345:
1346: if ( !p1 ) return p2;
1347: else if ( !p2 ) return p1;
1348: else {
1349: can = 0;
1350: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1351: c = DL_COMPARE(DL(m1),DL(m2));
1352: switch ( c ) {
1353: case 0:
1354: t = _addsf(CM(m1),CM(m2));
1355: s = m1; m1 = NEXT(m1);
1356: if ( t ) {
1357: can++; NEXTNM2(mr0,mr,s); CM(mr) = (t);
1358: } else {
1359: can += 2; FREENM(s);
1360: }
1361: s = m2; m2 = NEXT(m2); FREENM(s);
1362: break;
1363: case 1:
1364: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
1365: break;
1366: case -1:
1367: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
1368: break;
1369: }
1370: }
1371: if ( !mr0 )
1372: if ( m1 ) mr0 = m1;
1373: else if ( m2 ) mr0 = m2;
1374: else return 0;
1375: else if ( m1 ) NEXT(mr) = m1;
1376: else if ( m2 ) NEXT(mr) = m2;
1377: else NEXT(mr) = 0;
1378: BDY(p1) = mr0;
1379: SG(p1) = MAX(SG(p1),SG(p2));
1380: LEN(p1) = LEN(p1)+LEN(p2)-can;
1381: FREEND(p2);
1382: return p1;
1383: }
1.71 noro 1384: }
1385:
1.232 noro 1386:
1.167 noro 1387: ND nd_reduce2(int mod,ND d,ND g,NDV p,NM mul,NDC dn,Obj *divp)
1.146 noro 1388: {
1.157 noro 1389: int c,c1,c2;
1390: Q cg,cred,gcd,tq;
1391: P cgp,credp,gcdp;
1392: Obj tr,tr1;
1393:
1.167 noro 1394: if ( mod == -1 ) {
1.157 noro 1395: CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g)));
1.167 noro 1396: *divp = (Obj)ONE;
1.232 noro 1397: } else if ( mod == -2 ) {
1398: GZ inv,t;
1399: divlf(ONEGZ,HCZ(p),&inv);
1400: chsgnlf(HCZ(g),&t);
1401: mullf(inv,t,&CZ(mul));
1402: *divp = (Obj)ONE;
1.167 noro 1403: } else if ( mod ) {
1.157 noro 1404: c1 = invm(HCM(p),mod); c2 = mod-HCM(g);
1405: DMAR(c1,c2,0,mod,c); CM(mul) = c;
1.167 noro 1406: *divp = (Obj)ONE;
1.157 noro 1407: } else if ( nd_vc ) {
1408: ezgcdpz(nd_vc,HCP(g),HCP(p),&gcdp);
1409: divsp(nd_vc,HCP(g),gcdp,&cgp); divsp(nd_vc,HCP(p),gcdp,&credp);
1410: chsgnp(cgp,&CP(mul));
1411: nd_mul_c_q(d,credp); nd_mul_c_q(g,credp);
1412: if ( dn ) {
1413: mulr(nd_vc,(Obj)dn->r,(Obj)credp,&tr);
1414: reductr(nd_vc,tr,&tr1); dn->r = (R)tr1;
1415: }
1.167 noro 1416: *divp = (Obj)credp;
1.157 noro 1417: } else {
1418: igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);
1419: chsgnq(cg,&CQ(mul));
1420: nd_mul_c_q(d,(P)cred); nd_mul_c_q(g,(P)cred);
1421: if ( dn ) {
1422: mulq(dn->z,cred,&tq); dn->z = tq;
1423: }
1.167 noro 1424: *divp = (Obj)cred;
1.157 noro 1425: }
1426: return nd_add(mod,g,ndv_mul_nm(mod,mul,p));
1.146 noro 1427: }
1428:
1.1 noro 1429: /* ret=1 : success, ret=0 : overflow */
1.146 noro 1430: int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND *rp)
1.1 noro 1431: {
1.157 noro 1432: NM m,mrd,tail;
1433: NM mul;
1434: int n,sugar,psugar,sugar0,stat,index;
1435: int c,c1,c2,dummy;
1436: RHist h;
1437: NDV p,red;
1.167 noro 1438: Q cg,cred,gcd,tq,qq,iq;
1439: DP dmul;
1440: NODE node;
1441: LIST hist;
1.157 noro 1442: double hmag;
1443: P tp,tp1;
1.167 noro 1444: Obj tr,tr1,div;
1445: union oNDC hg;
1446: P cont;
1.157 noro 1447:
1448: if ( dn ) {
1449: if ( mod )
1450: dn->m = 1;
1451: else if ( nd_vc )
1452: dn->r = (R)ONE;
1453: else
1454: dn->z = ONE;
1455: }
1456: if ( !g ) {
1457: *rp = d;
1458: return 1;
1459: }
1460: if ( !mod ) hmag = ((double)p_mag(HCP(g)))*nd_scale;
1461:
1462: sugar0 = sugar = SG(g);
1463: n = NV(g);
1.235 noro 1464: mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
1.157 noro 1465: if ( d )
1466: for ( tail = BDY(d); NEXT(tail); tail = NEXT(tail) );
1467: for ( ; g; ) {
1468: index = ndl_find_reducer(HDL(g));
1469: if ( index >= 0 ) {
1470: h = nd_psh[index];
1471: ndl_sub(HDL(g),DL(h),DL(mul));
1472: if ( ndl_check_bound2(index,DL(mul)) ) {
1473: nd_free(g); nd_free(d);
1474: return 0;
1475: }
1476: p = nd_demand ? ndv_load(index) : ps[index];
1.167 noro 1477: /* d+g -> div*(d+g)+mul*p */
1478: g = nd_reduce2(mod,d,g,p,mul,dn,&div);
1.172 noro 1479: if ( nd_gentrace ) {
1.167 noro 1480: /* Trace=[div,index,mul,ONE] */
1481: STOQ(index,iq);
1482: nmtodp(mod,mul,&dmul);
1483: node = mknode(4,div,iq,dmul,ONE);
1484: }
1.157 noro 1485: sugar = MAX(sugar,SG(p)+TD(DL(mul)));
1.193 noro 1486: if ( !mod && g && !nd_vc && ((double)(p_mag(HCP(g))) > hmag) ) {
1.167 noro 1487: hg = HCU(g);
1.157 noro 1488: nd_removecont2(d,g);
1.172 noro 1489: if ( dn || nd_gentrace ) {
1.167 noro 1490: /* overwrite cont : Trace=[div,index,mul,cont] */
1491: cont = ndc_div(mod,hg,HCU(g));
1492: if ( dn ) {
1493: if ( nd_vc ) {
1494: divr(nd_vc,(Obj)dn->r,(Obj)cont,&tr);
1495: reductr(nd_vc,(Obj)tr,&tr1); dn->r = (R)tr1;
1496: } else divq(dn->z,(Q)cont,&dn->z);
1.157 noro 1497: }
1.172 noro 1498: if ( nd_gentrace && !UNIQ(cont) ) ARG3(node) = (pointer)cont;
1.157 noro 1499: }
1500: hmag = ((double)p_mag(HCP(g)))*nd_scale;
1501: }
1.167 noro 1502: MKLIST(hist,node);
1503: MKNODE(node,hist,nd_tracelist); nd_tracelist = node;
1.157 noro 1504: } else if ( !full ) {
1505: *rp = g;
1506: return 1;
1507: } else {
1508: m = BDY(g);
1509: if ( NEXT(m) ) {
1510: BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--;
1511: } else {
1512: FREEND(g); g = 0;
1513: }
1514: if ( d ) {
1515: NEXT(tail)=m; tail=m; LEN(d)++;
1516: } else {
1517: MKND(n,m,1,d); tail = BDY(d);
1518: }
1519: }
1520: }
1521: if ( d ) SG(d) = sugar;
1522: *rp = d;
1523: return 1;
1.1 noro 1524: }
1.28 noro 1525:
1.53 noro 1526: int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp)
1.25 noro 1527: {
1.157 noro 1528: int hindex,index;
1529: NDV p;
1530: ND u,d,red;
1531: NODE l;
1532: NM mul,m,mrd,tail;
1533: int sugar,psugar,n,h_reducible;
1534: PGeoBucket bucket;
1535: int c,c1,c2;
1536: Q cg,cred,gcd,zzz;
1537: RHist h;
1538: double hmag,gmag;
1539: int count = 0;
1540: int hcount = 0;
1541:
1542: if ( !g ) {
1543: *rp = 0;
1544: return 1;
1545: }
1546: sugar = SG(g);
1547: n = NV(g);
1548: if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1549: bucket = create_pbucket();
1550: add_pbucket(mod,bucket,g);
1551: d = 0;
1.235 noro 1552: mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
1.157 noro 1553: while ( 1 ) {
1.232 noro 1554: if ( mod > 0 || mod == -1 )
1555: hindex = head_pbucket(mod,bucket);
1556: else if ( mod == -2 )
1557: hindex = head_pbucket_lf(bucket);
1558: else
1559: hindex = head_pbucket_q(bucket);
1.157 noro 1560: if ( hindex < 0 ) {
1561: if ( DP_Print > 3 ) printf("(%d %d)",count,hcount);
1562: if ( d ) SG(d) = sugar;
1563: *rp = d;
1564: return 1;
1565: }
1566: g = bucket->body[hindex];
1567: index = ndl_find_reducer(HDL(g));
1568: if ( index >= 0 ) {
1569: count++;
1570: if ( !d ) hcount++;
1571: h = nd_psh[index];
1572: ndl_sub(HDL(g),DL(h),DL(mul));
1573: if ( ndl_check_bound2(index,DL(mul)) ) {
1574: nd_free(d);
1575: free_pbucket(bucket);
1576: *rp = 0;
1577: return 0;
1578: }
1579: p = ps[index];
1580: if ( mod == -1 )
1581: CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g)));
1.232 noro 1582: else if ( mod == -2 ) {
1583: GZ inv,t;
1584: divlf(ONEGZ,HCZ(p),&inv);
1585: chsgnlf(HCZ(g),&t);
1586: mullf(inv,t,&CZ(mul));
1587: } else if ( mod ) {
1.157 noro 1588: c1 = invm(HCM(p),mod); c2 = mod-HCM(g);
1589: DMAR(c1,c2,0,mod,c); CM(mul) = c;
1590: } else {
1591: igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);
1592: chsgnq(cg,&CQ(mul));
1593: nd_mul_c_q(d,(P)cred);
1594: mulq_pbucket(bucket,cred);
1595: g = bucket->body[hindex];
1596: gmag = (double)p_mag((P)HCQ(g));
1597: }
1598: red = ndv_mul_nm(mod,mul,p);
1599: bucket->body[hindex] = nd_remove_head(g);
1600: red = nd_remove_head(red);
1601: add_pbucket(mod,bucket,red);
1602: psugar = SG(p)+TD(DL(mul));
1603: sugar = MAX(sugar,psugar);
1604: if ( !mod && hmag && (gmag > hmag) ) {
1605: g = normalize_pbucket(mod,bucket);
1606: if ( !g ) {
1607: if ( d ) SG(d) = sugar;
1608: *rp = d;
1609: return 1;
1610: }
1611: nd_removecont2(d,g);
1612: hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1613: add_pbucket(mod,bucket,g);
1614: }
1615: } else if ( !full ) {
1616: g = normalize_pbucket(mod,bucket);
1617: if ( g ) SG(g) = sugar;
1618: *rp = g;
1619: return 1;
1620: } else {
1621: m = BDY(g);
1622: if ( NEXT(m) ) {
1623: BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--;
1624: } else {
1625: FREEND(g); g = 0;
1626: }
1627: bucket->body[hindex] = g;
1628: NEXT(m) = 0;
1629: if ( d ) {
1630: NEXT(tail)=m; tail=m; LEN(d)++;
1631: } else {
1632: MKND(n,m,1,d); tail = BDY(d);
1633: }
1634: }
1635: }
1.25 noro 1636: }
1.27 noro 1637:
1.61 noro 1638: /* input : list of NDV, cand : list of NDV */
1.28 noro 1639:
1.170 noro 1640: int ndv_check_membership(int m,NODE input,int obpe,int oadv,EPOS oepos,NODE cand)
1.28 noro 1641: {
1.157 noro 1642: int n,i,stat;
1643: ND nf,d;
1644: NDV r;
1645: NODE t,s;
1646: union oNDC dn;
1.168 noro 1647: Q q;
1648: LIST list;
1.45 noro 1649:
1.172 noro 1650: ndv_setup(m,0,cand,nd_gentrace?1:0,1);
1.157 noro 1651: n = length(cand);
1.28 noro 1652:
1.172 noro 1653: if ( nd_gentrace ) { nd_alltracelist = 0; nd_tracelist = 0; }
1.157 noro 1654: /* membercheck : list is a subset of Id(cand) ? */
1.168 noro 1655: for ( t = input, i = 0; t; t = NEXT(t), i++ ) {
1.45 noro 1656: again:
1.168 noro 1657: nd_tracelist = 0;
1.157 noro 1658: if ( nd_bpe > obpe )
1659: r = ndv_dup_realloc((NDV)BDY(t),obpe,oadv,oepos);
1660: else
1661: r = (NDV)BDY(t);
1.234 noro 1662: if ( m ) ndv_mod(m,r);
1.171 noro 1663: d = ndvtond(m,r);
1664: stat = nd_nf(m,0,d,nd_ps,0,0,&nf);
1.157 noro 1665: if ( !stat ) {
1666: nd_reconstruct(0,0);
1667: goto again;
1668: } else if ( nf ) return 0;
1.172 noro 1669: if ( nd_gentrace ) {
1.168 noro 1670: nd_tracelist = reverse_node(nd_tracelist);
1671: MKLIST(list,nd_tracelist);
1672: STOQ(i,q); s = mknode(2,q,list); MKLIST(list,s);
1673: MKNODE(s,list,nd_alltracelist);
1674: nd_alltracelist = s; nd_tracelist = 0;
1675: }
1.157 noro 1676: if ( DP_Print ) { printf("."); fflush(stdout); }
1677: }
1678: if ( DP_Print ) { printf("\n"); }
1679: return 1;
1.23 noro 1680: }
1.1 noro 1681:
1682: ND nd_remove_head(ND p)
1683: {
1.157 noro 1684: NM m;
1.1 noro 1685:
1.157 noro 1686: m = BDY(p);
1687: if ( !NEXT(m) ) {
1688: FREEND(p); p = 0;
1689: } else {
1690: BDY(p) = NEXT(m); LEN(p)--;
1691: }
1692: FREENM(m);
1693: return p;
1.1 noro 1694: }
1695:
1.69 noro 1696: ND nd_separate_head(ND p,ND *head)
1697: {
1.157 noro 1698: NM m,m0;
1699: ND r;
1.69 noro 1700:
1.157 noro 1701: m = BDY(p);
1702: if ( !NEXT(m) ) {
1703: *head = p; p = 0;
1704: } else {
1705: m0 = m;
1706: BDY(p) = NEXT(m); LEN(p)--;
1707: NEXT(m0) = 0;
1708: MKND(NV(p),m0,1,r);
1709: *head = r;
1710: }
1711: return p;
1.69 noro 1712: }
1713:
1.1 noro 1714: PGeoBucket create_pbucket()
1715: {
1716: PGeoBucket g;
1.157 noro 1717:
1718: g = CALLOC(1,sizeof(struct oPGeoBucket));
1719: g->m = -1;
1720: return g;
1.1 noro 1721: }
1722:
1.25 noro 1723: void free_pbucket(PGeoBucket b) {
1.157 noro 1724: int i;
1.25 noro 1725:
1.157 noro 1726: for ( i = 0; i <= b->m; i++ )
1727: if ( b->body[i] ) {
1728: nd_free(b->body[i]);
1729: b->body[i] = 0;
1730: }
1.200 noro 1731: GCFREE(b);
1.25 noro 1732: }
1733:
1.63 noro 1734: void add_pbucket_symbolic(PGeoBucket g,ND d)
1735: {
1.157 noro 1736: int l,i,k,m;
1.63 noro 1737:
1.157 noro 1738: if ( !d )
1739: return;
1740: l = LEN(d);
1741: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
1742: /* 2^(k-1) < l <= 2^k (=m) */
1743: d = nd_merge(g->body[k],d);
1744: for ( ; d && LEN(d) > m; k++, m <<= 1 ) {
1745: g->body[k] = 0;
1746: d = nd_merge(g->body[k+1],d);
1747: }
1748: g->body[k] = d;
1749: g->m = MAX(g->m,k);
1.63 noro 1750: }
1751:
1.31 noro 1752: void add_pbucket(int mod,PGeoBucket g,ND d)
1.1 noro 1753: {
1.157 noro 1754: int l,i,k,m;
1.1 noro 1755:
1.157 noro 1756: if ( !d )
1757: return;
1758: l = LEN(d);
1759: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
1760: /* 2^(k-1) < l <= 2^k (=m) */
1761: d = nd_add(mod,g->body[k],d);
1762: for ( ; d && LEN(d) > m; k++, m <<= 1 ) {
1763: g->body[k] = 0;
1764: d = nd_add(mod,g->body[k+1],d);
1765: }
1766: g->body[k] = d;
1767: g->m = MAX(g->m,k);
1.1 noro 1768: }
1769:
1.113 noro 1770: void mulq_pbucket(PGeoBucket g,Q c)
1.26 noro 1771: {
1.157 noro 1772: int k;
1.26 noro 1773:
1.157 noro 1774: for ( k = 0; k <= g->m; k++ )
1775: nd_mul_c_q(g->body[k],(P)c);
1.26 noro 1776: }
1777:
1.63 noro 1778: NM remove_head_pbucket_symbolic(PGeoBucket g)
1779: {
1.157 noro 1780: int j,i,k,c;
1781: NM head;
1782:
1783: k = g->m;
1784: j = -1;
1785: for ( i = 0; i <= k; i++ ) {
1786: if ( !g->body[i] ) continue;
1787: if ( j < 0 ) j = i;
1788: else {
1789: c = DL_COMPARE(HDL(g->body[i]),HDL(g->body[j]));
1790: if ( c > 0 )
1791: j = i;
1792: else if ( c == 0 )
1793: g->body[i] = nd_remove_head(g->body[i]);
1794: }
1795: }
1796: if ( j < 0 ) return 0;
1797: else {
1798: head = BDY(g->body[j]);
1799: if ( !NEXT(head) ) {
1800: FREEND(g->body[j]);
1801: g->body[j] = 0;
1802: } else {
1803: BDY(g->body[j]) = NEXT(head);
1804: LEN(g->body[j])--;
1805: }
1806: return head;
1807: }
1.63 noro 1808: }
1809:
1.19 noro 1810: int head_pbucket(int mod,PGeoBucket g)
1.1 noro 1811: {
1.157 noro 1812: int j,i,c,k,nv,sum;
1813: UINT *di,*dj;
1814: ND gi,gj;
1815:
1816: k = g->m;
1817: while ( 1 ) {
1818: j = -1;
1819: for ( i = 0; i <= k; i++ ) {
1820: if ( !(gi = g->body[i]) )
1821: continue;
1822: if ( j < 0 ) {
1823: j = i;
1824: gj = g->body[j];
1825: dj = HDL(gj);
1826: sum = HCM(gj);
1827: } else {
1828: c = DL_COMPARE(HDL(gi),dj);
1829: if ( c > 0 ) {
1830: if ( sum ) HCM(gj) = sum;
1831: else g->body[j] = nd_remove_head(gj);
1832: j = i;
1833: gj = g->body[j];
1834: dj = HDL(gj);
1835: sum = HCM(gj);
1836: } else if ( c == 0 ) {
1837: if ( mod == -1 )
1838: sum = _addsf(sum,HCM(gi));
1839: else {
1840: sum = sum+HCM(gi)-mod;
1841: if ( sum < 0 ) sum += mod;
1842: }
1843: g->body[i] = nd_remove_head(gi);
1844: }
1845: }
1846: }
1847: if ( j < 0 ) return -1;
1848: else if ( sum ) {
1849: HCM(gj) = sum;
1850: return j;
1851: } else
1852: g->body[j] = nd_remove_head(gj);
1853: }
1.26 noro 1854: }
1855:
1.113 noro 1856: int head_pbucket_q(PGeoBucket g)
1.26 noro 1857: {
1.157 noro 1858: int j,i,c,k,nv;
1859: Q sum,t;
1860: ND gi,gj;
1861:
1862: k = g->m;
1863: while ( 1 ) {
1864: j = -1;
1865: for ( i = 0; i <= k; i++ ) {
1866: if ( !(gi = g->body[i]) ) continue;
1867: if ( j < 0 ) {
1868: j = i;
1869: gj = g->body[j];
1870: sum = HCQ(gj);
1871: } else {
1872: nv = NV(gi);
1873: c = DL_COMPARE(HDL(gi),HDL(gj));
1874: if ( c > 0 ) {
1875: if ( sum ) HCQ(gj) = sum;
1876: else g->body[j] = nd_remove_head(gj);
1877: j = i;
1878: gj = g->body[j];
1879: sum = HCQ(gj);
1880: } else if ( c == 0 ) {
1881: addq(sum,HCQ(gi),&t);
1882: sum = t;
1883: g->body[i] = nd_remove_head(gi);
1884: }
1885: }
1886: }
1887: if ( j < 0 ) return -1;
1888: else if ( sum ) {
1889: HCQ(gj) = sum;
1890: return j;
1891: } else
1892: g->body[j] = nd_remove_head(gj);
1893: }
1.1 noro 1894: }
1895:
1.232 noro 1896: int head_pbucket_lf(PGeoBucket g)
1897: {
1898: int j,i,c,k,nv;
1899: GZ sum,t;
1900: ND gi,gj;
1901:
1902: k = g->m;
1903: while ( 1 ) {
1904: j = -1;
1905: for ( i = 0; i <= k; i++ ) {
1906: if ( !(gi = g->body[i]) ) continue;
1907: if ( j < 0 ) {
1908: j = i;
1909: gj = g->body[j];
1910: sum = HCZ(gj);
1911: } else {
1912: nv = NV(gi);
1913: c = DL_COMPARE(HDL(gi),HDL(gj));
1914: if ( c > 0 ) {
1915: if ( sum ) HCZ(gj) = sum;
1916: else g->body[j] = nd_remove_head(gj);
1917: j = i;
1918: gj = g->body[j];
1919: sum = HCZ(gj);
1920: } else if ( c == 0 ) {
1921: addlf(sum,HCZ(gi),&t);
1922: sum = t;
1923: g->body[i] = nd_remove_head(gi);
1924: }
1925: }
1926: }
1927: if ( j < 0 ) return -1;
1928: else if ( sum ) {
1929: HCZ(gj) = sum;
1930: return j;
1931: } else
1932: g->body[j] = nd_remove_head(gj);
1933: }
1934: }
1935:
1.25 noro 1936: ND normalize_pbucket(int mod,PGeoBucket g)
1.1 noro 1937: {
1.157 noro 1938: int i;
1939: ND r,t;
1.1 noro 1940:
1.157 noro 1941: r = 0;
1942: for ( i = 0; i <= g->m; i++ ) {
1943: r = nd_add(mod,r,g->body[i]);
1944: g->body[i] = 0;
1945: }
1946: g->m = -1;
1947: return r;
1.1 noro 1948: }
1949:
1.150 noro 1950: #if 0
1951: void register_hcf(NDV p)
1952: {
1.157 noro 1953: DCP dc,t;
1954: P hc,h;
1955: int c;
1956: NODE l,l1,prev;
1957:
1958: hc = p->body->c.p;
1959: if ( !nd_vc || NUM(hc) ) return;
1960: fctrp(nd_vc,hc,&dc);
1961: for ( t = dc; t; t = NEXT(t) ) {
1962: h = t->c;
1963: if ( NUM(h) ) continue;
1964: for ( prev = 0, l = nd_hcf; l; prev = l, l = NEXT(l) ) {
1965: c = compp(nd_vc,h,(P)BDY(l));
1966: if ( c >= 0 ) break;
1967: }
1968: if ( !l || c > 0 ) {
1969: MKNODE(l1,h,l);
1970: if ( !prev )
1971: nd_hcf = l1;
1972: else
1973: NEXT(prev) = l1;
1974: }
1975: }
1.150 noro 1976: }
1977: #else
1978: void register_hcf(NDV p)
1979: {
1.157 noro 1980: DCP dc,t;
1981: P hc,h,q;
1982: Q dmy;
1983: int c;
1984: NODE l,l1,prev;
1985:
1986: hc = p->body->c.p;
1987: if ( NUM(hc) ) return;
1988: ptozp(hc,1,&dmy,&h);
1.150 noro 1989: #if 1
1.157 noro 1990: for ( l = nd_hcf; l; l = NEXT(l) ) {
1991: while ( 1 ) {
1992: if ( divtpz(nd_vc,h,(P)BDY(l),&q) ) h = q;
1993: else break;
1994: }
1995: }
1996: if ( NUM(h) ) return;
1.150 noro 1997: #endif
1.157 noro 1998: for ( prev = 0, l = nd_hcf; l; prev = l, l = NEXT(l) ) {
1999: c = compp(nd_vc,h,(P)BDY(l));
2000: if ( c >= 0 ) break;
2001: }
2002: if ( !l || c > 0 ) {
2003: MKNODE(l1,h,l);
2004: if ( !prev )
2005: nd_hcf = l1;
2006: else
2007: NEXT(prev) = l1;
2008: }
1.150 noro 2009: }
2010: #endif
2011:
1.122 noro 2012: int do_diagonalize(int sugar,int m)
1.92 noro 2013: {
1.157 noro 2014: int i,nh,stat;
2015: NODE r,g,t;
2016: ND h,nf,s,head;
2017: NDV nfv;
2018: Q q,num,den;
1.167 noro 2019: P nm,nmp,dn,mnp,dnp,cont,cont1;
2020: union oNDC hc;
2021: NODE node;
2022: LIST l;
2023: Q iq;
1.157 noro 2024:
2025: for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) {
1.172 noro 2026: if ( nd_gentrace ) {
1.167 noro 2027: /* Trace = [1,index,1,1] */
2028: STOQ(i,iq); node = mknode(4,ONE,iq,ONE,ONE);
2029: MKLIST(l,node); MKNODE(nd_tracelist,l,0);
2030: }
1.157 noro 2031: if ( nd_demand )
2032: nfv = ndv_load(i);
2033: else
2034: nfv = nd_ps[i];
2035: s = ndvtond(m,nfv);
2036: s = nd_separate_head(s,&head);
2037: stat = nd_nf(m,head,s,nd_ps,1,0,&nf);
2038: if ( !stat ) return 0;
2039: ndv_free(nfv);
1.167 noro 2040: hc = HCU(nf); nd_removecont(m,nf);
2041: cont = ndc_div(m,hc,HCU(nf));
1.172 noro 2042: if ( nd_gentrace ) finalize_tracelist(i,cont);
1.157 noro 2043: nfv = ndtondv(m,nf);
2044: nd_free(nf);
2045: nd_bound[i] = ndv_compute_bound(nfv);
2046: if ( !m ) register_hcf(nfv);
2047: if ( nd_demand ) {
2048: ndv_save(nfv,i);
2049: ndv_free(nfv);
2050: } else
2051: nd_ps[i] = nfv;
2052: }
2053: return 1;
1.92 noro 2054: }
2055:
1.209 noro 2056: LIST compute_splist()
2057: {
2058: NODE g,tn0,tn,node;
2059: LIST l0;
2060: ND_pairs d,t;
2061: int i;
2062: Q i1,i2;
2063:
2064: g = 0; d = 0;
2065: for ( i = 0; i < nd_psn; i++ ) {
2066: d = update_pairs(d,g,i,0);
2067: g = update_base(g,i);
2068: }
2069: for ( t = d, tn0 = 0; t; t = NEXT(t) ) {
2070: NEXTNODE(tn0,tn);
2071: STOQ(t->i1,i1); STOQ(t->i2,i2);
2072: node = mknode(2,i1,i2); MKLIST(l0,node);
2073: BDY(tn) = l0;
2074: }
2075: if ( tn0 ) NEXT(tn) = 0; MKLIST(l0,tn0);
2076: return l0;
2077: }
2078:
1.27 noro 2079: /* return value = 0 => input is not a GB */
2080:
1.168 noro 2081: NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,int **indp)
1.1 noro 2082: {
1.157 noro 2083: int i,nh,sugar,stat;
2084: NODE r,g,t;
2085: ND_pairs d;
2086: ND_pairs l;
2087: ND h,nf,s,head,nf1;
2088: NDV nfv;
2089: Q q,num,den;
1.167 noro 2090: union oNDC dn,hc;
1.157 noro 2091: int diag_count = 0;
1.167 noro 2092: P cont;
2093: LIST list;
1.157 noro 2094:
2095: g = 0; d = 0;
2096: for ( i = 0; i < nd_psn; i++ ) {
1.168 noro 2097: d = update_pairs(d,g,i,gensyz);
1.157 noro 2098: g = update_base(g,i);
2099: }
2100: sugar = 0;
2101: while ( d ) {
1.1 noro 2102: again:
1.157 noro 2103: l = nd_minp(d,&d);
1.228 noro 2104: if ( MaxDeg > 0 && SG(l) > MaxDeg ) break;
1.157 noro 2105: if ( SG(l) != sugar ) {
2106: if ( ishomo ) {
2107: diag_count = 0;
2108: stat = do_diagonalize(sugar,m);
2109: if ( !stat ) {
2110: NEXT(l) = d; d = l;
2111: d = nd_reconstruct(0,d);
2112: goto again;
2113: }
2114: }
2115: sugar = SG(l);
2116: if ( DP_Print ) fprintf(asir_out,"%d",sugar);
2117: }
2118: stat = nd_sp(m,0,l,&h);
2119: if ( !stat ) {
2120: NEXT(l) = d; d = l;
2121: d = nd_reconstruct(0,d);
2122: goto again;
2123: }
1.41 noro 2124: #if USE_GEOBUCKET
1.172 noro 2125: stat = (m&&!nd_gentrace)?nd_nf_pbucket(m,h,nd_ps,!Top,&nf)
1.167 noro 2126: :nd_nf(m,0,h,nd_ps,!Top,0,&nf);
1.41 noro 2127: #else
1.157 noro 2128: stat = nd_nf(m,0,h,nd_ps,!Top,0,&nf);
1.41 noro 2129: #endif
1.157 noro 2130: if ( !stat ) {
2131: NEXT(l) = d; d = l;
2132: d = nd_reconstruct(0,d);
2133: goto again;
2134: } else if ( nf ) {
1.168 noro 2135: if ( checkonly || gensyz ) return 0;
1.192 noro 2136: if ( nd_newelim ) {
2137: if ( nd_module ) {
2138: if ( MPOS(HDL(nf)) > 1 ) return 0;
2139: } else if ( !(HDL(nf)[nd_exporigin] & nd_mask[0]) ) return 0;
2140: }
1.157 noro 2141: if ( DP_Print ) { printf("+"); fflush(stdout); }
1.167 noro 2142: hc = HCU(nf);
1.157 noro 2143: nd_removecont(m,nf);
2144: if ( !m && nd_nalg ) {
2145: nd_monic(0,&nf);
2146: nd_removecont(m,nf);
2147: }
1.172 noro 2148: if ( nd_gentrace ) {
1.167 noro 2149: cont = ndc_div(m,hc,HCU(nf));
2150: if ( m || !UNIQ(cont) ) {
1.196 noro 2151: t = mknode(4,NULLP,NULLP,NULLP,cont);
1.167 noro 2152: MKLIST(list,t); MKNODE(t,list,nd_tracelist);
2153: nd_tracelist = t;
2154: }
2155: }
1.157 noro 2156: nfv = ndtondv(m,nf); nd_free(nf);
1.215 noro 2157: nh = ndv_newps(m,nfv,0,0);
1.157 noro 2158: if ( !m && (ishomo && ++diag_count == diag_period) ) {
2159: diag_count = 0;
2160: stat = do_diagonalize(sugar,m);
2161: if ( !stat ) {
2162: NEXT(l) = d; d = l;
2163: d = nd_reconstruct(1,d);
2164: goto again;
2165: }
2166: }
1.168 noro 2167: d = update_pairs(d,g,nh,0);
1.157 noro 2168: g = update_base(g,nh);
2169: FREENDP(l);
2170: } else {
1.172 noro 2171: if ( nd_gentrace && gensyz ) {
1.168 noro 2172: nd_tracelist = reverse_node(nd_tracelist);
2173: MKLIST(list,nd_tracelist);
2174: STOQ(-1,q); t = mknode(2,q,list); MKLIST(list,t);
2175: MKNODE(t,list,nd_alltracelist);
2176: nd_alltracelist = t; nd_tracelist = 0;
2177: }
1.157 noro 2178: if ( DP_Print ) { printf("."); fflush(stdout); }
2179: FREENDP(l);
2180: }
2181: }
1.167 noro 2182: conv_ilist(nd_demand,0,g,indp);
1.157 noro 2183: if ( !checkonly && DP_Print ) { printf("nd_gb done.\n"); fflush(stdout); }
2184: return g;
1.1 noro 2185: }
2186:
1.209 noro 2187: /* splist = [[i1,i2],...] */
2188:
2189: int check_splist(int m,NODE splist)
2190: {
2191: NODE t,p;
2192: ND_pairs d,r,l;
2193: int stat;
2194: ND h,nf;
2195:
2196: for ( d = 0, t = splist; t; t = NEXT(t) ) {
2197: p = BDY((LIST)BDY(t));
2198: NEXTND_pairs(d,r);
2199: r->i1 = QTOS((Q)ARG0(p)); r->i2 = QTOS((Q)ARG1(p));
2200: ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm);
2201: SG(r) = TD(LCM(r)); /* XXX */
2202: }
2203: if ( d ) NEXT(r) = 0;
2204:
2205: while ( d ) {
2206: again:
2207: l = nd_minp(d,&d);
2208: stat = nd_sp(m,0,l,&h);
2209: if ( !stat ) {
2210: NEXT(l) = d; d = l;
2211: d = nd_reconstruct(0,d);
2212: goto again;
2213: }
2214: stat = nd_nf(m,0,h,nd_ps,!Top,0,&nf);
2215: if ( !stat ) {
2216: NEXT(l) = d; d = l;
2217: d = nd_reconstruct(0,d);
2218: goto again;
2219: } else if ( nf ) return 0;
2220: if ( DP_Print) { printf("."); fflush(stdout); }
2221: }
2222: if ( DP_Print) { printf("done.\n"); fflush(stdout); }
2223: return 1;
2224: }
2225:
1.214 noro 2226: int check_splist_f4(int m,NODE splist)
2227: {
2228: UINT *s0vect;
2229: PGeoBucket bucket;
2230: NODE p,rp0,t;
2231: ND_pairs d,r,l,ll;
2232: int col,stat;
2233:
2234: for ( d = 0, t = splist; t; t = NEXT(t) ) {
2235: p = BDY((LIST)BDY(t));
2236: NEXTND_pairs(d,r);
2237: r->i1 = QTOS((Q)ARG0(p)); r->i2 = QTOS((Q)ARG1(p));
2238: ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm);
2239: SG(r) = TD(LCM(r)); /* XXX */
2240: }
2241: if ( d ) NEXT(r) = 0;
2242:
2243: while ( d ) {
2244: l = nd_minsugarp(d,&d);
2245: bucket = create_pbucket();
2246: stat = nd_sp_f4(m,0,l,bucket);
2247: if ( !stat ) {
2248: for ( ll = l; NEXT(ll); ll = NEXT(ll) );
2249: NEXT(ll) = d; d = l;
2250: d = nd_reconstruct(0,d);
2251: continue;
2252: }
2253: if ( bucket->m < 0 ) continue;
2254: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
2255: if ( !col ) {
2256: for ( ll = l; NEXT(ll); ll = NEXT(ll) );
2257: NEXT(ll) = d; d = l;
2258: d = nd_reconstruct(0,d);
2259: continue;
2260: }
2261: if ( nd_f4_red(m,l,0,s0vect,col,rp0,0) ) return 0;
2262: }
2263: return 1;
2264: }
2265:
1.122 noro 2266: int do_diagonalize_trace(int sugar,int m)
1.91 noro 2267: {
1.157 noro 2268: int i,nh,stat;
2269: NODE r,g,t;
2270: ND h,nf,nfq,s,head;
2271: NDV nfv,nfqv;
2272: Q q,den,num;
1.167 noro 2273: union oNDC hc;
2274: NODE node;
2275: LIST l;
2276: Q iq;
2277: P cont,cont1;
1.157 noro 2278:
2279: for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) {
1.172 noro 2280: if ( nd_gentrace ) {
1.167 noro 2281: /* Trace = [1,index,1,1] */
2282: STOQ(i,iq); node = mknode(4,ONE,iq,ONE,ONE);
2283: MKLIST(l,node); MKNODE(nd_tracelist,l,0);
2284: }
1.157 noro 2285: /* for nd_ps */
2286: s = ndvtond(m,nd_ps[i]);
2287: s = nd_separate_head(s,&head);
2288: stat = nd_nf_pbucket(m,s,nd_ps,1,&nf);
2289: if ( !stat ) return 0;
2290: nf = nd_add(m,head,nf);
2291: ndv_free(nd_ps[i]);
2292: nd_ps[i] = ndtondv(m,nf);
2293: nd_free(nf);
2294:
2295: /* for nd_ps_trace */
2296: if ( nd_demand )
2297: nfv = ndv_load(i);
2298: else
2299: nfv = nd_ps_trace[i];
2300: s = ndvtond(0,nfv);
2301: s = nd_separate_head(s,&head);
2302: stat = nd_nf(0,head,s,nd_ps_trace,1,0,&nf);
2303: if ( !stat ) return 0;
2304: ndv_free(nfv);
1.167 noro 2305: hc = HCU(nf); nd_removecont(0,nf);
2306: cont = ndc_div(0,hc,HCU(nf));
1.172 noro 2307: if ( nd_gentrace ) finalize_tracelist(i,cont);
1.157 noro 2308: nfv = ndtondv(0,nf);
2309: nd_free(nf);
2310: nd_bound[i] = ndv_compute_bound(nfv);
2311: register_hcf(nfv);
2312: if ( nd_demand ) {
2313: ndv_save(nfv,i);
2314: ndv_free(nfv);
2315: } else
2316: nd_ps_trace[i] = nfv;
2317: }
2318: return 1;
1.91 noro 2319: }
2320:
1.118 noro 2321: static struct oEGT eg_invdalg;
2322: struct oEGT eg_le;
2323:
1.147 noro 2324: void nd_subst_vector(VL vl,P p,NODE subst,P *r)
2325: {
1.157 noro 2326: NODE tn;
2327: P p1;
1.147 noro 2328:
1.157 noro 2329: for ( tn = subst; tn; tn = NEXT(NEXT(tn)) ) {
2330: substp(vl,p,BDY(tn),BDY(NEXT(tn)),&p1); p = p1;
2331: }
2332: *r = p;
1.147 noro 2333: }
2334:
1.167 noro 2335: NODE nd_gb_trace(int m,int ishomo,int **indp)
1.20 noro 2336: {
1.157 noro 2337: int i,nh,sugar,stat;
2338: NODE r,g,t;
2339: ND_pairs d;
2340: ND_pairs l;
2341: ND h,nf,nfq,s,head;
2342: NDV nfv,nfqv;
2343: Q q,den,num;
2344: P hc;
1.167 noro 2345: union oNDC dn,hnfq;
1.157 noro 2346: struct oEGT eg_monic,egm0,egm1;
2347: int diag_count = 0;
1.167 noro 2348: P cont;
2349: LIST list;
1.157 noro 2350:
2351: init_eg(&eg_monic);
2352: init_eg(&eg_invdalg);
2353: init_eg(&eg_le);
2354: g = 0; d = 0;
2355: for ( i = 0; i < nd_psn; i++ ) {
1.168 noro 2356: d = update_pairs(d,g,i,0);
1.157 noro 2357: g = update_base(g,i);
2358: }
2359: sugar = 0;
2360: while ( d ) {
1.20 noro 2361: again:
1.157 noro 2362: l = nd_minp(d,&d);
1.228 noro 2363: if ( MaxDeg > 0 && SG(l) > MaxDeg ) break;
1.157 noro 2364: if ( SG(l) != sugar ) {
1.130 noro 2365: #if 1
1.157 noro 2366: if ( ishomo ) {
2367: if ( DP_Print > 2 ) fprintf(asir_out,"|");
2368: stat = do_diagonalize_trace(sugar,m);
2369: if ( DP_Print > 2 ) fprintf(asir_out,"|");
2370: diag_count = 0;
2371: if ( !stat ) {
2372: NEXT(l) = d; d = l;
2373: d = nd_reconstruct(1,d);
2374: goto again;
2375: }
2376: }
1.130 noro 2377: #endif
1.157 noro 2378: sugar = SG(l);
2379: if ( DP_Print ) fprintf(asir_out,"%d",sugar);
2380: }
2381: stat = nd_sp(m,0,l,&h);
2382: if ( !stat ) {
2383: NEXT(l) = d; d = l;
2384: d = nd_reconstruct(1,d);
2385: goto again;
2386: }
1.41 noro 2387: #if USE_GEOBUCKET
1.157 noro 2388: stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf);
1.41 noro 2389: #else
1.157 noro 2390: stat = nd_nf(m,0,h,nd_ps,!Top,0,&nf);
1.41 noro 2391: #endif
1.157 noro 2392: if ( !stat ) {
2393: NEXT(l) = d; d = l;
2394: d = nd_reconstruct(1,d);
2395: goto again;
2396: } else if ( nf ) {
2397: if ( nd_demand ) {
2398: nfqv = ndv_load(nd_psn);
2399: nfq = ndvtond(0,nfqv);
2400: } else
2401: nfq = 0;
2402: if ( !nfq ) {
2403: if ( !nd_sp(0,1,l,&h) || !nd_nf(0,0,h,nd_ps_trace,!Top,0,&nfq) ) {
2404: NEXT(l) = d; d = l;
2405: d = nd_reconstruct(1,d);
2406: goto again;
2407: }
2408: }
2409: if ( nfq ) {
2410: /* m|HC(nfq) => failure */
2411: if ( nd_vc ) {
2412: nd_subst_vector(nd_vc,HCP(nfq),nd_subst,&hc); q = (Q)hc;
2413: } else
2414: q = HCQ(nfq);
2415: if ( !rem(NM(q),m) ) return 0;
2416:
2417: if ( DP_Print ) { printf("+"); fflush(stdout); }
1.167 noro 2418: hnfq = HCU(nfq);
1.157 noro 2419: if ( nd_nalg ) {
2420: /* m|DN(HC(nf)^(-1)) => failure */
2421: get_eg(&egm0);
2422: if ( !nd_monic(m,&nfq) ) return 0;
2423: get_eg(&egm1); add_eg(&eg_monic,&egm0,&egm1);
2424: nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq);
2425: nfv = ndv_dup(0,nfqv); ndv_mod(m,nfv); nd_free(nf);
2426: } else {
2427: nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq);
2428: nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf);
2429: }
1.172 noro 2430: if ( nd_gentrace ) {
1.167 noro 2431: cont = ndc_div(0,hnfq,HCU(nfqv));
2432: if ( !UNIQ(cont) ) {
1.196 noro 2433: t = mknode(4,NULLP,NULLP,NULLP,cont);
1.167 noro 2434: MKLIST(list,t); MKNODE(t,list,nd_tracelist);
2435: nd_tracelist = t;
2436: }
2437: }
1.215 noro 2438: nh = ndv_newps(0,nfv,nfqv,0);
1.157 noro 2439: if ( ishomo && ++diag_count == diag_period ) {
2440: diag_count = 0;
2441: if ( DP_Print > 2 ) fprintf(asir_out,"|");
2442: stat = do_diagonalize_trace(sugar,m);
2443: if ( DP_Print > 2 ) fprintf(asir_out,"|");
2444: if ( !stat ) {
2445: NEXT(l) = d; d = l;
2446: d = nd_reconstruct(1,d);
2447: goto again;
2448: }
2449: }
1.168 noro 2450: d = update_pairs(d,g,nh,0);
1.157 noro 2451: g = update_base(g,nh);
2452: } else {
2453: if ( DP_Print ) { printf("*"); fflush(stdout); }
2454: }
2455: } else {
2456: if ( DP_Print ) { printf("."); fflush(stdout); }
2457: }
2458: FREENDP(l);
2459: }
2460: if ( nd_nalg ) {
1.227 noro 2461: if ( DP_Print ) {
2462: print_eg("monic",&eg_monic);
2463: print_eg("invdalg",&eg_invdalg);
2464: print_eg("le",&eg_le);
2465: }
1.157 noro 2466: }
1.167 noro 2467: conv_ilist(nd_demand,1,g,indp);
1.157 noro 2468: if ( DP_Print ) { printf("nd_gb_trace done.\n"); fflush(stdout); }
2469: return g;
1.20 noro 2470: }
2471:
1.23 noro 2472: int ndv_compare(NDV *p1,NDV *p2)
2473: {
1.157 noro 2474: return DL_COMPARE(HDL(*p1),HDL(*p2));
1.23 noro 2475: }
2476:
2477: int ndv_compare_rev(NDV *p1,NDV *p2)
2478: {
1.157 noro 2479: return -DL_COMPARE(HDL(*p1),HDL(*p2));
1.23 noro 2480: }
2481:
1.167 noro 2482: int ndvi_compare(NDVI p1,NDVI p2)
2483: {
2484: return DL_COMPARE(HDL(p1->p),HDL(p2->p));
2485: }
2486:
2487: int ndvi_compare_rev(NDVI p1,NDVI p2)
2488: {
2489: return -DL_COMPARE(HDL(p1->p),HDL(p2->p));
2490: }
2491:
1.61 noro 2492: NODE ndv_reduceall(int m,NODE f)
1.23 noro 2493: {
1.167 noro 2494: int i,j,n,stat;
1.157 noro 2495: ND nf,g,head;
2496: NODE t,a0,a;
2497: union oNDC dn;
2498: Q q,num,den;
1.167 noro 2499: NODE node;
2500: LIST l;
2501: Q iq,jq;
2502: int *perm;
2503: union oNDC hc;
2504: P cont,cont1;
1.23 noro 2505:
1.173 noro 2506: if ( nd_nora ) return f;
1.157 noro 2507: n = length(f);
2508: ndv_setup(m,0,f,0,1);
1.167 noro 2509: perm = (int *)MALLOC(n*sizeof(int));
1.172 noro 2510: if ( nd_gentrace ) {
1.167 noro 2511: for ( t = nd_tracelist, i = 0; i < n; i++, t = NEXT(t) )
2512: perm[i] = QTOS((Q)ARG1(BDY((LIST)BDY(t))));
2513: }
1.157 noro 2514: for ( i = 0; i < n; ) {
1.172 noro 2515: if ( nd_gentrace ) {
1.167 noro 2516: /* Trace = [1,index,1,1] */
2517: STOQ(i,iq); node = mknode(4,ONE,iq,ONE,ONE);
2518: MKLIST(l,node); MKNODE(nd_tracelist,l,0);
2519: }
1.157 noro 2520: g = ndvtond(m,nd_ps[i]);
2521: g = nd_separate_head(g,&head);
2522: stat = nd_nf(m,head,g,nd_ps,1,0,&nf);
2523: if ( !stat )
2524: nd_reconstruct(0,0);
2525: else {
2526: if ( DP_Print ) { printf("."); fflush(stdout); }
2527: ndv_free(nd_ps[i]);
1.167 noro 2528: hc = HCU(nf); nd_removecont(m,nf);
1.172 noro 2529: if ( nd_gentrace ) {
1.167 noro 2530: for ( t = nd_tracelist; t; t = NEXT(t) ) {
2531: jq = ARG1(BDY((LIST)BDY(t))); j = QTOS(jq);
2532: STOQ(perm[j],jq); ARG1(BDY((LIST)BDY(t))) = jq;
2533: }
2534: cont = ndc_div(m,hc,HCU(nf));
2535: finalize_tracelist(perm[i],cont);
2536: }
1.157 noro 2537: nd_ps[i] = ndtondv(m,nf); nd_free(nf);
2538: nd_bound[i] = ndv_compute_bound(nd_ps[i]);
2539: i++;
2540: }
2541: }
2542: if ( DP_Print ) { printf("\n"); }
2543: for ( a0 = 0, i = 0; i < n; i++ ) {
2544: NEXTNODE(a0,a);
1.172 noro 2545: if ( !nd_gentrace ) BDY(a) = (pointer)nd_ps[i];
1.167 noro 2546: else {
2547: for ( j = 0; j < n; j++ ) if ( perm[j] == i ) break;
2548: BDY(a) = (pointer)nd_ps[j];
2549: }
1.157 noro 2550: }
2551: NEXT(a) = 0;
2552: return a0;
1.23 noro 2553: }
2554:
1.168 noro 2555: ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t, int gensyz)
1.1 noro 2556: {
1.157 noro 2557: ND_pairs d1,nd,cur,head,prev,remove;
1.1 noro 2558:
1.157 noro 2559: if ( !g ) return d;
1.168 noro 2560: /* for testing */
1.172 noro 2561: if ( gensyz && nd_gensyz == 2 ) {
1.168 noro 2562: d1 = nd_newpairs(g,t);
2563: if ( !d )
2564: return d1;
2565: else {
2566: nd = d;
2567: while ( NEXT(nd) ) nd = NEXT(nd);
2568: NEXT(nd) = d1;
2569: return d;
2570: }
2571: }
1.157 noro 2572: d = crit_B(d,t);
2573: d1 = nd_newpairs(g,t);
2574: d1 = crit_M(d1);
2575: d1 = crit_F(d1);
1.168 noro 2576: if ( gensyz || do_weyl )
1.157 noro 2577: head = d1;
2578: else {
2579: prev = 0; cur = head = d1;
2580: while ( cur ) {
2581: if ( crit_2( cur->i1,cur->i2 ) ) {
2582: remove = cur;
2583: if ( !prev ) head = cur = NEXT(cur);
2584: else cur = NEXT(prev) = NEXT(cur);
2585: FREENDP(remove);
2586: } else {
2587: prev = cur; cur = NEXT(cur);
2588: }
2589: }
2590: }
2591: if ( !d )
2592: return head;
2593: else {
2594: nd = d;
2595: while ( NEXT(nd) ) nd = NEXT(nd);
2596: NEXT(nd) = head;
2597: return d;
2598: }
1.1 noro 2599: }
2600:
1.157 noro 2601:
1.1 noro 2602: ND_pairs nd_newpairs( NODE g, int t )
2603: {
1.157 noro 2604: NODE h;
2605: UINT *dl;
1.187 noro 2606: int ts,s,i,t0,min,max;
1.157 noro 2607: ND_pairs r,r0;
2608:
2609: dl = DL(nd_psh[t]);
2610: ts = SG(nd_psh[t]) - TD(dl);
1.195 noro 2611: if ( nd_module && nd_intersect && (MPOS(dl) > 1) ) return 0;
1.157 noro 2612: for ( r0 = 0, h = g; h; h = NEXT(h) ) {
1.159 noro 2613: if ( nd_module && (MPOS(DL(nd_psh[(long)BDY(h)])) != MPOS(dl)) )
1.157 noro 2614: continue;
1.187 noro 2615: if ( nd_gbblock ) {
2616: t0 = (long)BDY(h);
2617: for ( i = 0; nd_gbblock[i] >= 0; i += 2 ) {
2618: min = nd_gbblock[i]; max = nd_gbblock[i+1];
2619: if ( t0 >= min && t0 <= max && t >= min && t <= max )
2620: break;
2621: }
1.188 noro 2622: if ( nd_gbblock[i] >= 0 )
1.187 noro 2623: continue;
2624: }
1.157 noro 2625: NEXTND_pairs(r0,r);
1.159 noro 2626: r->i1 = (long)BDY(h);
1.157 noro 2627: r->i2 = t;
2628: ndl_lcm(DL(nd_psh[r->i1]),dl,r->lcm);
2629: s = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1]));
2630: SG(r) = MAX(s,ts) + TD(LCM(r));
1.231 noro 2631: /* experimental */
2632: if ( nd_sugarweight )
2633: r->sugar2 = ndl_weight2(r->lcm);
1.157 noro 2634: }
2635: if ( r0 ) NEXT(r) = 0;
2636: return r0;
1.1 noro 2637: }
2638:
1.231 noro 2639: /* ipair = [i1,i2],[i1,i2],... */
2640: ND_pairs nd_ipairtospair(NODE ipair)
2641: {
2642: int s1,s2;
2643: NODE tn,t;
2644: ND_pairs r,r0;
2645:
2646: for ( r0 = 0, t = ipair; t; t = NEXT(t) ) {
2647: NEXTND_pairs(r0,r);
2648: tn = BDY((LIST)BDY(t));
2649: r->i1 = QTOS((Q)ARG0(tn));
2650: r->i2 = QTOS((Q)ARG1(tn));
2651: ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm);
2652: s1 = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1]));
2653: s2 = SG(nd_psh[r->i2])-TD(DL(nd_psh[r->i2]));
2654: SG(r) = MAX(s1,s2) + TD(LCM(r));
2655: /* experimental */
2656: if ( nd_sugarweight )
2657: r->sugar2 = ndl_weight2(r->lcm);
2658: }
2659: if ( r0 ) NEXT(r) = 0;
2660: return r0;
2661: }
2662:
1.157 noro 2663: /* kokokara */
2664:
1.1 noro 2665: ND_pairs crit_B( ND_pairs d, int s )
2666: {
1.157 noro 2667: ND_pairs cur,head,prev,remove;
2668: UINT *t,*tl,*lcm;
2669: int td,tdl;
2670:
2671: if ( !d ) return 0;
2672: t = DL(nd_psh[s]);
2673: prev = 0;
2674: head = cur = d;
1.235 noro 2675: lcm = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
1.157 noro 2676: while ( cur ) {
2677: tl = cur->lcm;
1.163 noro 2678: if ( ndl_reducible(tl,t) ) {
2679: ndl_lcm(DL(nd_psh[cur->i1]),t,lcm);
1.167 noro 2680: if ( !ndl_equal(lcm,tl) ) {
2681: ndl_lcm(DL(nd_psh[cur->i2]),t,lcm);
2682: if (!ndl_equal(lcm,tl)) {
2683: remove = cur;
2684: if ( !prev ) {
2685: head = cur = NEXT(cur);
2686: } else {
2687: cur = NEXT(prev) = NEXT(cur);
2688: }
2689: FREENDP(remove);
2690: } else {
2691: prev = cur; cur = NEXT(cur);
2692: }
2693: } else {
2694: prev = cur; cur = NEXT(cur);
2695: }
1.157 noro 2696: } else {
2697: prev = cur; cur = NEXT(cur);
2698: }
2699: }
2700: return head;
1.1 noro 2701: }
2702:
2703: ND_pairs crit_M( ND_pairs d1 )
2704: {
1.157 noro 2705: ND_pairs e,d2,d3,dd,p;
2706: UINT *id,*jd;
1.1 noro 2707:
1.157 noro 2708: if ( !d1 ) return d1;
2709: for ( dd = 0, e = d1; e; e = d3 ) {
2710: if ( !(d2 = NEXT(e)) ) {
2711: NEXT(e) = dd;
2712: return e;
2713: }
2714: id = LCM(e);
2715: for ( d3 = 0; d2; d2 = p ) {
2716: p = NEXT(d2);
2717: jd = LCM(d2);
2718: if ( ndl_equal(jd,id) )
2719: ;
2720: else if ( TD(jd) > TD(id) )
2721: if ( ndl_reducible(jd,id) ) continue;
2722: else ;
2723: else if ( ndl_reducible(id,jd) ) goto delit;
2724: NEXT(d2) = d3;
2725: d3 = d2;
2726: }
2727: NEXT(e) = dd;
2728: dd = e;
2729: continue;
2730: /**/
2731: delit: NEXT(d2) = d3;
2732: d3 = d2;
2733: for ( ; p; p = d2 ) {
2734: d2 = NEXT(p);
2735: NEXT(p) = d3;
2736: d3 = p;
2737: }
2738: FREENDP(e);
2739: }
2740: return dd;
1.1 noro 2741: }
2742:
2743: ND_pairs crit_F( ND_pairs d1 )
2744: {
1.157 noro 2745: ND_pairs rest, head,remove;
2746: ND_pairs last, p, r, w;
2747: int s;
2748:
2749: if ( !d1 ) return d1;
2750: for ( head = last = 0, p = d1; NEXT(p); ) {
2751: r = w = equivalent_pairs(p,&rest);
2752: s = SG(r);
2753: w = NEXT(w);
2754: while ( w ) {
2755: if ( crit_2(w->i1,w->i2) ) {
2756: r = w;
2757: w = NEXT(w);
2758: while ( w ) {
2759: remove = w;
2760: w = NEXT(w);
2761: FREENDP(remove);
2762: }
2763: break;
2764: } else if ( SG(w) < s ) {
2765: FREENDP(r);
2766: r = w;
2767: s = SG(r);
2768: w = NEXT(w);
2769: } else {
2770: remove = w;
2771: w = NEXT(w);
2772: FREENDP(remove);
2773: }
2774: }
2775: if ( last ) NEXT(last) = r;
2776: else head = r;
2777: NEXT(last = r) = 0;
2778: p = rest;
2779: if ( !p ) return head;
2780: }
2781: if ( !last ) return p;
2782: NEXT(last) = p;
2783: return head;
1.1 noro 2784: }
2785:
2786: int crit_2( int dp1, int dp2 )
2787: {
1.157 noro 2788: return ndl_disjoint(DL(nd_psh[dp1]),DL(nd_psh[dp2]));
1.1 noro 2789: }
2790:
1.40 noro 2791: ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest )
1.1 noro 2792: {
1.157 noro 2793: ND_pairs w,p,r,s;
2794: UINT *d;
1.1 noro 2795:
1.157 noro 2796: w = d1;
2797: d = LCM(w);
2798: s = NEXT(w);
2799: NEXT(w) = 0;
2800: for ( r = 0; s; s = p ) {
2801: p = NEXT(s);
2802: if ( ndl_equal(d,LCM(s)) ) {
2803: NEXT(s) = w; w = s;
2804: } else {
2805: NEXT(s) = r; r = s;
2806: }
2807: }
2808: *prest = r;
2809: return w;
1.1 noro 2810: }
2811:
2812: NODE update_base(NODE nd,int ndp)
2813: {
1.157 noro 2814: UINT *dl, *dln;
2815: NODE last, p, head;
1.1 noro 2816:
1.157 noro 2817: dl = DL(nd_psh[ndp]);
2818: for ( head = last = 0, p = nd; p; ) {
1.159 noro 2819: dln = DL(nd_psh[(long)BDY(p)]);
1.157 noro 2820: if ( ndl_reducible( dln, dl ) ) {
2821: p = NEXT(p);
2822: if ( last ) NEXT(last) = p;
2823: } else {
2824: if ( !last ) head = p;
2825: p = NEXT(last = p);
2826: }
2827: }
2828: head = append_one(head,ndp);
2829: return head;
1.1 noro 2830: }
2831:
2832: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest )
2833: {
1.157 noro 2834: ND_pairs m,ml,p,l;
2835: UINT *lcm;
2836: int s,td,len,tlen,c,c1;
2837:
2838: if ( !(p = NEXT(m = d)) ) {
2839: *prest = p;
2840: NEXT(m) = 0;
2841: return m;
2842: }
2843: if ( !NoSugar ) {
1.231 noro 2844: if ( nd_sugarweight ) {
2845: s = m->sugar2;
2846: for ( ml = 0, l = m; p; p = NEXT(l = p) )
2847: if ( (p->sugar2 < s)
2848: || ((p->sugar2 == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) {
2849: ml = l; m = p; s = m->sugar2;
2850: }
2851: } else {
2852: s = SG(m);
2853: for ( ml = 0, l = m; p; p = NEXT(l = p) )
2854: if ( (SG(p) < s)
2855: || ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) {
2856: ml = l; m = p; s = SG(m);
2857: }
2858: }
1.157 noro 2859: } else {
2860: for ( ml = 0, l = m; p; p = NEXT(l = p) )
2861: if ( DL_COMPARE(LCM(p),LCM(m)) < 0 ) {
2862: ml = l; m = p; s = SG(m);
2863: }
2864: }
2865: if ( !ml ) *prest = NEXT(m);
2866: else {
2867: NEXT(ml) = NEXT(m);
2868: *prest = d;
2869: }
2870: NEXT(m) = 0;
2871: return m;
1.1 noro 2872: }
2873:
1.63 noro 2874: ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest )
2875: {
1.157 noro 2876: int msugar,i;
2877: ND_pairs t,dm0,dm,dr0,dr;
1.63 noro 2878:
1.231 noro 2879: if ( nd_sugarweight ) {
2880: for ( msugar = d->sugar2, t = NEXT(d); t; t = NEXT(t) )
2881: if ( t->sugar2 < msugar ) msugar = t->sugar2;
2882: dm0 = 0; dr0 = 0;
2883: for ( i = 0, t = d; t; t = NEXT(t) )
2884: if ( i < nd_f4_nsp && t->sugar2 == msugar ) {
2885: if ( dm0 ) NEXT(dm) = t;
2886: else dm0 = t;
2887: dm = t;
2888: i++;
2889: } else {
2890: if ( dr0 ) NEXT(dr) = t;
2891: else dr0 = t;
2892: dr = t;
2893: }
2894: } else {
2895: for ( msugar = SG(d), t = NEXT(d); t; t = NEXT(t) )
2896: if ( SG(t) < msugar ) msugar = SG(t);
2897: dm0 = 0; dr0 = 0;
2898: for ( i = 0, t = d; t; t = NEXT(t) )
2899: if ( i < nd_f4_nsp && SG(t) == msugar ) {
2900: if ( dm0 ) NEXT(dm) = t;
2901: else dm0 = t;
2902: dm = t;
2903: i++;
2904: } else {
2905: if ( dr0 ) NEXT(dr) = t;
2906: else dr0 = t;
2907: dr = t;
2908: }
2909: }
1.157 noro 2910: NEXT(dm) = 0;
2911: if ( dr0 ) NEXT(dr) = 0;
2912: *prest = dr0;
2913: return dm0;
1.63 noro 2914: }
2915:
1.239 noro 2916: int nd_tdeg(NDV c)
2917: {
2918: int wmax = 0;
2919: int i,len;
2920: NMV a;
2921:
2922: len = LEN(c);
2923: for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) )
2924: wmax = MAX(TD(DL(a)),wmax);
2925: return wmax;
2926: }
2927:
1.215 noro 2928: int ndv_newps(int m,NDV a,NDV aq,int f4)
1.1 noro 2929: {
1.157 noro 2930: int len;
2931: RHist r;
2932: NDV b;
1.167 noro 2933: NODE tn;
2934: LIST l;
2935: Q iq;
1.157 noro 2936:
2937: if ( nd_psn == nd_pslen ) {
2938: nd_pslen *= 2;
2939: nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV));
1.215 noro 2940: nd_ps_gz = (NDV *)REALLOC((char *)nd_ps_gz,nd_pslen*sizeof(NDV));
1.157 noro 2941: nd_ps_trace = (NDV *)REALLOC((char *)nd_ps_trace,nd_pslen*sizeof(NDV));
2942: nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist));
2943: nd_bound = (UINT **)
2944: REALLOC((char *)nd_bound,nd_pslen*sizeof(UINT *));
1.215 noro 2945: nd_ps_sym = (NDV *)REALLOC((char *)nd_ps_sym,nd_pslen*sizeof(NDV));
2946: nd_ps_trace_sym = (NDV *)REALLOC((char *)nd_ps_trace_sym,nd_pslen*sizeof(NDV));
1.157 noro 2947: }
2948: NEWRHist(r); nd_psh[nd_psn] = r;
2949: nd_ps[nd_psn] = a;
2950: if ( aq ) {
2951: nd_ps_trace[nd_psn] = aq;
1.234 noro 2952: if ( !m ) {
2953: if ( !nd_vc ) nd_ps_gz[nd_psn] = ndvtondvgz(aq);
2954: register_hcf(aq);
2955: } else if ( m == -2 ) {
2956: /* do nothing */
2957: } else
2958: error("ndv_newps : invalud modulus");
1.157 noro 2959: nd_bound[nd_psn] = ndv_compute_bound(aq);
1.239 noro 2960: #if 1
2961: SG(r) = SG(aq);
2962: #else
2963: SG(r) = nd_tdeg(aq);
2964: #endif
2965: ndl_copy(HDL(aq),DL(r));
1.157 noro 2966: } else {
2967: if ( !m ) register_hcf(a);
2968: nd_bound[nd_psn] = ndv_compute_bound(a);
1.239 noro 2969: #if 1
2970: SG(r) = SG(a);
2971: #else
2972: SG(r) = nd_tdeg(a);
2973: #endif
2974: ndl_copy(HDL(a),DL(r));
1.217 noro 2975: if ( !m && !nd_vc ) nd_ps_gz[nd_psn] = ndvtondvgz(a);
1.157 noro 2976: }
2977: if ( nd_demand ) {
2978: if ( aq ) {
2979: ndv_save(nd_ps_trace[nd_psn],nd_psn);
1.235 noro 2980: nd_ps_sym[nd_psn] = ndv_symbolic(m,nd_ps_trace[nd_psn]);
1.215 noro 2981: nd_ps_trace_sym[nd_psn] = ndv_symbolic(m,nd_ps_trace[nd_psn]);
1.157 noro 2982: nd_ps_trace[nd_psn] = 0;
2983: } else {
2984: ndv_save(nd_ps[nd_psn],nd_psn);
1.215 noro 2985: nd_ps_sym[nd_psn] = ndv_symbolic(m,nd_ps[nd_psn]);
1.157 noro 2986: nd_ps[nd_psn] = 0;
2987: }
2988: }
1.172 noro 2989: if ( nd_gentrace ) {
1.167 noro 2990: /* reverse the tracelist and append it to alltracelist */
2991: nd_tracelist = reverse_node(nd_tracelist); MKLIST(l,nd_tracelist);
2992: STOQ(nd_psn,iq); tn = mknode(2,iq,l); MKLIST(l,tn);
2993: MKNODE(tn,l,nd_alltracelist); nd_alltracelist = tn; nd_tracelist = 0;
2994: }
1.157 noro 2995: return nd_psn++;
1.1 noro 2996: }
2997:
1.167 noro 2998: /* nd_tracelist = [[0,index,div],...,[nd_psn-1,index,div]] */
1.177 noro 2999: /* return 1 if success, 0 if failure (HC(a mod p)) */
1.167 noro 3000:
1.177 noro 3001: int ndv_setup(int mod,int trace,NODE f,int dont_sort,int dont_removecont)
1.1 noro 3002: {
1.157 noro 3003: int i,j,td,len,max;
1.167 noro 3004: NODE s,s0,f0,tn;
1.157 noro 3005: UINT *d;
3006: RHist r;
1.167 noro 3007: NDVI w;
1.157 noro 3008: NDV a,am;
1.167 noro 3009: union oNDC hc;
3010: NODE node;
3011: P hcp;
3012: Q iq,jq,hcq;
3013: LIST l;
1.157 noro 3014:
3015: nd_found = 0; nd_notfirst = 0; nd_create = 0;
1.167 noro 3016: /* initialize the tracelist */
3017: nd_tracelist = 0;
1.157 noro 3018:
3019: for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++;
1.235 noro 3020: w = (NDVI)MALLOC(nd_psn*sizeof(struct oNDVI));
1.167 noro 3021: for ( i = j = 0, s = f; s; s = NEXT(s), j++ )
3022: if ( BDY(s) ) { w[i].p = BDY(s); w[i].i = j; i++; }
1.157 noro 3023: if ( !dont_sort ) {
3024: /* XXX heuristic */
3025: if ( !nd_ord->id && (nd_ord->ord.simple<2) )
1.167 noro 3026: qsort(w,nd_psn,sizeof(struct oNDVI),
3027: (int (*)(const void *,const void *))ndvi_compare_rev);
1.157 noro 3028: else
1.167 noro 3029: qsort(w,nd_psn,sizeof(struct oNDVI),
3030: (int (*)(const void *,const void *))ndvi_compare);
1.157 noro 3031: }
3032: nd_pslen = 2*nd_psn;
3033: nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.215 noro 3034: nd_ps_gz = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.157 noro 3035: nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.215 noro 3036: nd_ps_sym = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
3037: nd_ps_trace_sym = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.157 noro 3038: nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist));
3039: nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *));
3040: nd_hcf = 0;
3041:
3042: if ( trace && nd_vc )
3043: makesubst(nd_vc,&nd_subst);
3044: else
3045: nd_subst = 0;
3046:
3047: if ( !nd_red )
3048: nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist));
3049: for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0;
3050: for ( i = 0; i < nd_psn; i++ ) {
1.167 noro 3051: hc = HCU(w[i].p);
1.157 noro 3052: if ( trace ) {
1.234 noro 3053: if ( mod == -2 ) {
3054: /* over a large finite field */
3055: /* trace = small modulus */
3056: a = nd_ps_trace[i] = ndv_dup(-2,w[i].p);
3057: ndv_mod(-2,a);
3058: if ( !dont_removecont) ndv_removecont(-2,a);
3059: am = nd_ps[i] = ndv_dup(trace,w[i].p);
3060: ndv_mod(trace,am);
3061: if ( DL_COMPARE(HDL(am),HDL(a)) )
3062: return 0;
3063: ndv_removecont(trace,am);
3064: } else {
3065: a = nd_ps_trace[i] = ndv_dup(0,w[i].p);
3066: if ( !nd_vc ) nd_ps_gz[i] = ndvtondvgz(a);
3067: if ( !dont_removecont) ndv_removecont(0,a);
3068: register_hcf(a);
3069: am = nd_ps[i] = ndv_dup(mod,a);
3070: ndv_mod(mod,am);
3071: if ( DL_COMPARE(HDL(am),HDL(a)) )
3072: return 0;
3073: ndv_removecont(mod,am);
3074: }
1.157 noro 3075: } else {
1.167 noro 3076: a = nd_ps[i] = ndv_dup(mod,w[i].p);
1.217 noro 3077: if ( !mod && !nd_vc ) nd_ps_gz[i] = ndvtondvgz(a);
1.157 noro 3078: if ( mod || !dont_removecont ) ndv_removecont(mod,a);
3079: if ( !mod ) register_hcf(a);
3080: }
1.172 noro 3081: if ( nd_gentrace ) {
1.167 noro 3082: STOQ(i,iq); STOQ(w[i].i,jq); node = mknode(3,iq,jq,ONE);
1.168 noro 3083: if ( !dont_removecont )
3084: ARG2(node) = (pointer)ndc_div(trace?0:mod,hc,HCU(a));
1.167 noro 3085: MKLIST(l,node); NEXTNODE(nd_tracelist,tn); BDY(tn) = l;
3086: }
1.157 noro 3087: NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r));
3088: nd_bound[i] = ndv_compute_bound(a);
3089: nd_psh[i] = r;
3090: if ( nd_demand ) {
3091: if ( trace ) {
3092: ndv_save(nd_ps_trace[i],i);
1.235 noro 3093: nd_ps_sym[i] = ndv_symbolic(mod,nd_ps_trace[i]);
1.215 noro 3094: nd_ps_trace_sym[i] = ndv_symbolic(mod,nd_ps_trace[i]);
1.157 noro 3095: nd_ps_trace[i] = 0;
3096: } else {
3097: ndv_save(nd_ps[i],i);
1.215 noro 3098: nd_ps_sym[i] = ndv_symbolic(mod,nd_ps[i]);
1.157 noro 3099: nd_ps[i] = 0;
3100: }
3101: }
3102: }
1.172 noro 3103: if ( nd_gentrace && nd_tracelist ) NEXT(tn) = 0;
1.177 noro 3104: return 1;
1.20 noro 3105: }
3106:
1.119 noro 3107: struct order_spec *append_block(struct order_spec *spec,
3108: int nv,int nalg,int ord);
3109:
1.121 noro 3110: extern VECT current_dl_weight_vector_obj;
3111: static VECT prev_weight_vector_obj;
3112:
1.120 noro 3113: void preprocess_algcoef(VL vv,VL av,struct order_spec *ord,LIST f,
1.157 noro 3114: struct order_spec **ord1p,LIST *f1p,NODE *alistp)
1.120 noro 3115: {
1.157 noro 3116: NODE alist,t,s,r0,r,arg;
3117: VL tv;
3118: P poly;
3119: DP d;
3120: Alg alpha,dp;
3121: DAlg inv,da,hc;
3122: MP m;
3123: int i,nvar,nalg,n;
3124: NumberField nf;
3125: LIST f1,f2;
3126: struct order_spec *current_spec;
3127: VECT obj,obj0;
1.232 noro 3128: VECT tmp;
1.157 noro 3129:
3130: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++);
3131: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++);
3132:
3133: for ( alist = 0, tv = av; tv; tv = NEXT(tv) ) {
3134: NEXTNODE(alist,t); MKV(tv->v,poly);
3135: MKAlg(poly,alpha); BDY(t) = (pointer)alpha;
3136: tv->v = tv->v->priv;
3137: }
3138: NEXT(t) = 0;
3139:
1.167 noro 3140: /* simplification, making polynomials monic */
1.157 noro 3141: setfield_dalg(alist);
1.232 noro 3142: obj_algtodalg((Obj)f,(Obj *)&f1);
1.157 noro 3143: for ( t = BDY(f); t; t = NEXT(t) ) {
3144: initd(ord); ptod(vv,vv,(P)BDY(t),&d);
3145: hc = (DAlg)BDY(d)->c;
3146: if ( NID(hc) == N_DA ) {
3147: invdalg(hc,&inv);
3148: for ( m = BDY(d); m; m = NEXT(m) ) {
1.238 noro 3149: muldalg(inv,(DAlg)m->c,&da); m->c = (Obj)da;
1.157 noro 3150: }
3151: }
1.238 noro 3152: initd(ord); dtop(vv,vv,d,(Obj *)&poly); BDY(f) = (pointer)poly;
1.157 noro 3153: }
1.232 noro 3154: obj_dalgtoalg((Obj)f1,(Obj *)&f);
1.157 noro 3155:
3156: /* append alg vars to the var list */
3157: for ( tv = vv; NEXT(tv); tv = NEXT(tv) );
3158: NEXT(tv) = av;
3159:
3160: /* append a block to ord */
3161: *ord1p = append_block(ord,nvar,nalg,2);
3162:
3163: /* create generator list */
3164: nf = get_numberfield();
3165: for ( i = nalg-1, t = BDY(f); i >= 0; i-- ) {
3166: MKAlg(nf->defpoly[i],dp);
3167: MKNODE(s,dp,t); t = s;
3168: }
3169: MKLIST(f1,t);
3170: *alistp = alist;
1.232 noro 3171: algobjtorat((Obj)f1,(Obj *)f1p);
1.157 noro 3172:
3173: /* creating a new weight vector */
3174: prev_weight_vector_obj = obj0 = current_dl_weight_vector_obj;
3175: n = nvar+nalg+1;
3176: MKVECT(obj,n);
3177: if ( obj0 && obj0->len == nvar )
3178: for ( i = 0; i < nvar; i++ ) BDY(obj)[i] = BDY(obj0)[i];
3179: else
3180: for ( i = 0; i < nvar; i++ ) BDY(obj)[i] = (pointer)ONE;
3181: for ( i = 0; i < nalg; i++ ) BDY(obj)[i+nvar] = 0;
3182: BDY(obj)[n-1] = (pointer)ONE;
3183: arg = mknode(1,obj);
3184: Pdp_set_weight(arg,&tmp);
1.121 noro 3185: }
3186:
3187: NODE postprocess_algcoef(VL av,NODE alist,NODE r)
3188: {
1.157 noro 3189: NODE s,t,u0,u;
3190: P p;
3191: VL tv;
1.232 noro 3192: Obj obj;
3193: VECT tmp;
1.157 noro 3194: NODE arg;
3195:
3196: u0 = 0;
3197: for ( t = r; t; t = NEXT(t) ) {
3198: p = (P)BDY(t);
3199: for ( tv = av, s = alist; tv; tv = NEXT(tv), s = NEXT(s) ) {
3200: substr(CO,0,(Obj)p,tv->v,(Obj)BDY(s),&obj); p = (P)obj;
3201: }
3202: if ( OID(p) == O_P || (OID(p) == O_N && NID((Num)p) != N_A) ) {
3203: NEXTNODE(u0,u);
3204: BDY(u) = (pointer)p;
3205: }
3206: }
3207: arg = mknode(1,prev_weight_vector_obj);
3208: Pdp_set_weight(arg,&tmp);
1.121 noro 3209:
1.157 noro 3210: return u0;
1.120 noro 3211: }
3212:
1.199 noro 3213: void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int f4,struct order_spec *ord,LIST *rp)
1.1 noro 3214: {
1.157 noro 3215: VL tv,fv,vv,vc,av;
3216: NODE fd,fd0,r,r0,t,x,s,xx,alist;
3217: int e,max,nvar,i;
3218: NDV b;
1.184 noro 3219: int ishomo,nalg,mrank,trank,wmax,len;
3220: NMV a;
1.157 noro 3221: Alg alpha,dp;
3222: P p,zp;
3223: Q dmy;
3224: LIST f1,f2,zpl;
3225: Obj obj;
3226: NumberField nf;
3227: struct order_spec *ord1;
1.208 noro 3228: NODE tr,tl1,tl2,tl3,tl4,nzlist;
1.170 noro 3229: LIST l1,l2,l3,l4,l5;
1.167 noro 3230: int j;
1.198 noro 3231: Q jq,bpe;
1.167 noro 3232: int *perm;
1.170 noro 3233: EPOS oepos;
1.194 noro 3234: int obpe,oadv,ompos,cbpe;
1.1 noro 3235:
1.174 noro 3236: nd_module = 0;
1.157 noro 3237: if ( !m && Demand ) nd_demand = 1;
3238: else nd_demand = 0;
1.172 noro 3239: parse_nd_option(current_option);
1.78 noro 3240:
1.157 noro 3241: if ( DP_Multiple )
3242: nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1);
1.103 noro 3243: #if 0
1.157 noro 3244: ndv_alloc = 0;
1.103 noro 3245: #endif
1.157 noro 3246: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
1.229 noro 3247: if ( m && nd_vc )
3248: error("nd_{gr,f4} : computation over Fp(X) is unsupported. Use dp_gr_mod_main().");
1.157 noro 3249: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
3250: switch ( ord->id ) {
3251: case 1:
3252: if ( ord->nv != nvar )
3253: error("nd_{gr,f4} : invalid order specification");
3254: break;
3255: default:
3256: break;
3257: }
3258: nd_nalg = 0;
3259: av = 0;
3260: if ( !m ) {
3261: get_algtree((Obj)f,&av);
3262: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
3263: nd_ntrans = nvar;
3264: nd_nalg = nalg;
3265: /* #i -> t#i */
3266: if ( nalg ) {
3267: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
3268: ord = ord1;
3269: f = f1;
3270: }
3271: nvar += nalg;
3272: }
3273: nd_init_ord(ord);
3274: mrank = 0;
1.178 noro 3275: for ( t = BDY(f), max = 1; t; t = NEXT(t) )
1.157 noro 3276: for ( tv = vv; tv; tv = NEXT(tv) ) {
3277: if ( nd_module ) {
3278: s = BDY((LIST)BDY(t));
3279: trank = length(s);
3280: mrank = MAX(mrank,trank);
3281: for ( ; s; s = NEXT(s) ) {
3282: e = getdeg(tv->v,(P)BDY(s));
3283: max = MAX(e,max);
3284: }
3285: } else {
3286: e = getdeg(tv->v,(P)BDY(t));
3287: max = MAX(e,max);
3288: }
3289: }
1.208 noro 3290: nd_setup_parameters(nvar,nd_nzlist?0:max);
1.170 noro 3291: obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; ompos = nd_mpos;
1.157 noro 3292: ishomo = 1;
3293: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
1.167 noro 3294: if ( nd_module ) {
1.172 noro 3295: if ( !m && !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl);
1.167 noro 3296: else zpl = (LIST)BDY(t);
1.157 noro 3297: b = (pointer)pltondv(CO,vv,zpl);
3298: } else {
1.172 noro 3299: if ( !m && !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp);
1.167 noro 3300: else zp = (P)BDY(t);
1.157 noro 3301: b = (pointer)ptondv(CO,vv,zp);
1.167 noro 3302: }
1.157 noro 3303: if ( ishomo )
3304: ishomo = ishomo && ndv_ishomo(b);
3305: if ( m ) ndv_mod(m,b);
3306: if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; }
3307: }
3308: if ( fd0 ) NEXT(fd) = 0;
1.184 noro 3309:
3310: if ( !ishomo && homo ) {
3311: for ( t = fd0, wmax = max; t; t = NEXT(t) ) {
3312: b = (NDV)BDY(t); len = LEN(b);
3313: for ( a = BDY(b), i = 0; i < len; i++, NMV_ADV(a) )
3314: wmax = MAX(TD(DL(a)),wmax);
3315: }
3316: homogenize_order(ord,nvar,&ord1);
3317: nd_init_ord(ord1);
3318: nd_setup_parameters(nvar+1,wmax);
3319: for ( t = fd0; t; t = NEXT(t) )
3320: ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos);
3321: }
3322:
1.211 noro 3323: ndv_setup(m,0,fd0,(nd_gbblock||nd_splist||nd_check_splist)?1:0,0);
1.172 noro 3324: if ( nd_gentrace ) {
1.167 noro 3325: MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0);
3326: }
1.209 noro 3327: if ( nd_splist ) {
3328: *rp = compute_splist();
3329: return;
3330: }
3331: if ( nd_check_splist ) {
1.214 noro 3332: if ( f4 ) {
3333: if ( check_splist_f4(m,nd_check_splist) ) *rp = (LIST)ONE;
3334: else *rp = 0;
3335: } else {
3336: if ( check_splist(m,nd_check_splist) ) *rp = (LIST)ONE;
3337: else *rp = 0;
3338: }
1.209 noro 3339: return;
3340: }
1.234 noro 3341: x = f4?nd_f4(m,0,&perm):nd_gb(m,ishomo || homo,0,0,&perm);
1.192 noro 3342: if ( !x ) {
3343: *rp = 0; return;
3344: }
1.184 noro 3345: if ( !ishomo && homo ) {
3346: /* dehomogenization */
3347: for ( t = x; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord);
3348: nd_init_ord(ord);
3349: nd_setup_parameters(nvar,0);
3350: }
1.157 noro 3351: nd_demand = 0;
1.195 noro 3352: if ( nd_module && nd_intersect ) {
3353: for ( j = nd_psn-1, x = 0; j >= 0; j-- )
3354: if ( MPOS(DL(nd_psh[j])) > 1 ) {
3355: MKNODE(xx,(pointer)j,x); x = xx;
3356: }
3357: conv_ilist(nd_demand,0,x,0);
3358: goto FINAL;
3359: }
1.208 noro 3360: if ( nd_gentrace && f4 ) { nzlist = nd_alltracelist; }
1.167 noro 3361: x = ndv_reducebase(x,perm);
1.208 noro 3362: if ( nd_gentrace && !f4 ) { tl1 = nd_alltracelist; nd_alltracelist = 0; }
1.157 noro 3363: x = ndv_reduceall(m,x);
1.194 noro 3364: cbpe = nd_bpe;
1.208 noro 3365: if ( nd_gentrace && !f4 ) {
1.170 noro 3366: tl2 = nd_alltracelist; nd_alltracelist = 0;
3367: ndv_check_membership(m,fd0,obpe,oadv,oepos,x);
1.198 noro 3368: tl3 = nd_alltracelist; nd_alltracelist = 0;
3369: if ( nd_gensyz ) {
3370: nd_gb(m,0,1,1,0);
1.170 noro 3371: tl4 = nd_alltracelist; nd_alltracelist = 0;
3372: } else tl4 = 0;
3373: }
1.194 noro 3374: nd_bpe = cbpe;
3375: nd_setup_parameters(nd_nvar,0);
1.195 noro 3376: FINAL:
1.157 noro 3377: for ( r0 = 0, t = x; t; t = NEXT(t) ) {
3378: NEXTNODE(r0,r);
1.194 noro 3379: if ( nd_module ) BDY(r) = ndvtopl(m,CO,vv,BDY(t),mrank);
1.199 noro 3380: else if ( retdp ) BDY(r) = ndvtodp(m,BDY(t));
3381: else BDY(r) = ndvtop(m,CO,vv,BDY(t));
1.157 noro 3382: }
3383: if ( r0 ) NEXT(r) = 0;
1.208 noro 3384: if ( !m && nd_nalg )
1.157 noro 3385: r0 = postprocess_algcoef(av,alist,r0);
3386: MKLIST(*rp,r0);
1.172 noro 3387: if ( nd_gentrace ) {
1.208 noro 3388: if ( f4 ) {
3389: STOQ(16,bpe);
3390: tr = mknode(4,*rp,(!ishomo&&homo)?ONE:0,BDY(nzlist),bpe); MKLIST(*rp,tr);
3391: } else {
3392: tl1 = reverse_node(tl1); tl2 = reverse_node(tl2);
3393: tl3 = reverse_node(tl3);
3394: /* tl2 = [[i,[[*,j,*,*],...]],...] */
3395: for ( t = tl2; t; t = NEXT(t) ) {
3396: /* s = [i,[*,j,*,*],...] */
3397: s = BDY((LIST)BDY(t));
3398: j = perm[QTOS((Q)ARG0(s))]; STOQ(j,jq); ARG0(s) = (pointer)jq;
3399: for ( s = BDY((LIST)ARG1(s)); s; s = NEXT(s) ) {
3400: j = perm[QTOS((Q)ARG1(BDY((LIST)BDY(s))))]; STOQ(j,jq);
3401: ARG1(BDY((LIST)BDY(s))) = (pointer)jq;
3402: }
3403: }
3404: for ( j = length(x)-1, t = 0; j >= 0; j-- ) {
3405: STOQ(perm[j],jq); MKNODE(s,jq,t); t = s;
1.167 noro 3406: }
1.208 noro 3407: MKLIST(l1,tl1); MKLIST(l2,tl2); MKLIST(l3,t); MKLIST(l4,tl3);
3408: MKLIST(l5,tl4);
3409: STOQ(nd_bpe,bpe);
3410: tr = mknode(8,*rp,(!ishomo&&homo)?ONE:0,l1,l2,l3,l4,l5,bpe); MKLIST(*rp,tr);
3411: }
1.167 noro 3412: }
1.103 noro 3413: #if 0
1.157 noro 3414: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.103 noro 3415: #endif
1.127 noro 3416: }
3417:
3418: void nd_gr_postproc(LIST f,LIST v,int m,struct order_spec *ord,int do_check,LIST *rp)
3419: {
1.157 noro 3420: VL tv,fv,vv,vc,av;
3421: NODE fd,fd0,r,r0,t,x,s,xx,alist;
3422: int e,max,nvar,i;
3423: NDV b;
3424: int ishomo,nalg;
3425: Alg alpha,dp;
3426: P p,zp;
3427: Q dmy;
3428: LIST f1,f2;
3429: Obj obj;
3430: NumberField nf;
3431: struct order_spec *ord1;
1.167 noro 3432: int *perm;
1.157 noro 3433:
1.197 noro 3434: parse_nd_option(current_option);
1.157 noro 3435: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
3436: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
3437: switch ( ord->id ) {
3438: case 1:
3439: if ( ord->nv != nvar )
3440: error("nd_check : invalid order specification");
3441: break;
3442: default:
3443: break;
3444: }
3445: nd_nalg = 0;
3446: av = 0;
3447: if ( !m ) {
3448: get_algtree((Obj)f,&av);
3449: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
3450: nd_ntrans = nvar;
3451: nd_nalg = nalg;
3452: /* #i -> t#i */
3453: if ( nalg ) {
3454: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
3455: ord = ord1;
3456: f = f1;
3457: }
3458: nvar += nalg;
3459: }
3460: nd_init_ord(ord);
1.178 noro 3461: for ( t = BDY(f), max = 1; t; t = NEXT(t) )
1.157 noro 3462: for ( tv = vv; tv; tv = NEXT(tv) ) {
3463: e = getdeg(tv->v,(P)BDY(t));
3464: max = MAX(e,max);
3465: }
3466: nd_setup_parameters(nvar,max);
3467: ishomo = 1;
3468: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
3469: ptozp((P)BDY(t),1,&dmy,&zp);
3470: b = (pointer)ptondv(CO,vv,zp);
3471: if ( ishomo )
3472: ishomo = ishomo && ndv_ishomo(b);
3473: if ( m ) ndv_mod(m,b);
3474: if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; }
3475: }
3476: if ( fd0 ) NEXT(fd) = 0;
3477: ndv_setup(m,0,fd0,0,1);
3478: for ( x = 0, i = 0; i < nd_psn; i++ )
3479: x = update_base(x,i);
3480: if ( do_check ) {
1.168 noro 3481: x = nd_gb(m,ishomo,1,0,&perm);
1.157 noro 3482: if ( !x ) {
3483: *rp = 0;
3484: return;
3485: }
3486: } else {
1.175 noro 3487: #if 0
3488: /* bug ? */
1.157 noro 3489: for ( t = x; t; t = NEXT(t) )
1.159 noro 3490: BDY(t) = (pointer)nd_ps[(long)BDY(t)];
1.175 noro 3491: #else
3492: conv_ilist(0,0,x,&perm);
3493: #endif
1.157 noro 3494: }
1.167 noro 3495: x = ndv_reducebase(x,perm);
1.157 noro 3496: x = ndv_reduceall(m,x);
3497: for ( r0 = 0, t = x; t; t = NEXT(t) ) {
3498: NEXTNODE(r0,r);
3499: BDY(r) = ndvtop(m,CO,vv,BDY(t));
3500: }
3501: if ( r0 ) NEXT(r) = 0;
1.208 noro 3502: if ( !m && nd_nalg )
1.157 noro 3503: r0 = postprocess_algcoef(av,alist,r0);
3504: MKLIST(*rp,r0);
1.20 noro 3505: }
3506:
1.198 noro 3507: NDV recompute_trace(NODE trace,NDV *p,int m);
3508: void nd_gr_recompute_trace(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,LIST *rp);
3509:
3510: NDV recompute_trace(NODE ti,NDV *p,int mod)
3511: {
3512: int c,c1,c2,i;
3513: NM mul,m,tail;
3514: ND d,r,rm;
3515: NODE sj;
3516: NDV red;
3517: Obj mj;
3518: static int afo=0;
3519:
3520: afo++;
1.235 noro 3521: mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
1.198 noro 3522: CM(mul) = 1;
3523: tail = 0;
3524: for ( i = 0, d = r = 0; ti; ti = NEXT(ti), i++ ) {
3525: sj = BDY((LIST)BDY(ti));
3526: if ( ARG0(sj) ) {
3527: red = p[QTOS((Q)ARG1(sj))];
3528: mj = (Obj)ARG2(sj);
3529: if ( OID(mj) != O_DP ) ndl_zero(DL(mul));
3530: else dltondl(nd_nvar,BDY((DP)mj)->dl,DL(mul));
3531: rm = ndv_mul_nm(mod,mul,red);
3532: if ( !r ) r = rm;
3533: else {
3534: for ( m = BDY(r); m && !ndl_equal(m->dl,BDY(rm)->dl); m = NEXT(m), LEN(r)-- ) {
3535: if ( d ) {
3536: NEXT(tail) = m; tail = m; LEN(d)++;
3537: } else {
3538: MKND(nd_nvar,m,1,d); tail = BDY(d);
3539: }
3540: }
3541: if ( !m ) return 0; /* failure */
1.232 noro 3542: else {
1.198 noro 3543: BDY(r) = m;
1.232 noro 3544: if ( mod > 0 || mod == -1 ) {
3545: c1 = invm(HCM(rm),mod); c2 = mod-HCM(r);
3546: DMAR(c1,c2,0,mod,c);
3547: nd_mul_c(mod,rm,c);
3548: } else {
3549: GZ t,u;
3550:
3551: chsgnlf(HCZ(r),&t);
3552: divlf(t,HCZ(rm),&u);
3553: nd_mul_c_lf(rm,u);
3554: }
1.198 noro 3555: r = nd_add(mod,r,rm);
1.232 noro 3556: }
3557: }
3558: }
1.198 noro 3559: }
3560: if ( tail ) NEXT(tail) = 0;
3561: d = nd_add(mod,d,r);
3562: nd_mul_c(mod,d,invm(HCM(d),mod));
3563: return ndtondv(mod,d);
3564: }
3565:
3566: void nd_gr_recompute_trace(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,LIST *rp)
3567: {
3568: VL tv,fv,vv,vc,av;
3569: NODE fd,fd0,r,r0,t,x,s,xx,alist;
3570: int e,max,nvar,i;
3571: NDV b;
3572: int ishomo,nalg;
3573: Alg alpha,dp;
3574: P p,zp;
3575: Q dmy;
3576: LIST f1,f2;
3577: Obj obj;
3578: NumberField nf;
3579: struct order_spec *ord1;
3580: NODE permtrace,intred,ind,perm,trace,ti;
3581: int len,n,j;
3582: NDV *db,*pb;
3583:
3584: parse_nd_option(current_option);
3585: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
3586: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
3587: switch ( ord->id ) {
3588: case 1:
3589: if ( ord->nv != nvar )
3590: error("nd_check : invalid order specification");
3591: break;
3592: default:
3593: break;
3594: }
3595: nd_init_ord(ord);
3596: nd_bpe = QTOS((Q)ARG7(BDY(tlist)));
3597: nd_setup_parameters(nvar,0);
3598:
3599: len = length(BDY(f));
3600: db = (NDV *)MALLOC(len*sizeof(NDV *));
3601: for ( i = 0, t = BDY(f); t; i++, t = NEXT(t) ) {
3602: ptozp((P)BDY(t),1,&dmy,&zp);
3603: b = ptondv(CO,vv,zp);
3604: ndv_mod(m,b);
3605: ndv_mul_c(m,b,invm(HCM(b),m));
3606: db[i] = b;
3607: }
3608:
3609: permtrace = BDY((LIST)ARG2(BDY(tlist)));
3610: intred = BDY((LIST)ARG3(BDY(tlist)));
3611: ind = BDY((LIST)ARG4(BDY(tlist)));
3612: perm = BDY((LIST)ARG0(permtrace));
3613: trace = NEXT(permtrace);
3614:
3615: for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) {
3616: j = QTOS((Q)ARG0(BDY((LIST)BDY(t))));
3617: if ( j > i ) i = j;
3618: }
3619: n = i+1;
3620: pb = (NDV *)MALLOC(n*sizeof(NDV *));
3621: for ( t = perm, i = 0; t; t = NEXT(t), i++ ) {
3622: ti = BDY((LIST)BDY(t));
3623: pb[QTOS((Q)ARG0(ti))] = db[QTOS((Q)ARG1(ti))];
3624: }
3625: for ( t = trace; t; t = NEXT(t) ) {
3626: ti = BDY((LIST)BDY(t));
3627: pb[QTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m);
3628: if ( !pb[QTOS((Q)ARG0(ti))] ) { *rp = 0; return; }
3629: if ( DP_Print ) {
3630: fprintf(asir_out,"."); fflush(asir_out);
3631: }
3632: }
3633: for ( t = intred; t; t = NEXT(t) ) {
3634: ti = BDY((LIST)BDY(t));
3635: pb[QTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m);
3636: if ( !pb[QTOS((Q)ARG0(ti))] ) { *rp = 0; return; }
3637: if ( DP_Print ) {
3638: fprintf(asir_out,"*"); fflush(asir_out);
3639: }
3640: }
3641: for ( r0 = 0, t = ind; t; t = NEXT(t) ) {
3642: NEXTNODE(r0,r);
3643: b = pb[QTOS((Q)BDY(t))];
3644: ndv_mul_c(m,b,invm(HCM(b),m));
3645: #if 0
3646: BDY(r) = ndvtop(m,CO,vv,pb[QTOS((Q)BDY(t))]);
3647: #else
3648: BDY(r) = ndvtodp(m,pb[QTOS((Q)BDY(t))]);
3649: #endif
3650: }
3651: if ( r0 ) NEXT(r) = 0;
3652: MKLIST(*rp,r0);
3653: if ( DP_Print ) fprintf(asir_out,"\n");
3654: }
3655:
1.133 noro 3656: void nd_gr_trace(LIST f,LIST v,int trace,int homo,int f4,struct order_spec *ord,LIST *rp)
1.20 noro 3657: {
1.157 noro 3658: VL tv,fv,vv,vc,av;
3659: NODE fd,fd0,in0,in,r,r0,t,s,cand,alist;
3660: int m,nocheck,nvar,mindex,e,max;
3661: NDV c;
3662: NMV a;
3663: P p,zp;
3664: Q dmy;
3665: EPOS oepos;
1.164 noro 3666: int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg,mrank,trank,ompos;
1.157 noro 3667: Alg alpha,dp;
3668: P poly;
1.158 noro 3669: LIST f1,f2,zpl;
1.157 noro 3670: Obj obj;
3671: NumberField nf;
3672: struct order_spec *ord1;
3673: struct oEGT eg_check,eg0,eg1;
1.168 noro 3674: NODE tr,tl1,tl2,tl3,tl4;
3675: LIST l1,l2,l3,l4,l5;
1.167 noro 3676: int *perm;
1.168 noro 3677: int j,ret;
1.198 noro 3678: Q jq,bpe;
1.157 noro 3679:
1.167 noro 3680: nd_module = 0;
1.235 noro 3681: nd_lf = 0;
1.172 noro 3682: parse_nd_option(current_option);
1.234 noro 3683: if ( nd_lf ) {
3684: if ( f4 )
3685: nd_f4_lf_trace(f,v,trace,homo,ord,rp);
3686: else
3687: error("nd_gr_trace is not implemented yet over a large finite field");
3688: return;
3689: }
1.157 noro 3690: if ( DP_Multiple )
3691: nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1);
3692:
3693: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
3694: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
3695: switch ( ord->id ) {
3696: case 1:
3697: if ( ord->nv != nvar )
3698: error("nd_gr_trace : invalid order specification");
3699: break;
3700: default:
3701: break;
3702: }
3703:
3704: get_algtree((Obj)f,&av);
3705: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
3706: nd_ntrans = nvar;
3707: nd_nalg = nalg;
3708: /* #i -> t#i */
3709: if ( nalg ) {
3710: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
3711: ord = ord1;
3712: f = f1;
3713: }
3714: nvar += nalg;
3715:
3716: nocheck = 0;
3717: mindex = 0;
3718:
3719: if ( Demand ) nd_demand = 1;
3720: else nd_demand = 0;
3721:
3722: /* setup modulus */
3723: if ( trace < 0 ) {
3724: trace = -trace;
3725: nocheck = 1;
3726: }
3727: m = trace > 1 ? trace : get_lprime(mindex);
1.158 noro 3728: nd_init_ord(ord);
3729: mrank = 0;
1.178 noro 3730: for ( t = BDY(f), max = 1; t; t = NEXT(t) )
1.157 noro 3731: for ( tv = vv; tv; tv = NEXT(tv) ) {
1.158 noro 3732: if ( nd_module ) {
3733: s = BDY((LIST)BDY(t));
3734: trank = length(s);
3735: mrank = MAX(mrank,trank);
3736: for ( ; s; s = NEXT(s) ) {
3737: e = getdeg(tv->v,(P)BDY(s));
3738: max = MAX(e,max);
3739: }
3740: } else {
3741: e = getdeg(tv->v,(P)BDY(t));
3742: max = MAX(e,max);
3743: }
1.157 noro 3744: }
3745: nd_setup_parameters(nvar,max);
1.164 noro 3746: obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; ompos = nd_mpos;
1.157 noro 3747: ishomo = 1;
3748: for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
1.167 noro 3749: if ( nd_module ) {
1.172 noro 3750: if ( !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl);
1.167 noro 3751: else zpl = (LIST)BDY(t);
1.158 noro 3752: c = (pointer)pltondv(CO,vv,zpl);
3753: } else {
1.172 noro 3754: if ( !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp);
1.167 noro 3755: else zp = (P)BDY(t);
1.158 noro 3756: c = (pointer)ptondv(CO,vv,zp);
1.167 noro 3757: }
1.157 noro 3758: if ( ishomo )
3759: ishomo = ishomo && ndv_ishomo(c);
3760: if ( c ) {
3761: NEXTNODE(in0,in); BDY(in) = (pointer)c;
3762: NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c);
3763: }
3764: }
3765: if ( in0 ) NEXT(in) = 0;
3766: if ( fd0 ) NEXT(fd) = 0;
3767: if ( !ishomo && homo ) {
3768: for ( t = in0, wmax = max; t; t = NEXT(t) ) {
3769: c = (NDV)BDY(t); len = LEN(c);
3770: for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) )
3771: wmax = MAX(TD(DL(a)),wmax);
3772: }
3773: homogenize_order(ord,nvar,&ord1);
3774: nd_init_ord(ord1);
3775: nd_setup_parameters(nvar+1,wmax);
3776: for ( t = fd0; t; t = NEXT(t) )
1.164 noro 3777: ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos);
1.157 noro 3778: }
1.228 noro 3779: if ( MaxDeg > 0 ) nocheck = 1;
1.157 noro 3780: while ( 1 ) {
1.183 noro 3781: tl1 = tl2 = tl3 = tl4 = 0;
1.157 noro 3782: if ( Demand )
3783: nd_demand = 1;
1.187 noro 3784: ret = ndv_setup(m,1,fd0,nd_gbblock?1:0,0);
1.172 noro 3785: if ( nd_gentrace ) {
1.167 noro 3786: MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0);
3787: }
1.177 noro 3788: if ( ret )
3789: cand = f4?nd_f4_trace(m,&perm):nd_gb_trace(m,ishomo || homo,&perm);
3790: if ( !ret || !cand ) {
1.157 noro 3791: /* failure */
3792: if ( trace > 1 ) { *rp = 0; return; }
3793: else m = get_lprime(++mindex);
3794: continue;
3795: }
3796: if ( !ishomo && homo ) {
3797: /* dehomogenization */
3798: for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord);
3799: nd_init_ord(ord);
3800: nd_setup_parameters(nvar,0);
3801: }
3802: nd_demand = 0;
1.167 noro 3803: cand = ndv_reducebase(cand,perm);
1.172 noro 3804: if ( nd_gentrace ) { tl1 = nd_alltracelist; nd_alltracelist = 0; }
1.157 noro 3805: cand = ndv_reduceall(0,cand);
3806: cbpe = nd_bpe;
1.172 noro 3807: if ( nd_gentrace ) { tl2 = nd_alltracelist; nd_alltracelist = 0; }
1.173 noro 3808: get_eg(&eg0);
1.157 noro 3809: if ( nocheck )
3810: break;
1.170 noro 3811: if ( ret = ndv_check_membership(0,in0,obpe,oadv,oepos,cand) ) {
1.172 noro 3812: if ( nd_gentrace ) {
1.168 noro 3813: tl3 = nd_alltracelist; nd_alltracelist = 0;
3814: } else tl3 = 0;
3815: /* gbcheck : cand is a GB of Id(cand) ? */
1.234 noro 3816: if ( nd_vc || nd_gentrace || nd_gensyz )
3817: ret = nd_gb(0,0,1,nd_gensyz?1:0,0)!=0;
3818: else
3819: ret = nd_f4(0,1,0)!=0;
1.172 noro 3820: if ( nd_gentrace && nd_gensyz ) {
1.168 noro 3821: tl4 = nd_alltracelist; nd_alltracelist = 0;
3822: } else tl4 = 0;
3823: }
3824: if ( ret ) break;
1.157 noro 3825: else if ( trace > 1 ) {
3826: /* failure */
3827: *rp = 0; return;
3828: } else {
3829: /* try the next modulus */
3830: m = get_lprime(++mindex);
3831: /* reset the parameters */
3832: if ( !ishomo && homo ) {
3833: nd_init_ord(ord1);
3834: nd_setup_parameters(nvar+1,wmax);
3835: } else {
3836: nd_init_ord(ord);
3837: nd_setup_parameters(nvar,max);
3838: }
3839: }
3840: }
3841: get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1);
3842: if ( DP_Print )
3843: fprintf(asir_out,"check=%fsec\n",eg_check.exectime+eg_check.gctime);
3844: /* dp->p */
3845: nd_bpe = cbpe;
3846: nd_setup_parameters(nd_nvar,0);
1.158 noro 3847: for ( r = cand; r; r = NEXT(r) ) {
1.167 noro 3848: if ( nd_module ) BDY(r) = ndvtopl(0,CO,vv,BDY(r),mrank);
1.158 noro 3849: else BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r));
3850: }
1.208 noro 3851: if ( nd_nalg )
1.157 noro 3852: cand = postprocess_algcoef(av,alist,cand);
3853: MKLIST(*rp,cand);
1.172 noro 3854: if ( nd_gentrace ) {
1.167 noro 3855: tl1 = reverse_node(tl1); tl2 = reverse_node(tl2);
1.168 noro 3856: tl3 = reverse_node(tl3);
1.167 noro 3857: /* tl2 = [[i,[[*,j,*,*],...]],...] */
3858: for ( t = tl2; t; t = NEXT(t) ) {
3859: /* s = [i,[*,j,*,*],...] */
3860: s = BDY((LIST)BDY(t));
3861: j = perm[QTOS((Q)ARG0(s))]; STOQ(j,jq); ARG0(s) = (pointer)jq;
3862: for ( s = BDY((LIST)ARG1(s)); s; s = NEXT(s) ) {
3863: j = perm[QTOS((Q)ARG1(BDY((LIST)BDY(s))))]; STOQ(j,jq);
3864: ARG1(BDY((LIST)BDY(s))) = (pointer)jq;
3865: }
3866: }
3867: for ( j = length(cand)-1, t = 0; j >= 0; j-- ) {
3868: STOQ(perm[j],jq); MKNODE(s,jq,t); t = s;
3869: }
1.168 noro 3870: MKLIST(l1,tl1); MKLIST(l2,tl2); MKLIST(l3,t); MKLIST(l4,tl3);
3871: MKLIST(l5,tl4);
1.198 noro 3872: STOQ(nd_bpe,bpe);
3873: tr = mknode(8,*rp,(!ishomo&&homo)?ONE:0,l1,l2,l3,l4,l5,bpe); MKLIST(*rp,tr);
1.167 noro 3874: }
1.157 noro 3875: }
1.52 noro 3876:
1.157 noro 3877: /* XXX : module element is not considered */
1.1 noro 3878:
1.61 noro 3879: void dltondl(int n,DL dl,UINT *r)
1.1 noro 3880: {
1.157 noro 3881: UINT *d;
3882: int i,j,l,s,ord_l;
3883: struct order_pair *op;
3884:
3885: d = dl->d;
3886: for ( i = 0; i < nd_wpd; i++ ) r[i] = 0;
3887: if ( nd_blockmask ) {
3888: l = nd_blockmask->n;
3889: op = nd_blockmask->order_pair;
3890: for ( j = 0, s = 0; j < l; j++ ) {
3891: ord_l = op[j].length;
3892: for ( i = 0; i < ord_l; i++, s++ ) PUT_EXP(r,s,d[s]);
3893: }
3894: TD(r) = ndl_weight(r);
3895: ndl_weight_mask(r);
3896: } else {
3897: for ( i = 0; i < n; i++ ) PUT_EXP(r,i,d[i]);
3898: TD(r) = ndl_weight(r);
3899: }
1.1 noro 3900: }
3901:
1.61 noro 3902: DL ndltodl(int n,UINT *ndl)
1.1 noro 3903: {
1.157 noro 3904: DL dl;
3905: int *d;
3906: int i,j,l,s,ord_l;
3907: struct order_pair *op;
3908:
3909: NEWDL(dl,n);
3910: dl->td = TD(ndl);
3911: d = dl->d;
3912: if ( nd_blockmask ) {
3913: l = nd_blockmask->n;
3914: op = nd_blockmask->order_pair;
3915: for ( j = 0, s = 0; j < l; j++ ) {
3916: ord_l = op[j].length;
3917: for ( i = 0; i < ord_l; i++, s++ ) d[s] = GET_EXP(ndl,s);
3918: }
3919: } else {
3920: for ( i = 0; i < n; i++ ) d[i] = GET_EXP(ndl,i);
3921: }
3922: return dl;
1.1 noro 3923: }
3924:
1.167 noro 3925: void nmtodp(int mod,NM m,DP *r)
3926: {
3927: DP dp;
3928: MP mr;
3929:
3930: NEWMP(mr);
3931: mr->dl = ndltodl(nd_nvar,DL(m));
1.238 noro 3932: mr->c = (Obj)ndctop(mod,m->c);
1.167 noro 3933: NEXT(mr) = 0; MKDP(nd_nvar,mr,dp); dp->sugar = mr->dl->td;
3934: *r = dp;
3935: }
3936:
1.61 noro 3937: void ndl_print(UINT *dl)
1.1 noro 3938: {
1.157 noro 3939: int n;
3940: int i,j,l,ord_l,s,s0;
3941: struct order_pair *op;
3942:
3943: n = nd_nvar;
3944: printf("<<");
3945: if ( nd_blockmask ) {
3946: l = nd_blockmask->n;
3947: op = nd_blockmask->order_pair;
3948: for ( j = 0, s = s0 = 0; j < l; j++ ) {
3949: ord_l = op[j].length;
3950: for ( i = 0; i < ord_l; i++, s++ )
3951: printf(s==n-1?"%d":"%d,",GET_EXP(dl,s));
3952: }
3953: } else {
3954: for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,i));
3955: }
3956: printf(">>");
1.236 noro 3957: if ( nd_module && MPOS(dl) )
1.157 noro 3958: printf("*e%d",MPOS(dl));
1.1 noro 3959: }
3960:
3961: void nd_print(ND p)
3962: {
1.157 noro 3963: NM m;
1.1 noro 3964:
1.157 noro 3965: if ( !p )
3966: printf("0\n");
3967: else {
3968: for ( m = BDY(p); m; m = NEXT(m) ) {
3969: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
3970: else printf("+%d*",CM(m));
3971: ndl_print(DL(m));
3972: }
3973: printf("\n");
3974: }
1.1 noro 3975: }
3976:
1.113 noro 3977: void nd_print_q(ND p)
1.16 noro 3978: {
1.157 noro 3979: NM m;
1.16 noro 3980:
1.157 noro 3981: if ( !p )
3982: printf("0\n");
3983: else {
3984: for ( m = BDY(p); m; m = NEXT(m) ) {
3985: printf("+");
3986: printexpr(CO,(Obj)CQ(m));
3987: printf("*");
3988: ndl_print(DL(m));
3989: }
3990: printf("\n");
3991: }
1.16 noro 3992: }
3993:
1.1 noro 3994: void ndp_print(ND_pairs d)
3995: {
1.157 noro 3996: ND_pairs t;
1.1 noro 3997:
1.157 noro 3998: for ( t = d; t; t = NEXT(t) ) printf("%d,%d ",t->i1,t->i2);
3999: printf("\n");
1.1 noro 4000: }
4001:
1.20 noro 4002: void nd_removecont(int mod,ND p)
1.16 noro 4003: {
1.157 noro 4004: int i,n;
4005: Q *w;
4006: Q dvr,t;
4007: NM m;
4008: struct oVECT v;
4009: N q,r;
4010:
4011: if ( mod == -1 ) nd_mul_c(mod,p,_invsf(HCM(p)));
1.232 noro 4012: else if ( mod == -2 ) {
4013: GZ inv;
4014: divlf(ONEGZ,HCZ(p),&inv);
4015: nd_mul_c_lf(p,inv);
4016: } else if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod));
1.157 noro 4017: else {
4018: for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ );
1.235 noro 4019: w = (Q *)MALLOC(n*sizeof(Q));
1.157 noro 4020: v.len = n;
4021: v.body = (pointer *)w;
4022: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
4023: removecont_array((P *)w,n,1);
4024: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
4025: }
1.16 noro 4026: }
4027:
1.21 noro 4028: void nd_removecont2(ND p1,ND p2)
4029: {
1.157 noro 4030: int i,n1,n2,n;
4031: Q *w;
4032: Q dvr,t;
4033: NM m;
4034: struct oVECT v;
4035: N q,r;
4036:
4037: n1 = nd_length(p1);
4038: n2 = nd_length(p2);
4039: n = n1+n2;
1.235 noro 4040: w = (Q *)MALLOC(n*sizeof(Q));
1.157 noro 4041: v.len = n;
4042: v.body = (pointer *)w;
4043: i = 0;
4044: if ( p1 )
4045: for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) w[i] = CQ(m);
4046: if ( p2 )
4047: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
4048: removecont_array((P *)w,n,1);
4049: i = 0;
4050: if ( p1 )
4051: for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) CQ(m) = w[i];
4052: if ( p2 )
4053: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
1.21 noro 4054: }
4055:
1.20 noro 4056: void ndv_removecont(int mod,NDV p)
1.16 noro 4057: {
1.157 noro 4058: int i,len,all_p;
4059: Q *c;
4060: P *w;
4061: Q dvr,t;
4062: P g,cont,tp;
4063: NMV m;
4064:
4065: if ( mod == -1 )
4066: ndv_mul_c(mod,p,_invsf(HCM(p)));
1.232 noro 4067: else if ( mod == -2 ) {
4068: GZ inv;
4069: divlf(ONEGZ,HCZ(p),&inv);
4070: ndv_mul_c_lf(p,inv);
4071: } else if ( mod )
1.157 noro 4072: ndv_mul_c(mod,p,invm(HCM(p),mod));
4073: else {
4074: len = p->len;
1.235 noro 4075: w = (P *)MALLOC(len*sizeof(P));
4076: c = (Q *)MALLOC(len*sizeof(Q));
1.157 noro 4077: for ( m = BDY(p), all_p = 1, i = 0; i < len; NMV_ADV(m), i++ ) {
4078: ptozp(CP(m),1,&c[i],&w[i]);
4079: all_p = all_p && !NUM(w[i]);
4080: }
4081: if ( all_p ) {
4082: qltozl(c,len,&dvr); nd_heu_nezgcdnpz(nd_vc,w,len,1,&g);
4083: mulp(nd_vc,(P)dvr,g,&cont);
4084: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) {
4085: divsp(nd_vc,CP(m),cont,&tp); CP(m) = tp;
4086: }
4087: } else {
4088: sortbynm((Q *)c,len);
4089: qltozl((Q *)c,len,&dvr);
4090: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) {
4091: divsp(nd_vc,CP(m),(P)dvr,&tp); CP(m) = tp;
4092: }
4093: }
4094: }
1.21 noro 4095: }
4096:
1.157 noro 4097: /* koko */
4098:
1.164 noro 4099: void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos,int ompos)
1.61 noro 4100: {
1.157 noro 4101: int len,i,max;
4102: NMV m,mr0,mr,t;
1.61 noro 4103:
1.157 noro 4104: len = p->len;
1.178 noro 4105: for ( m = BDY(p), i = 0, max = 1; i < len; NMV_OADV(m), i++ )
1.157 noro 4106: max = MAX(max,TD(DL(m)));
4107: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
4108: m = (NMV)((char *)mr0+(len-1)*oadv);
4109: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
1.235 noro 4110: t = (NMV)MALLOC(nmv_adv);
1.157 noro 4111: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
1.164 noro 4112: ndl_homogenize(DL(m),DL(t),obpe,oepos,ompos,max);
1.157 noro 4113: CQ(mr) = CQ(m);
4114: ndl_copy(DL(t),DL(mr));
4115: }
4116: NV(p)++;
4117: BDY(p) = mr0;
1.61 noro 4118: }
4119:
1.45 noro 4120: void ndv_dehomogenize(NDV p,struct order_spec *ord)
1.23 noro 4121: {
1.164 noro 4122: int i,j,adj,len,newnvar,newwpd,newadv,newexporigin,newmpos;
1.167 noro 4123: int pos;
1.157 noro 4124: Q *w;
4125: Q dvr,t;
4126: NMV m,r;
4127:
4128: len = p->len;
4129: newnvar = nd_nvar-1;
4130: newexporigin = nd_get_exporigin(ord);
1.167 noro 4131: if ( nd_module ) newmpos = newexporigin-1;
1.157 noro 4132: newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0)+newexporigin;
4133: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ )
4134: ndl_dehomogenize(DL(m));
4135: if ( newwpd != nd_wpd ) {
4136: newadv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(newwpd-1)*sizeof(UINT));
4137: for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NDV_NADV(r), i++ ) {
4138: CQ(r) = CQ(m);
1.167 noro 4139: if ( nd_module ) pos = MPOS(DL(m));
1.157 noro 4140: for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j];
4141: adj = nd_exporigin-newexporigin;
4142: for ( ; j < newwpd; j++ ) DL(r)[j] = DL(m)[j+adj];
1.167 noro 4143: if ( nd_module ) {
4144: DL(r)[newmpos] = pos;
4145: }
1.157 noro 4146: }
4147: }
4148: NV(p)--;
1.23 noro 4149: }
4150:
1.150 noro 4151: void nd_heu_nezgcdnpz(VL vl,P *pl,int m,int full,P *pr)
4152: {
1.157 noro 4153: int i;
4154: P *tpl,*tpl1;
4155: NODE l;
4156: P h,gcd,t;
4157:
1.235 noro 4158: tpl = (P *)MALLOC(m*sizeof(P));
4159: tpl1 = (P *)MALLOC(m*sizeof(P));
1.157 noro 4160: bcopy(pl,tpl,m*sizeof(P));
4161: gcd = (P)ONE;
4162: for ( l = nd_hcf; l; l = NEXT(l) ) {
4163: h = (P)BDY(l);
4164: while ( 1 ) {
4165: for ( i = 0; i < m; i++ )
4166: if ( !divtpz(vl,tpl[i],h,&tpl1[i]) )
4167: break;
4168: if ( i == m ) {
4169: bcopy(tpl1,tpl,m*sizeof(P));
4170: mulp(vl,gcd,h,&t); gcd = t;
4171: } else
4172: break;
4173: }
4174: }
4175: if ( DP_Print > 2 ){fprintf(asir_out,"[%d]",nmonop(gcd)); fflush(asir_out);}
4176: if ( full ) {
4177: heu_nezgcdnpz(vl,tpl,m,&t);
4178: mulp(vl,gcd,t,pr);
4179: } else
4180: *pr = gcd;
1.150 noro 4181: }
4182:
4183: void removecont_array(P *p,int n,int full)
1.146 noro 4184: {
1.157 noro 4185: int all_p,all_q,i;
4186: Q *c;
4187: P *w;
4188: P t,s;
4189:
4190: for ( all_q = 1, i = 0; i < n; i++ )
4191: all_q = all_q && NUM(p[i]);
4192: if ( all_q ) {
4193: removecont_array_q((Q *)p,n);
4194: } else {
1.235 noro 4195: c = (Q *)MALLOC(n*sizeof(Q));
4196: w = (P *)MALLOC(n*sizeof(P));
1.157 noro 4197: for ( i = 0; i < n; i++ ) {
4198: ptozp(p[i],1,&c[i],&w[i]);
4199: }
4200: removecont_array_q(c,n);
4201: nd_heu_nezgcdnpz(nd_vc,w,n,full,&t);
4202: for ( i = 0; i < n; i++ ) {
4203: divsp(nd_vc,w[i],t,&s); mulp(nd_vc,s,(P)c[i],&p[i]);
4204: }
4205: }
1.146 noro 4206: }
4207:
4208: void removecont_array_q(Q *c,int n)
1.21 noro 4209: {
1.157 noro 4210: struct oVECT v;
4211: Q d0,d1,a,u,u1,gcd;
4212: int i,j;
4213: N qn,rn,gn;
4214: Q *q,*r;
4215:
1.235 noro 4216: q = (Q *)MALLOC(n*sizeof(Q));
4217: r = (Q *)MALLOC(n*sizeof(Q));
1.157 noro 4218: v.id = O_VECT; v.len = n; v.body = (pointer *)c;
4219: igcdv_estimate(&v,&d0);
4220: for ( i = 0; i < n; i++ ) {
4221: divn(NM(c[i]),NM(d0),&qn,&rn);
4222: NTOQ(qn,SGN(c[i])*SGN(d0),q[i]);
4223: NTOQ(rn,SGN(c[i]),r[i]);
4224: }
4225: for ( i = 0; i < n; i++ ) if ( r[i] ) break;
4226: if ( i < n ) {
4227: v.id = O_VECT; v.len = n; v.body = (pointer *)r;
4228: igcdv(&v,&d1);
4229: gcdn(NM(d0),NM(d1),&gn); NTOQ(gn,1,gcd);
4230: divsn(NM(d0),gn,&qn); NTOQ(qn,1,a);
4231: for ( i = 0; i < n; i++ ) {
4232: mulq(a,q[i],&u);
4233: if ( r[i] ) {
4234: divsn(NM(r[i]),gn,&qn); NTOQ(qn,SGN(r[i]),u1);
4235: addq(u,u1,&q[i]);
4236: } else
4237: q[i] = u;
4238: }
4239: }
4240: for ( i = 0; i < n; i++ ) c[i] = q[i];
1.16 noro 4241: }
4242:
1.19 noro 4243: void nd_mul_c(int mod,ND p,int mul)
1.1 noro 4244: {
1.157 noro 4245: NM m;
4246: int c,c1;
1.1 noro 4247:
1.157 noro 4248: if ( !p ) return;
4249: if ( mul == 1 ) return;
4250: if ( mod == -1 )
4251: for ( m = BDY(p); m; m = NEXT(m) )
4252: CM(m) = _mulsf(CM(m),mul);
4253: else
4254: for ( m = BDY(p); m; m = NEXT(m) ) {
4255: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
4256: }
1.1 noro 4257: }
4258:
1.232 noro 4259: void nd_mul_c_lf(ND p,GZ mul)
4260: {
4261: NM m;
4262: GZ c;
4263:
4264: if ( !p ) return;
4265: if ( UNIGZ(mul) ) return;
4266: for ( m = BDY(p); m; m = NEXT(m) ) {
4267: mullf(CZ(m),mul,&c); CZ(m) = c;
4268: }
4269: }
4270:
1.146 noro 4271: void nd_mul_c_q(ND p,P mul)
1.16 noro 4272: {
1.157 noro 4273: NM m;
4274: P c;
1.16 noro 4275:
1.157 noro 4276: if ( !p ) return;
4277: if ( UNIQ(mul) ) return;
4278: for ( m = BDY(p); m; m = NEXT(m) ) {
4279: mulp(nd_vc,CP(m),mul,&c); CP(m) = c;
4280: }
1.16 noro 4281: }
4282:
1.61 noro 4283: void nd_mul_c_p(VL vl,ND p,P mul)
4284: {
1.157 noro 4285: NM m;
4286: P c;
1.61 noro 4287:
1.157 noro 4288: if ( !p ) return;
4289: for ( m = BDY(p); m; m = NEXT(m) ) {
4290: mulp(vl,CP(m),mul,&c); CP(m) = c;
4291: }
1.61 noro 4292: }
4293:
1.1 noro 4294: void nd_free(ND p)
4295: {
1.157 noro 4296: NM t,s;
1.1 noro 4297:
1.157 noro 4298: if ( !p ) return;
4299: t = BDY(p);
4300: while ( t ) {
4301: s = NEXT(t);
4302: FREENM(t);
4303: t = s;
4304: }
4305: FREEND(p);
1.1 noro 4306: }
4307:
1.23 noro 4308: void ndv_free(NDV p)
4309: {
1.200 noro 4310: GCFREE(BDY(p));
1.23 noro 4311: }
4312:
1.61 noro 4313: void nd_append_red(UINT *d,int i)
1.1 noro 4314: {
1.157 noro 4315: RHist m,m0;
4316: int h;
1.1 noro 4317:
1.157 noro 4318: NEWRHist(m);
4319: h = ndl_hash_value(d);
4320: m->index = i;
4321: ndl_copy(d,DL(m));
4322: NEXT(m) = nd_red[h];
4323: nd_red[h] = m;
1.1 noro 4324: }
4325:
1.61 noro 4326: UINT *ndv_compute_bound(NDV p)
1.1 noro 4327: {
1.157 noro 4328: UINT *d1,*d2,*t;
4329: UINT u;
4330: int i,j,k,l,len,ind;
4331: NMV m;
4332:
4333: if ( !p )
4334: return 0;
1.235 noro 4335: d1 = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
4336: d2 = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
1.157 noro 4337: len = LEN(p);
4338: m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m);
4339: for ( i = 1; i < len; i++, NMV_ADV(m) ) {
1.159 noro 4340: ndl_max(DL(m),d1,d2);
1.157 noro 4341: t = d1; d1 = d2; d2 = t;
4342: }
4343: l = nd_nvar+31;
4344: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
4345: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
4346: u = d1[i];
4347: k = (nd_epw-1)*nd_bpe;
4348: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
4349: t[ind] = (u>>k)&nd_mask0;
4350: }
4351: for ( ; ind < l; ind++ ) t[ind] = 0;
4352: return t;
1.1 noro 4353: }
4354:
1.99 noro 4355: UINT *nd_compute_bound(ND p)
4356: {
1.157 noro 4357: UINT *d1,*d2,*t;
4358: UINT u;
4359: int i,j,k,l,len,ind;
4360: NM m;
4361:
4362: if ( !p )
4363: return 0;
1.235 noro 4364: d1 = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
4365: d2 = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
1.157 noro 4366: len = LEN(p);
4367: m = BDY(p); ndl_copy(DL(m),d1); m = NEXT(m);
4368: for ( m = NEXT(m); m; m = NEXT(m) ) {
4369: ndl_lcm(DL(m),d1,d2);
4370: t = d1; d1 = d2; d2 = t;
4371: }
4372: l = nd_nvar+31;
4373: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
4374: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
4375: u = d1[i];
4376: k = (nd_epw-1)*nd_bpe;
4377: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
4378: t[ind] = (u>>k)&nd_mask0;
4379: }
4380: for ( ; ind < l; ind++ ) t[ind] = 0;
4381: return t;
1.99 noro 4382: }
4383:
1.157 noro 4384: /* if nd_module == 1 then d[nd_exporigin-1] indicates the position */
4385: /* of a term. In this case we need additional 1 word. */
4386:
1.48 noro 4387: int nd_get_exporigin(struct order_spec *ord)
4388: {
1.157 noro 4389: switch ( ord->id ) {
4390: case 0: case 2: case 256: case 258:
4391: return 1+nd_module;
4392: case 1: case 257:
4393: /* block order */
4394: /* poly ring d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */
4395: /* module d[0]:weight d[1]:w0,...,d[nd_exporigin-2]:w(n-1) */
4396: return ord->ord.block.length+1+nd_module;
4397: case 3: case 259:
1.236 noro 4398: #if 0
1.157 noro 4399: error("nd_get_exporigin : composite order is not supported yet.");
1.236 noro 4400: #else
4401: return 1+nd_module;
4402: #endif
1.157 noro 4403: }
1.48 noro 4404: }
4405:
1.61 noro 4406: void nd_setup_parameters(int nvar,int max) {
1.157 noro 4407: int i,j,n,elen,ord_o,ord_l,l,s,wpd;
4408: struct order_pair *op;
1.48 noro 4409:
1.157 noro 4410: nd_nvar = nvar;
4411: if ( max ) {
4412: /* XXX */
4413: if ( do_weyl ) nd_bpe = 32;
4414: else if ( max < 2 ) nd_bpe = 1;
4415: else if ( max < 4 ) nd_bpe = 2;
4416: else if ( max < 8 ) nd_bpe = 3;
4417: else if ( max < 16 ) nd_bpe = 4;
4418: else if ( max < 32 ) nd_bpe = 5;
4419: else if ( max < 64 ) nd_bpe = 6;
4420: else if ( max < 256 ) nd_bpe = 8;
4421: else if ( max < 1024 ) nd_bpe = 10;
4422: else if ( max < 65536 ) nd_bpe = 16;
4423: else nd_bpe = 32;
4424: }
1.203 noro 4425: if ( !do_weyl && weight_check && (current_dl_weight_vector || nd_matrix) ) {
1.201 noro 4426: UINT t;
1.203 noro 4427: int st;
4428: int *v;
4429: /* t = max(weights) */
4430: t = 0;
4431: if ( current_dl_weight_vector )
4432: for ( i = 0, t = 0; i < nd_nvar; i++ ) {
4433: if ( (st=current_dl_weight_vector[i]) < 0 ) st = -st;
4434: if ( t < st ) t = st;
4435: }
4436: if ( nd_matrix )
4437: for ( i = 0; i < nd_matrix_len; i++ )
4438: for ( j = 0, v = nd_matrix[i]; j < nd_nvar; j++ ) {
4439: if ( (st=v[j]) < 0 ) st = -st;
4440: if ( t < st ) t = st;
4441: }
4442: /* i = bitsize of t */
4443: for ( i = 0; t; t >>=1, i++ );
4444: /* i += bitsize of nd_nvar */
4445: for ( t = nd_nvar; t; t >>=1, i++);
4446: /* nd_bpe+i = bitsize of max(weights)*max(exp)*nd_nvar */
4447: if ( (nd_bpe+i) >= 31 )
4448: error("nd_setup_parameters : too large weight");
4449: }
1.157 noro 4450: nd_epw = (sizeof(UINT)*8)/nd_bpe;
4451: elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);
4452: nd_exporigin = nd_get_exporigin(nd_ord);
4453: wpd = nd_exporigin+elen;
4454: if ( nd_module )
4455: nd_mpos = nd_exporigin-1;
4456: else
4457: nd_mpos = -1;
4458: if ( wpd != nd_wpd ) {
4459: nd_free_private_storage();
4460: nd_wpd = wpd;
4461: }
4462: if ( nd_bpe < 32 ) {
4463: nd_mask0 = (1<<nd_bpe)-1;
4464: } else {
4465: nd_mask0 = 0xffffffff;
4466: }
4467: bzero(nd_mask,sizeof(nd_mask));
4468: nd_mask1 = 0;
4469: for ( i = 0; i < nd_epw; i++ ) {
4470: nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe));
4471: nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe);
4472: }
4473: nmv_adv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(nd_wpd-1)*sizeof(UINT));
4474: nd_epos = nd_create_epos(nd_ord);
4475: nd_blockmask = nd_create_blockmask(nd_ord);
4476: nd_work_vector = (int *)REALLOC(nd_work_vector,nd_nvar*sizeof(int));
1.1 noro 4477: }
4478:
1.103 noro 4479: ND_pairs nd_reconstruct(int trace,ND_pairs d)
1.1 noro 4480: {
1.157 noro 4481: int i,obpe,oadv,h;
4482: static NM prev_nm_free_list;
4483: static ND_pairs prev_ndp_free_list;
4484: RHist mr0,mr;
4485: RHist r;
4486: RHist *old_red;
4487: ND_pairs s0,s,t;
4488: EPOS oepos;
4489:
4490: obpe = nd_bpe;
4491: oadv = nmv_adv;
4492: oepos = nd_epos;
4493: if ( obpe < 2 ) nd_bpe = 2;
4494: else if ( obpe < 3 ) nd_bpe = 3;
4495: else if ( obpe < 4 ) nd_bpe = 4;
4496: else if ( obpe < 5 ) nd_bpe = 5;
4497: else if ( obpe < 6 ) nd_bpe = 6;
4498: else if ( obpe < 8 ) nd_bpe = 8;
4499: else if ( obpe < 10 ) nd_bpe = 10;
4500: else if ( obpe < 16 ) nd_bpe = 16;
4501: else if ( obpe < 32 ) nd_bpe = 32;
4502: else error("nd_reconstruct : exponent too large");
4503:
4504: nd_setup_parameters(nd_nvar,0);
4505: prev_nm_free_list = _nm_free_list;
4506: prev_ndp_free_list = _ndp_free_list;
4507: _nm_free_list = 0;
4508: _ndp_free_list = 0;
1.215 noro 4509: for ( i = nd_psn-1; i >= 0; i-- ) {
4510: ndv_realloc(nd_ps[i],obpe,oadv,oepos);
4511: ndv_realloc(nd_ps_sym[i],obpe,oadv,oepos);
4512: ndv_realloc(nd_ps_gz[i],obpe,oadv,oepos);
4513: }
1.157 noro 4514: if ( trace )
1.215 noro 4515: for ( i = nd_psn-1; i >= 0; i-- ) {
1.157 noro 4516: ndv_realloc(nd_ps_trace[i],obpe,oadv,oepos);
1.215 noro 4517: ndv_realloc(nd_ps_trace_sym[i],obpe,oadv,oepos);
4518: }
1.157 noro 4519: s0 = 0;
4520: for ( t = d; t; t = NEXT(t) ) {
4521: NEXTND_pairs(s0,s);
4522: s->i1 = t->i1;
4523: s->i2 = t->i2;
4524: SG(s) = SG(t);
4525: ndl_reconstruct(LCM(t),LCM(s),obpe,oepos);
4526: }
4527:
1.235 noro 4528: old_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist));
1.157 noro 4529: for ( i = 0; i < REDTAB_LEN; i++ ) {
4530: old_red[i] = nd_red[i];
4531: nd_red[i] = 0;
4532: }
4533: for ( i = 0; i < REDTAB_LEN; i++ )
4534: for ( r = old_red[i]; r; r = NEXT(r) ) {
4535: NEWRHist(mr);
4536: mr->index = r->index;
4537: SG(mr) = SG(r);
4538: ndl_reconstruct(DL(r),DL(mr),obpe,oepos);
4539: h = ndl_hash_value(DL(mr));
4540: NEXT(mr) = nd_red[h];
4541: nd_red[h] = mr;
4542: }
4543: for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0;
4544: old_red = 0;
4545: for ( i = 0; i < nd_psn; i++ ) {
4546: NEWRHist(r); SG(r) = SG(nd_psh[i]);
4547: ndl_reconstruct(DL(nd_psh[i]),DL(r),obpe,oepos);
4548: nd_psh[i] = r;
4549: }
4550: if ( s0 ) NEXT(s) = 0;
4551: prev_nm_free_list = 0;
4552: prev_ndp_free_list = 0;
1.71 noro 4553: #if 0
1.157 noro 4554: GC_gcollect();
1.71 noro 4555: #endif
1.157 noro 4556: return s0;
1.1 noro 4557: }
4558:
1.61 noro 4559: void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos)
1.1 noro 4560: {
1.157 noro 4561: int n,i,ei,oepw,omask0,j,s,ord_l,l;
4562: struct order_pair *op;
1.1 noro 4563:
1.157 noro 4564: n = nd_nvar;
4565: oepw = (sizeof(UINT)*8)/obpe;
4566: omask0 = (1<<obpe)-1;
4567: TD(r) = TD(d);
4568: for ( i = nd_exporigin; i < nd_wpd; i++ ) r[i] = 0;
4569: if ( nd_blockmask ) {
4570: l = nd_blockmask->n;
4571: op = nd_blockmask->order_pair;
4572: for ( i = 1; i < nd_exporigin; i++ )
4573: r[i] = d[i];
4574: for ( j = 0, s = 0; j < l; j++ ) {
4575: ord_l = op[j].length;
4576: for ( i = 0; i < ord_l; i++, s++ ) {
4577: ei = GET_EXP_OLD(d,s);
4578: PUT_EXP(r,s,ei);
4579: }
4580: }
4581: } else {
4582: for ( i = 0; i < n; i++ ) {
4583: ei = GET_EXP_OLD(d,i);
4584: PUT_EXP(r,i,ei);
4585: }
4586: }
4587: if ( nd_module ) MPOS(r) = MPOS(d);
1.1 noro 4588: }
1.3 noro 4589:
1.6 noro 4590: ND nd_copy(ND p)
4591: {
1.157 noro 4592: NM m,mr,mr0;
4593: int c,n;
4594: ND r;
4595:
4596: if ( !p )
4597: return 0;
4598: else {
4599: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
4600: NEXTNM(mr0,mr);
4601: CM(mr) = CM(m);
4602: ndl_copy(DL(m),DL(mr));
4603: }
4604: NEXT(mr) = 0;
4605: MKND(NV(p),mr0,LEN(p),r);
4606: SG(r) = SG(p);
4607: return r;
4608: }
1.6 noro 4609: }
4610:
1.53 noro 4611: int nd_sp(int mod,int trace,ND_pairs p,ND *rp)
1.11 noro 4612: {
1.157 noro 4613: NM m1,m2;
4614: NDV p1,p2;
4615: ND t1,t2;
4616: UINT *lcm;
4617: P gp,tp;
1.167 noro 4618: Q g,t,iq;
1.157 noro 4619: int td;
1.167 noro 4620: LIST hist;
4621: NODE node;
4622: DP d;
1.157 noro 4623:
4624: if ( !mod && nd_demand ) {
4625: p1 = ndv_load(p->i1); p2 = ndv_load(p->i2);
4626: } else {
4627: if ( trace ) {
4628: p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2];
4629: } else {
4630: p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2];
4631: }
4632: }
4633: lcm = LCM(p);
4634: NEWNM(m1); ndl_sub(lcm,HDL(p1),DL(m1));
4635: if ( ndl_check_bound2(p->i1,DL(m1)) ) {
4636: FREENM(m1); return 0;
4637: }
4638: NEWNM(m2); ndl_sub(lcm,HDL(p2),DL(m2));
4639: if ( ndl_check_bound2(p->i2,DL(m2)) ) {
4640: FREENM(m1); FREENM(m2); return 0;
4641: }
4642:
4643: if ( mod == -1 ) {
4644: CM(m1) = HCM(p2); CM(m2) = _chsgnsf(HCM(p1));
1.232 noro 4645: } else if ( mod > 0 ) {
1.157 noro 4646: CM(m1) = HCM(p2); CM(m2) = mod-HCM(p1);
1.232 noro 4647: } else if ( mod == -2 ) {
4648: CZ(m1) = HCZ(p2); chsgnlf(HCZ(p1),&CZ(m2));
1.157 noro 4649: } else if ( nd_vc ) {
4650: ezgcdpz(nd_vc,HCP(p1),HCP(p2),&gp);
4651: divsp(nd_vc,HCP(p2),gp,&CP(m1));
4652: divsp(nd_vc,HCP(p1),gp,&tp); chsgnp(tp,&CP(m2));
4653: } else {
4654: igcd_cofactor(HCQ(p1),HCQ(p2),&g,&t,&CQ(m1)); chsgnq(t,&CQ(m2));
4655: }
4656: t1 = ndv_mul_nm(mod,m1,p1); t2 = ndv_mul_nm(mod,m2,p2);
4657: *rp = nd_add(mod,t1,t2);
1.172 noro 4658: if ( nd_gentrace ) {
1.167 noro 4659: /* nd_tracelist is initialized */
4660: STOQ(p->i1,iq); nmtodp(mod,m1,&d); node = mknode(4,ONE,iq,d,ONE);
4661: MKLIST(hist,node); MKNODE(nd_tracelist,hist,0);
4662: STOQ(p->i2,iq); nmtodp(mod,m2,&d); node = mknode(4,ONE,iq,d,ONE);
4663: MKLIST(hist,node); MKNODE(node,hist,nd_tracelist);
4664: nd_tracelist = node;
4665: }
1.157 noro 4666: FREENM(m1); FREENM(m2);
4667: return 1;
1.11 noro 4668: }
4669:
1.19 noro 4670: void ndv_mul_c(int mod,NDV p,int mul)
1.11 noro 4671: {
1.157 noro 4672: NMV m;
4673: int c,c1,len,i;
1.11 noro 4674:
1.157 noro 4675: if ( !p ) return;
4676: len = LEN(p);
4677: if ( mod == -1 )
4678: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) )
4679: CM(m) = _mulsf(CM(m),mul);
4680: else
4681: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
4682: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
4683: }
1.11 noro 4684: }
4685:
1.232 noro 4686: void ndv_mul_c_lf(NDV p,GZ mul)
4687: {
4688: NMV m;
4689: GZ c;
4690: int len,i;
4691:
4692: if ( !p ) return;
4693: len = LEN(p);
4694: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
4695: mullf(CZ(m),mul,&c); CZ(m) = c;
4696: }
4697: }
4698:
1.113 noro 4699: void ndv_mul_c_q(NDV p,Q mul)
1.16 noro 4700: {
1.157 noro 4701: NMV m;
4702: Q c;
4703: int len,i;
4704:
4705: if ( !p ) return;
4706: len = LEN(p);
4707: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
4708: mulq(CQ(m),mul,&c); CQ(m) = c;
4709: }
1.16 noro 4710: }
4711:
1.55 noro 4712: ND weyl_ndv_mul_nm(int mod,NM m0,NDV p) {
1.157 noro 4713: int n2,i,j,l,n,tlen;
4714: UINT *d0;
4715: NM *tab,*psum;
4716: ND s,r;
4717: NM t;
4718: NMV m1;
4719:
4720: if ( !p ) return 0;
4721: n = NV(p); n2 = n>>1;
4722: d0 = DL(m0);
4723: l = LEN(p);
4724: for ( i = 0, tlen = 1; i < n2; i++ ) tlen *= (GET_EXP(d0,n2+i)+1);
1.235 noro 4725: tab = (NM *)MALLOC(tlen*sizeof(NM));
4726: psum = (NM *)MALLOC(tlen*sizeof(NM));
1.157 noro 4727: for ( i = 0; i < tlen; i++ ) psum[i] = 0;
4728: m1 = (NMV)(((char *)BDY(p))+nmv_adv*(l-1));
4729: for ( i = l-1; i >= 0; i--, NMV_PREV(m1) ) {
4730: /* m0(NM) * m1(NMV) => tab(NM) */
4731: weyl_mul_nm_nmv(n,mod,m0,m1,tab,tlen);
4732: for ( j = 0; j < tlen; j++ ) {
4733: if ( tab[j] ) {
4734: NEXT(tab[j]) = psum[j]; psum[j] = tab[j];
4735: }
4736: }
4737: }
4738: for ( i = tlen-1, r = 0; i >= 0; i-- )
4739: if ( psum[i] ) {
4740: for ( j = 0, t = psum[i]; t; t = NEXT(t), j++ );
4741: MKND(n,psum[i],j,s);
4742: r = nd_add(mod,r,s);
4743: }
4744: if ( r ) SG(r) = SG(p)+TD(d0);
4745: return r;
1.55 noro 4746: }
4747:
1.56 noro 4748: /* product of monomials */
4749: /* XXX block order is not handled correctly */
4750:
1.55 noro 4751: void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen)
4752: {
1.157 noro 4753: int i,n2,j,s,curlen,homo,h,a,b,k,l,u,min;
4754: UINT *d0,*d1,*d,*dt,*ctab;
4755: Q *ctab_q;
4756: Q q,q1;
4757: UINT c0,c1,c;
4758: NM *p;
4759: NM m,t;
4760: int mpos;
4761:
4762: for ( i = 0; i < tlen; i++ ) tab[i] = 0;
4763: if ( !m0 || !m1 ) return;
4764: d0 = DL(m0); d1 = DL(m1); n2 = n>>1;
1.166 noro 4765: if ( nd_module )
4766: if ( MPOS(d0) ) error("weyl_mul_nm_nmv : invalid operation");
4767:
1.157 noro 4768: NEWNM(m); d = DL(m);
4769: if ( mod ) {
4770: c0 = CM(m0); c1 = CM(m1); DMAR(c0,c1,0,mod,c); CM(m) = c;
1.179 noro 4771: } else if ( nd_vc )
4772: mulp(nd_vc,CP(m0),CP(m1),&CP(m));
4773: else
1.157 noro 4774: mulq(CQ(m0),CQ(m1),&CQ(m));
4775: for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;
4776: homo = n&1 ? 1 : 0;
4777: if ( homo ) {
4778: /* offset of h-degree */
4779: h = GET_EXP(d0,n-1)+GET_EXP(d1,n-1);
4780: PUT_EXP(DL(m),n-1,h);
4781: TD(DL(m)) = h;
4782: if ( nd_blockmask ) ndl_weight_mask(DL(m));
4783: }
4784: tab[0] = m;
4785: NEWNM(m); d = DL(m);
4786: for ( i = 0, curlen = 1; i < n2; i++ ) {
4787: a = GET_EXP(d0,i); b = GET_EXP(d1,n2+i);
4788: k = GET_EXP(d0,n2+i); l = GET_EXP(d1,i);
4789: /* xi^a*(Di^k*xi^l)*Di^b */
4790: a += l; b += k;
4791: s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);
4792: if ( !k || !l ) {
4793: for ( j = 0; j < curlen; j++ )
4794: if ( t = tab[j] ) {
4795: dt = DL(t);
4796: PUT_EXP(dt,i,a); PUT_EXP(dt,n2+i,b); TD(dt) += s;
4797: if ( nd_blockmask ) ndl_weight_mask(dt);
4798: }
4799: curlen *= k+1;
4800: continue;
4801: }
4802: min = MIN(k,l);
4803: if ( mod ) {
1.235 noro 4804: ctab = (UINT *)MALLOC((min+1)*sizeof(UINT));
1.157 noro 4805: mkwcm(k,l,mod,ctab);
4806: } else {
1.235 noro 4807: ctab_q = (Q *)MALLOC((min+1)*sizeof(Q));
1.157 noro 4808: mkwc(k,l,ctab_q);
4809: }
4810: for ( j = min; j >= 0; j-- ) {
4811: for ( u = 0; u < nd_wpd; u++ ) d[u] = 0;
4812: PUT_EXP(d,i,a-j); PUT_EXP(d,n2+i,b-j);
4813: h = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i);
4814: if ( homo ) {
4815: TD(d) = s;
4816: PUT_EXP(d,n-1,s-h);
4817: } else TD(d) = h;
4818: if ( nd_blockmask ) ndl_weight_mask(d);
4819: if ( mod ) c = ctab[j];
4820: else q = ctab_q[j];
4821: p = tab+curlen*j;
4822: if ( j == 0 ) {
4823: for ( u = 0; u < curlen; u++, p++ ) {
4824: if ( tab[u] ) {
4825: ndl_addto(DL(tab[u]),d);
4826: if ( mod ) {
4827: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(tab[u]) = c1;
1.180 noro 4828: } else if ( nd_vc )
4829: mulp(nd_vc,CP(tab[u]),(P)q,&CP(tab[u]));
4830: else {
1.157 noro 4831: mulq(CQ(tab[u]),q,&q1); CQ(tab[u]) = q1;
4832: }
4833: }
4834: }
4835: } else {
4836: for ( u = 0; u < curlen; u++, p++ ) {
4837: if ( tab[u] ) {
4838: NEWNM(t);
4839: ndl_add(DL(tab[u]),d,DL(t));
4840: if ( mod ) {
4841: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(t) = c1;
1.181 noro 4842: } else if ( nd_vc )
1.180 noro 4843: mulp(nd_vc,CP(tab[u]),(P)q,&CP(t));
4844: else
1.157 noro 4845: mulq(CQ(tab[u]),q,&CQ(t));
4846: *p = t;
4847: }
4848: }
4849: }
4850: }
4851: curlen *= k+1;
4852: }
4853: FREENM(m);
1.167 noro 4854: if ( nd_module ) {
1.166 noro 4855: mpos = MPOS(d1);
1.167 noro 4856: for ( i = 0; i < tlen; i++ )
4857: if ( tab[i] ) {
4858: d = DL(tab[i]);
4859: MPOS(d) = mpos;
4860: TD(d) = ndl_weight(d);
4861: }
4862: }
1.55 noro 4863: }
4864:
1.63 noro 4865: ND ndv_mul_nm_symbolic(NM m0,NDV p)
4866: {
1.157 noro 4867: NM mr,mr0;
4868: NMV m;
4869: UINT *d,*dt,*dm;
4870: int c,n,td,i,c1,c2,len;
4871: Q q;
4872: ND r;
4873:
4874: if ( !p ) return 0;
4875: else {
4876: n = NV(p); m = BDY(p);
4877: d = DL(m0);
4878: len = LEN(p);
4879: mr0 = 0;
4880: td = TD(d);
4881: c = CM(m0);
4882: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4883: NEXTNM(mr0,mr);
4884: CM(mr) = 1;
4885: ndl_add(DL(m),d,DL(mr));
4886: }
4887: NEXT(mr) = 0;
4888: MKND(NV(p),mr0,len,r);
4889: SG(r) = SG(p) + TD(d);
4890: return r;
4891: }
1.63 noro 4892: }
4893:
1.55 noro 4894: ND ndv_mul_nm(int mod,NM m0,NDV p)
1.9 noro 4895: {
1.157 noro 4896: NM mr,mr0;
4897: NMV m;
4898: UINT *d,*dt,*dm;
4899: int c,n,td,i,c1,c2,len;
4900: P q;
4901: ND r;
4902:
4903: if ( !p ) return 0;
4904: else if ( do_weyl )
1.232 noro 4905: if ( mod < 0 )
1.157 noro 4906: error("ndv_mul_nm : not implemented (weyl)");
4907: else
4908: return weyl_ndv_mul_nm(mod,m0,p);
4909: else {
4910: n = NV(p); m = BDY(p);
4911: d = DL(m0);
4912: len = LEN(p);
4913: mr0 = 0;
4914: td = TD(d);
4915: if ( mod == -1 ) {
4916: c = CM(m0);
4917: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4918: NEXTNM(mr0,mr);
4919: CM(mr) = _mulsf(CM(m),c);
4920: ndl_add(DL(m),d,DL(mr));
4921: }
1.232 noro 4922: } else if ( mod == -2 ) {
4923: GZ cl;
4924: cl = CZ(m0);
4925: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4926: NEXTNM(mr0,mr);
4927: mullf(CZ(m),cl,&CZ(mr));
4928: ndl_add(DL(m),d,DL(mr));
4929: }
1.157 noro 4930: } else if ( mod ) {
4931: c = CM(m0);
4932: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4933: NEXTNM(mr0,mr);
4934: c1 = CM(m);
4935: DMAR(c1,c,0,mod,c2);
4936: CM(mr) = c2;
4937: ndl_add(DL(m),d,DL(mr));
4938: }
4939: } else {
4940: q = CP(m0);
4941: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4942: NEXTNM(mr0,mr);
4943: mulp(nd_vc,CP(m),q,&CP(mr));
4944: ndl_add(DL(m),d,DL(mr));
4945: }
4946: }
4947: NEXT(mr) = 0;
4948: MKND(NV(p),mr0,len,r);
4949: SG(r) = SG(p) + TD(d);
4950: return r;
4951: }
1.4 noro 4952: }
4953:
1.104 noro 4954: ND nd_quo(int mod,PGeoBucket bucket,NDV d)
1.99 noro 4955: {
1.157 noro 4956: NM mq0,mq;
4957: NMV tm;
4958: Q q;
4959: int i,nv,sg,c,c1,c2,hindex;
4960: ND p,t,r;
4961: N tnm;
4962:
4963: if ( bucket->m < 0 ) return 0;
4964: else {
4965: nv = NV(d);
4966: mq0 = 0;
1.235 noro 4967: tm = (NMV)MALLOC(nmv_adv);
1.157 noro 4968: while ( 1 ) {
1.232 noro 4969: if ( mod > 0 || mod == -1 )
4970: hindex = head_pbucket(mod,bucket);
4971: else if ( mod == -2 )
4972: hindex = head_pbucket_lf(bucket);
4973: else
4974: hindex = head_pbucket_q(bucket);
1.157 noro 4975: if ( hindex < 0 ) break;
4976: p = bucket->body[hindex];
4977: NEXTNM(mq0,mq);
4978: ndl_sub(HDL(p),HDL(d),DL(mq));
4979: ndl_copy(DL(mq),DL(tm));
4980: if ( mod ) {
4981: c1 = invm(HCM(d),mod); c2 = HCM(p);
4982: DMAR(c1,c2,0,mod,c); CM(mq) = c;
4983: CM(tm) = mod-c;
4984: } else {
4985: divsn(NM(HCQ(p)),NM(HCQ(d)),&tnm);
4986: NTOQ(tnm,SGN(HCQ(p))*SGN(HCQ(d)),CQ(mq));
4987: chsgnq(CQ(mq),&CQ(tm));
4988: }
4989: t = ndv_mul_nmv_trunc(mod,tm,d,HDL(d));
4990: bucket->body[hindex] = nd_remove_head(p);
4991: t = nd_remove_head(t);
4992: add_pbucket(mod,bucket,t);
4993: }
4994: if ( !mq0 )
4995: r = 0;
4996: else {
4997: NEXT(mq) = 0;
4998: for ( i = 0, mq = mq0; mq; mq = NEXT(mq), i++ );
4999: MKND(nv,mq0,i,r);
5000: /* XXX */
5001: SG(r) = HTD(r);
5002: }
5003: return r;
5004: }
1.99 noro 5005: }
5006:
1.43 noro 5007: void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos)
1.11 noro 5008: {
1.157 noro 5009: NMV m,mr,mr0,t;
5010: int len,i,k;
1.11 noro 5011:
1.157 noro 5012: if ( !p ) return;
5013: m = BDY(p); len = LEN(p);
5014: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
5015: m = (NMV)((char *)mr0+(len-1)*oadv);
5016: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
1.235 noro 5017: t = (NMV)MALLOC(nmv_adv);
1.157 noro 5018: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
5019: CQ(t) = CQ(m);
5020: for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0;
5021: ndl_reconstruct(DL(m),DL(t),obpe,oepos);
5022: CQ(mr) = CQ(t);
5023: ndl_copy(DL(t),DL(mr));
5024: }
5025: BDY(p) = mr0;
1.61 noro 5026: }
5027:
5028: NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos)
5029: {
1.157 noro 5030: NMV m,mr,mr0;
5031: int len,i;
5032: NDV r;
5033:
5034: if ( !p ) return 0;
5035: m = BDY(p); len = LEN(p);
5036: mr0 = mr = (NMV)MALLOC(len*nmv_adv);
5037: for ( i = 0; i < len; i++, NMV_OADV(m), NMV_ADV(mr) ) {
5038: ndl_zero(DL(mr));
5039: ndl_reconstruct(DL(m),DL(mr),obpe,oepos);
5040: CQ(mr) = CQ(m);
5041: }
5042: MKNDV(NV(p),mr0,len,r);
5043: SG(r) = SG(p);
5044: return r;
1.11 noro 5045: }
5046:
1.61 noro 5047: /* duplicate p */
5048:
5049: NDV ndv_dup(int mod,NDV p)
1.3 noro 5050: {
1.157 noro 5051: NDV d;
5052: NMV t,m,m0;
5053: int i,len;
5054:
5055: if ( !p ) return 0;
5056: len = LEN(p);
1.232 noro 5057: m0 = m = (NMV)((mod>0 || mod==-1)?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv));
1.157 noro 5058: for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) {
5059: ndl_copy(DL(t),DL(m));
5060: CQ(m) = CQ(t);
5061: }
5062: MKNDV(NV(p),m0,len,d);
5063: SG(d) = SG(p);
5064: return d;
1.23 noro 5065: }
5066:
1.215 noro 5067: NDV ndvtondvgz(NDV p)
5068: {
5069: NDV r;
5070: int len,i;
5071: NMV t;
5072:
5073: r = ndv_dup(0,p);
5074: len = LEN(p);
5075: for ( t = BDY(r), i = 0; i < len; i++, NMV_ADV(t) ) CZ(t) = ztogz(CQ(t));
5076: return r;
5077: }
5078:
5079: NDV ndvgztondv(NDV p)
5080: {
5081: NDV r;
5082: int len,i;
5083: NMV t;
5084:
5085: r = ndv_dup(0,p);
5086: len = LEN(p);
5087: for ( t = BDY(r), i = 0; i < len; i++, NMV_ADV(t) ) CQ(t) = gztoz(CZ(t));
5088: return r;
5089: }
5090:
5091: NDV ndv_symbolic(int mod,NDV p)
5092: {
5093: NDV d;
5094: NMV t,m,m0;
5095: int i,len;
5096:
5097: if ( !p ) return 0;
5098: len = LEN(p);
1.232 noro 5099: m0 = m = (NMV)((mod>0||mod==-1)?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv));
1.215 noro 5100: for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) {
5101: ndl_copy(DL(t),DL(m));
5102: CQ(m) = ONE;
5103: }
5104: MKNDV(NV(p),m0,len,d);
5105: SG(d) = SG(p);
5106: return d;
5107: }
5108:
1.63 noro 5109: ND nd_dup(ND p)
5110: {
1.157 noro 5111: ND d;
5112: NM t,m,m0;
1.63 noro 5113:
1.157 noro 5114: if ( !p ) return 0;
5115: for ( m0 = 0, t = BDY(p); t; t = NEXT(t) ) {
5116: NEXTNM(m0,m);
5117: ndl_copy(DL(t),DL(m));
5118: CQ(m) = CQ(t);
5119: }
5120: if ( m0 ) NEXT(m) = 0;
5121: MKND(NV(p),m0,LEN(p),d);
5122: SG(d) = SG(p);
5123: return d;
1.63 noro 5124: }
5125:
1.215 noro 5126: ND ndtondgz(ND p)
5127: {
5128: ND r;
5129: NM t;
5130:
5131: r = nd_dup(p);
5132: for ( t = BDY(r); t; t = NEXT(t) ) CZ(t) = ztogz(CQ(t));
5133: return r;
5134: }
5135:
5136:
5137: ND ndgztond(ND p)
5138: {
5139: ND r;
5140: NM t;
5141:
5142: r = nd_dup(p);
5143: for ( t = BDY(r); t; t = NEXT(t) ) CQ(t) = gztoz(CZ(t));
5144: return r;
5145: }
5146:
5147:
1.61 noro 5148: /* XXX if p->len == 0 then it represents 0 */
5149:
5150: void ndv_mod(int mod,NDV p)
5151: {
1.157 noro 5152: NMV t,d;
5153: int r,s,u;
5154: int i,len,dlen;
5155: P cp;
5156: Q c;
5157: Obj gfs;
5158:
5159: if ( !p ) return;
5160: len = LEN(p);
5161: dlen = 0;
5162: if ( mod == -1 )
5163: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
5164: simp_ff((Obj)CP(t),&gfs);
1.235 noro 5165: if ( gfs ) {
5166: r = FTOIF(CONT((GFS)gfs));
5167: CM(d) = r;
5168: ndl_copy(DL(t),DL(d));
5169: NMV_ADV(d);
5170: dlen++;
5171: }
1.157 noro 5172: }
1.232 noro 5173: else if ( mod == -2 )
5174: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
1.235 noro 5175: simp_ff((Obj)CP(t),&gfs);
5176: if ( gfs ) {
5177: lmtolf(gfs,&CZ(d));
5178: ndl_copy(DL(t),DL(d));
5179: NMV_ADV(d);
5180: dlen++;
5181: }
1.232 noro 5182: }
1.157 noro 5183: else
5184: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
5185: if ( nd_vc ) {
5186: nd_subst_vector(nd_vc,CP(t),nd_subst,&cp);
5187: c = (Q)cp;
5188: } else
5189: c = CQ(t);
5190: r = rem(NM(c),mod);
5191: if ( r ) {
5192: if ( SGN(c) < 0 )
5193: r = mod-r;
5194: if ( DN(c) ) {
5195: s = rem(DN(c),mod);
5196: if ( !s )
5197: error("ndv_mod : division by 0");
5198: s = invm(s,mod);
5199: DMAR(r,s,0,mod,u); r = u;
5200: }
5201: CM(d) = r;
5202: ndl_copy(DL(t),DL(d));
5203: NMV_ADV(d);
5204: dlen++;
5205: }
5206: }
5207: LEN(p) = dlen;
1.61 noro 5208: }
5209:
5210: NDV ptondv(VL vl,VL dvl,P p)
5211: {
1.157 noro 5212: ND nd;
5213:
5214: nd = ptond(vl,dvl,p);
5215: return ndtondv(0,nd);
5216: }
1.61 noro 5217:
1.157 noro 5218: void pltozpl(LIST l,Q *cont,LIST *pp)
5219: {
5220: NODE nd,nd1;
5221: int n;
5222: P *pl;
5223: Q *cl;
5224: int i;
5225: P dmy;
5226: Q dvr;
5227: LIST r;
5228:
5229: nd = BDY(l); n = length(nd);
1.235 noro 5230: pl = (P *)MALLOC(n*sizeof(P));
5231: cl = (Q *)MALLOC(n*sizeof(P));
1.157 noro 5232: for ( i = 0; i < n; i++, nd = NEXT(nd) )
5233: ptozp((P)BDY(nd),1,&cl[i],&dmy);
5234: qltozl(cl,n,&dvr);
5235: nd = BDY(l);
5236: for ( i = 0; i < n; i++, nd = NEXT(nd) ) {
5237: divsp(CO,(P)BDY(nd),(P)dvr,&pl[i]);
5238: }
5239: nd = 0;
5240: for ( i = n-1; i >= 0; i-- ) {
5241: MKNODE(nd1,pl[i],nd); nd = nd1;
5242: }
5243: MKLIST(r,nd);
5244: *pp = r;
5245: }
5246:
5247: /* (a1,a2,...,an) -> a1*e(1)+...+an*e(n) */
5248:
5249: NDV pltondv(VL vl,VL dvl,LIST p)
5250: {
5251: int i;
5252: NODE t;
5253: ND r,ri;
5254: NM m;
5255:
5256: if ( !nd_module ) error("pltond : module order must be set");
5257: r = 0;
5258: for ( i = 1, t = BDY(p); t; t = NEXT(t), i++ ) {
5259: ri = ptond(vl,dvl,(P)BDY(t));
1.163 noro 5260: if ( ri )
5261: for ( m = BDY(ri); m; m = NEXT(m) ) {
1.167 noro 5262: MPOS(DL(m)) = i;
5263: TD(DL(m)) = ndl_weight(DL(m));
1.163 noro 5264: if ( nd_blockmask ) ndl_weight_mask(DL(m));
5265: }
1.157 noro 5266: r = nd_add(0,r,ri);
5267: }
5268: return ndtondv(0,r);
1.61 noro 5269: }
5270:
5271: ND ptond(VL vl,VL dvl,P p)
1.23 noro 5272: {
1.157 noro 5273: int n,i,j,k,e;
5274: VL tvl;
5275: V v;
5276: DCP dc;
5277: DCP *w;
5278: ND r,s,t,u;
5279: P x;
5280: int c;
5281: UINT *d;
5282: NM m,m0;
5283:
5284: if ( !p )
5285: return 0;
5286: else if ( NUM(p) ) {
5287: NEWNM(m);
5288: ndl_zero(DL(m));
5289: CQ(m) = (Q)p;
5290: NEXT(m) = 0;
5291: MKND(nd_nvar,m,1,r);
5292: SG(r) = 0;
5293: return r;
5294: } else {
5295: for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ );
1.235 noro 5296: w = (DCP *)MALLOC(k*sizeof(DCP));
1.157 noro 5297: for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ ) w[j] = dc;
5298: for ( i = 0, tvl = dvl, v = VR(p);
5299: tvl && tvl->v != v; tvl = NEXT(tvl), i++ );
5300: if ( !tvl ) {
5301: for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) {
5302: t = ptond(vl,dvl,COEF(w[j]));
5303: pwrp(vl,x,DEG(w[j]),&p);
5304: nd_mul_c_p(CO,t,p); s = nd_add(0,s,t);
5305: }
5306: return s;
5307: } else {
5308: NEWNM(m0); d = DL(m0);
5309: for ( j = k-1, s = 0; j >= 0; j-- ) {
5310: ndl_zero(d); e = QTOS(DEG(w[j])); PUT_EXP(d,i,e);
5311: TD(d) = MUL_WEIGHT(e,i);
5312: if ( nd_blockmask) ndl_weight_mask(d);
5313: if ( nd_module ) MPOS(d) = 0;
5314: t = ptond(vl,dvl,COEF(w[j]));
5315: for ( m = BDY(t); m; m = NEXT(m) )
5316: ndl_addto(DL(m),d);
5317: SG(t) += TD(d);
5318: s = nd_add(0,s,t);
5319: }
5320: FREENM(m0);
5321: return s;
5322: }
5323: }
1.61 noro 5324: }
5325:
5326: P ndvtop(int mod,VL vl,VL dvl,NDV p)
5327: {
1.157 noro 5328: VL tvl;
5329: int len,n,j,i,e;
5330: NMV m;
5331: Q q;
5332: P c;
5333: UINT *d;
5334: P s,r,u,t,w;
5335: GFS gfs;
5336:
5337: if ( !p ) return 0;
5338: else {
5339: len = LEN(p);
5340: n = NV(p);
5341: m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1));
5342: for ( j = len-1, s = 0; j >= 0; j--, NMV_PREV(m) ) {
5343: if ( mod == -1 ) {
1.232 noro 5344: e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs;
5345: } else if ( mod == -2 ) {
1.238 noro 5346: c = (P)gztoz(CZ(m));
1.232 noro 5347: } else if ( mod > 0 ) {
1.157 noro 5348: STOQ(CM(m),q); c = (P)q;
5349: } else
5350: c = CP(m);
5351: d = DL(m);
5352: for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) {
5353: MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q);
5354: pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w;
5355: }
5356: addp(vl,s,t,&u); s = u;
5357: }
5358: return s;
5359: }
5360: }
5361:
5362: LIST ndvtopl(int mod,VL vl,VL dvl,NDV p,int rank)
5363: {
5364: VL tvl;
5365: int len,n,j,i,e;
5366: NMV m;
5367: Q q;
5368: P c;
5369: UINT *d;
5370: P s,r,u,t,w;
5371: GFS gfs;
5372: P *a;
5373: LIST l;
5374: NODE nd,nd1;
5375:
5376: if ( !p ) return 0;
5377: else {
1.235 noro 5378: a = (P *)MALLOC((rank+1)*sizeof(P));
1.157 noro 5379: for ( i = 0; i <= rank; i++ ) a[i] = 0;
5380: len = LEN(p);
5381: n = NV(p);
5382: m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1));
5383: for ( j = len-1; j >= 0; j--, NMV_PREV(m) ) {
5384: if ( mod == -1 ) {
5385: e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs;
5386: } else if ( mod ) {
5387: STOQ(CM(m),q); c = (P)q;
5388: } else
5389: c = CP(m);
5390: d = DL(m);
5391: for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) {
5392: MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q);
5393: pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w;
5394: }
5395: addp(vl,a[MPOS(d)],t,&u); a[MPOS(d)] = u;
5396: }
5397: nd = 0;
5398: for ( i = rank; i > 0; i-- ) {
5399: MKNODE(nd1,a[i],nd); nd = nd1;
5400: }
5401: MKLIST(l,nd);
5402: return l;
5403: }
1.3 noro 5404: }
5405:
1.61 noro 5406: NDV ndtondv(int mod,ND p)
1.11 noro 5407: {
1.157 noro 5408: NDV d;
5409: NMV m,m0;
5410: NM t;
5411: int i,len;
5412:
5413: if ( !p ) return 0;
5414: len = LEN(p);
1.232 noro 5415: if ( mod > 0 || mod == -1 )
1.200 noro 5416: m0 = m = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(len*nmv_adv);
1.157 noro 5417: else
5418: m0 = m = MALLOC(len*nmv_adv);
1.103 noro 5419: #if 0
1.157 noro 5420: ndv_alloc += nmv_adv*len;
1.103 noro 5421: #endif
1.157 noro 5422: for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) {
5423: ndl_copy(DL(t),DL(m));
5424: CQ(m) = CQ(t);
5425: }
5426: MKNDV(NV(p),m0,len,d);
5427: SG(d) = SG(p);
5428: return d;
1.11 noro 5429: }
5430:
1.61 noro 5431: ND ndvtond(int mod,NDV p)
1.11 noro 5432: {
1.157 noro 5433: ND d;
5434: NM m,m0;
5435: NMV t;
5436: int i,len;
5437:
5438: if ( !p ) return 0;
5439: m0 = 0;
5440: len = p->len;
5441: for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) {
5442: NEXTNM(m0,m);
5443: ndl_copy(DL(t),DL(m));
5444: CQ(m) = CQ(t);
5445: }
5446: NEXT(m) = 0;
5447: MKND(NV(p),m0,len,d);
5448: SG(d) = SG(p);
5449: return d;
1.11 noro 5450: }
5451:
1.198 noro 5452: DP ndvtodp(int mod,NDV p)
5453: {
5454: MP m,m0;
5455: DP d;
5456: NMV t;
5457: int i,len;
5458:
5459: if ( !p ) return 0;
5460: m0 = 0;
5461: len = p->len;
5462: for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) {
5463: NEXTMP(m0,m);
5464: m->dl = ndltodl(nd_nvar,DL(t));
1.238 noro 5465: m->c = (Obj)ndctop(mod,t->c);
1.198 noro 5466: }
5467: NEXT(m) = 0;
5468: MKDP(nd_nvar,m0,d);
5469: SG(d) = SG(p);
5470: return d;
5471: }
5472:
1.204 noro 5473: DP ndtodp(int mod,ND p)
5474: {
5475: MP m,m0;
5476: DP d;
5477: NM t;
5478: int i,len;
5479:
5480: if ( !p ) return 0;
5481: m0 = 0;
5482: len = p->len;
5483: for ( t = BDY(p); t; t = NEXT(t) ) {
5484: NEXTMP(m0,m);
5485: m->dl = ndltodl(nd_nvar,DL(t));
1.238 noro 5486: m->c = (Obj)ndctop(mod,t->c);
1.204 noro 5487: }
5488: NEXT(m) = 0;
5489: MKDP(nd_nvar,m0,d);
5490: SG(d) = SG(p);
5491: return d;
5492: }
5493:
1.3 noro 5494: void ndv_print(NDV p)
5495: {
1.157 noro 5496: NMV m;
5497: int i,len;
1.3 noro 5498:
1.157 noro 5499: if ( !p ) printf("0\n");
5500: else {
5501: len = LEN(p);
5502: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
5503: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
5504: else printf("+%d*",CM(m));
5505: ndl_print(DL(m));
5506: }
5507: printf("\n");
5508: }
1.16 noro 5509: }
5510:
1.113 noro 5511: void ndv_print_q(NDV p)
1.16 noro 5512: {
1.157 noro 5513: NMV m;
5514: int i,len;
1.16 noro 5515:
1.157 noro 5516: if ( !p ) printf("0\n");
5517: else {
5518: len = LEN(p);
5519: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
5520: printf("+");
5521: printexpr(CO,(Obj)CQ(m));
5522: printf("*");
5523: ndl_print(DL(m));
5524: }
5525: printf("\n");
5526: }
1.25 noro 5527: }
5528:
1.167 noro 5529: NODE ndv_reducebase(NODE x,int *perm)
1.27 noro 5530: {
1.157 noro 5531: int len,i,j;
1.167 noro 5532: NDVI w;
1.157 noro 5533: NODE t,t0;
5534:
5535: len = length(x);
1.235 noro 5536: w = (NDVI)MALLOC(len*sizeof(struct oNDVI));
1.167 noro 5537: for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) {
5538: w[i].p = BDY(t); w[i].i = perm[i];
5539: }
1.157 noro 5540: for ( i = 0; i < len; i++ ) {
5541: for ( j = 0; j < i; j++ ) {
1.167 noro 5542: if ( w[i].p && w[j].p )
5543: if ( ndl_reducible(HDL(w[i].p),HDL(w[j].p)) ) w[i].p = 0;
5544: else if ( ndl_reducible(HDL(w[j].p),HDL(w[i].p)) ) w[j].p = 0;
1.157 noro 5545: }
5546: }
1.167 noro 5547: for ( i = j = 0, t0 = 0; i < len; i++ ) {
5548: if ( w[i].p ) {
5549: NEXTNODE(t0,t); BDY(t) = (pointer)w[i].p;
5550: perm[j++] = w[i].i;
5551: }
1.157 noro 5552: }
5553: NEXT(t) = 0; x = t0;
5554: return x;
1.11 noro 5555: }
1.32 noro 5556:
1.43 noro 5557: /* XXX incomplete */
5558:
1.32 noro 5559: void nd_init_ord(struct order_spec *ord)
5560: {
1.224 noro 5561: nd_module = (ord->id >= 256);
5562: if ( nd_module ) {
5563: nd_dcomp = -1;
5564: nd_ispot = ord->ispot;
5565: nd_pot_nelim = ord->pot_nelim;
5566: nd_poly_weight_len = ord->nv;
5567: nd_poly_weight = ord->top_weight;
5568: nd_module_rank = ord->module_rank;
5569: nd_module_weight = ord->module_top_weight;
5570: }
1.203 noro 5571: nd_matrix = 0;
5572: nd_matrix_len = 0;
1.157 noro 5573: switch ( ord->id ) {
5574: case 0:
5575: switch ( ord->ord.simple ) {
5576: case 0:
5577: nd_dcomp = 1;
5578: nd_isrlex = 1;
5579: break;
5580: case 1:
5581: nd_dcomp = 1;
5582: nd_isrlex = 0;
5583: break;
5584: case 2:
5585: nd_dcomp = 0;
5586: nd_isrlex = 0;
5587: ndl_compare_function = ndl_lex_compare;
5588: break;
5589: case 11:
5590: /* XXX */
5591: nd_dcomp = 0;
5592: nd_isrlex = 1;
5593: ndl_compare_function = ndl_ww_lex_compare;
5594: break;
5595: default:
5596: error("nd_gr : unsupported order");
5597: }
5598: break;
5599: case 1:
5600: /* block order */
5601: /* XXX */
5602: nd_dcomp = -1;
5603: nd_isrlex = 0;
5604: ndl_compare_function = ndl_block_compare;
5605: break;
5606: case 2:
5607: /* matrix order */
5608: /* XXX */
5609: nd_dcomp = -1;
5610: nd_isrlex = 0;
5611: nd_matrix_len = ord->ord.matrix.row;
5612: nd_matrix = ord->ord.matrix.matrix;
5613: ndl_compare_function = ndl_matrix_compare;
5614: break;
5615: case 3:
5616: /* composite order */
5617: nd_dcomp = -1;
5618: nd_isrlex = 0;
5619: nd_worb_len = ord->ord.composite.length;
5620: nd_worb = ord->ord.composite.w_or_b;
5621: ndl_compare_function = ndl_composite_compare;
5622: break;
5623:
5624: /* module order */
5625: case 256:
5626: switch ( ord->ord.simple ) {
5627: case 0:
1.167 noro 5628: nd_isrlex = 1;
1.157 noro 5629: ndl_compare_function = ndl_module_grlex_compare;
5630: break;
5631: case 1:
1.167 noro 5632: nd_isrlex = 0;
1.157 noro 5633: ndl_compare_function = ndl_module_glex_compare;
5634: break;
5635: case 2:
1.167 noro 5636: nd_isrlex = 0;
1.157 noro 5637: ndl_compare_function = ndl_module_lex_compare;
5638: break;
5639: default:
5640: error("nd_gr : unsupported order");
5641: }
5642: break;
5643: case 257:
5644: /* block order */
1.174 noro 5645: nd_isrlex = 0;
1.157 noro 5646: ndl_compare_function = ndl_module_block_compare;
5647: break;
5648: case 258:
5649: /* matrix order */
1.174 noro 5650: nd_isrlex = 0;
1.157 noro 5651: nd_matrix_len = ord->ord.matrix.row;
5652: nd_matrix = ord->ord.matrix.matrix;
5653: ndl_compare_function = ndl_module_matrix_compare;
5654: break;
5655: case 259:
5656: /* composite order */
1.174 noro 5657: nd_isrlex = 0;
1.157 noro 5658: nd_worb_len = ord->ord.composite.length;
5659: nd_worb = ord->ord.composite.w_or_b;
5660: ndl_compare_function = ndl_module_composite_compare;
5661: break;
5662: }
5663: nd_ord = ord;
1.32 noro 5664: }
5665:
1.43 noro 5666: BlockMask nd_create_blockmask(struct order_spec *ord)
5667: {
1.157 noro 5668: int n,i,j,s,l;
5669: UINT *t;
5670: BlockMask bm;
5671:
5672: /* we only create mask table for block order */
1.164 noro 5673: if ( ord->id != 1 && ord->id != 257 )
1.157 noro 5674: return 0;
5675: n = ord->ord.block.length;
5676: bm = (BlockMask)MALLOC(sizeof(struct oBlockMask));
5677: bm->n = n;
5678: bm->order_pair = ord->ord.block.order_pair;
5679: bm->mask = (UINT **)MALLOC(n*sizeof(UINT *));
5680: for ( i = 0, s = 0; i < n; i++ ) {
5681: bm->mask[i] = t = (UINT *)MALLOC_ATOMIC(nd_wpd*sizeof(UINT));
5682: for ( j = 0; j < nd_wpd; j++ ) t[j] = 0;
5683: l = bm->order_pair[i].length;
5684: for ( j = 0; j < l; j++, s++ ) PUT_EXP(t,s,nd_mask0);
5685: }
5686: return bm;
1.57 noro 5687: }
5688:
5689: EPOS nd_create_epos(struct order_spec *ord)
5690: {
1.157 noro 5691: int i,j,l,s,ord_l,ord_o;
5692: EPOS epos;
5693: struct order_pair *op;
5694:
5695: epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS));
5696: switch ( ord->id ) {
1.164 noro 5697: case 0: case 256:
1.157 noro 5698: if ( nd_isrlex ) {
5699: for ( i = 0; i < nd_nvar; i++ ) {
5700: epos[i].i = nd_exporigin + (nd_nvar-1-i)/nd_epw;
5701: epos[i].s = (nd_epw-((nd_nvar-1-i)%nd_epw)-1)*nd_bpe;
5702: }
5703: } else {
5704: for ( i = 0; i < nd_nvar; i++ ) {
5705: epos[i].i = nd_exporigin + i/nd_epw;
5706: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
5707: }
5708: }
5709: break;
1.164 noro 5710: case 1: case 257:
1.157 noro 5711: /* block order */
5712: l = ord->ord.block.length;
5713: op = ord->ord.block.order_pair;
5714: for ( j = 0, s = 0; j < l; j++ ) {
5715: ord_o = op[j].order;
5716: ord_l = op[j].length;
5717: if ( !ord_o )
5718: for ( i = 0; i < ord_l; i++ ) {
5719: epos[s+i].i = nd_exporigin + (s+ord_l-i-1)/nd_epw;
5720: epos[s+i].s = (nd_epw-((s+ord_l-i-1)%nd_epw)-1)*nd_bpe;
5721: }
5722: else
5723: for ( i = 0; i < ord_l; i++ ) {
5724: epos[s+i].i = nd_exporigin + (s+i)/nd_epw;
5725: epos[s+i].s = (nd_epw-((s+i)%nd_epw)-1)*nd_bpe;
5726: }
5727: s += ord_l;
5728: }
5729: break;
5730: case 2:
5731: /* matrix order */
5732: case 3:
5733: /* composite order */
1.167 noro 5734: default:
1.157 noro 5735: for ( i = 0; i < nd_nvar; i++ ) {
5736: epos[i].i = nd_exporigin + i/nd_epw;
5737: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
5738: }
5739: break;
5740: }
5741: return epos;
1.43 noro 5742: }
1.59 noro 5743:
5744: /* external interface */
5745:
1.191 noro 5746: void nd_nf_p(Obj f,LIST g,LIST v,int m,struct order_spec *ord,Obj *rp)
1.59 noro 5747: {
1.157 noro 5748: NODE t,in0,in;
1.191 noro 5749: ND ndf,nf;
5750: NDV ndvf;
1.157 noro 5751: VL vv,tv;
1.191 noro 5752: int stat,nvar,max,mrank;
1.157 noro 5753: union oNDC dn;
5754: Q cont;
5755: P pp;
1.191 noro 5756: LIST ppl;
1.157 noro 5757:
5758: if ( !f ) {
5759: *rp = 0;
5760: return;
5761: }
5762: pltovl(v,&vv);
5763: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
5764:
1.191 noro 5765: /* max=65536 implies nd_bpe=32 */
5766: max = 65536;
1.157 noro 5767:
1.191 noro 5768: nd_module = 0;
5769: /* nd_module will be set if ord is a module ordering */
1.157 noro 5770: nd_init_ord(ord);
5771: nd_setup_parameters(nvar,max);
1.191 noro 5772: if ( nd_module && OID(f) != O_LIST )
5773: error("nd_nf_p : the first argument must be a list");
5774: if ( nd_module ) mrank = length(BDY((LIST)f));
1.157 noro 5775: /* conversion to ndv */
5776: for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) {
5777: NEXTNODE(in0,in);
1.191 noro 5778: if ( nd_module ) {
5779: if ( !BDY(t) || OID(BDY(t)) != O_LIST
5780: || length(BDY((LIST)BDY(t))) != mrank )
5781: error("nd_nf_p : inconsistent basis element");
5782: if ( !m ) pltozpl((LIST)BDY(t),&cont,&ppl);
5783: else ppl = (LIST)BDY(t);
5784: BDY(in) = (pointer)pltondv(CO,vv,ppl);
5785: } else {
5786: if ( !m ) ptozp((P)BDY(t),1,&cont,&pp);
5787: else pp = (P)BDY(t);
5788: BDY(in) = (pointer)ptondv(CO,vv,pp);
5789: }
1.157 noro 5790: if ( m ) ndv_mod(m,(NDV)BDY(in));
5791: }
1.191 noro 5792: if ( in0 ) NEXT(in) = 0;
5793:
5794: if ( nd_module ) ndvf = pltondv(CO,vv,(LIST)f);
5795: else ndvf = ptondv(CO,vv,(P)f);
5796: if ( m ) ndv_mod(m,ndvf);
5797: ndf = (pointer)ndvtond(m,ndvf);
1.157 noro 5798:
5799: /* dont sort, dont removecont */
5800: ndv_setup(m,0,in0,1,1);
5801: nd_scale=2;
1.191 noro 5802: stat = nd_nf(m,0,ndf,nd_ps,1,0,&nf);
5803: if ( !stat )
5804: error("nd_nf_p : exponent too large");
5805: if ( nd_module ) *rp = (Obj)ndvtopl(m,CO,vv,ndtondv(m,nf),mrank);
5806: else *rp = (Obj)ndvtop(m,CO,vv,ndtondv(m,nf));
1.63 noro 5807: }
5808:
5809: int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r)
5810: {
1.157 noro 5811: NM m;
5812: UINT *t,*s;
5813: int i;
5814:
5815: for ( i = 0; i < n; i++ ) r[i] = 0;
5816: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
5817: t = DL(m);
5818: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5819: r[i] = CM(m);
5820: }
5821: for ( i = 0; !r[i]; i++ );
5822: return i;
1.63 noro 5823: }
5824:
1.239 noro 5825: #if defined(__GNUC__)
1.240 ! noro 5826:
! 5827: #define MOD128(a,c,m) ((a)=(((c)!=0||((a)>=(m)))?(((((U128)(c))<<64)+(a))%(m)):(a)))
! 5828:
! 5829: int nd_to_vect64(int mod,UINT *s0,int n,ND d,U64 *r)
1.239 noro 5830: {
5831: NM m;
5832: UINT *t,*s;
5833: int i;
5834:
5835: for ( i = 0; i < n; i++ ) r[i] = 0;
5836: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
5837: t = DL(m);
5838: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
1.240 ! noro 5839: r[i] = (U64)CM(m);
1.239 noro 5840: }
5841: for ( i = 0; !r[i]; i++ );
5842: return i;
5843: }
5844: #endif
5845:
1.113 noro 5846: int nd_to_vect_q(UINT *s0,int n,ND d,Q *r)
1.74 noro 5847: {
1.157 noro 5848: NM m;
5849: UINT *t,*s;
5850: int i;
5851:
5852: for ( i = 0; i < n; i++ ) r[i] = 0;
5853: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
5854: t = DL(m);
5855: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5856: r[i] = CQ(m);
5857: }
5858: for ( i = 0; !r[i]; i++ );
5859: return i;
1.74 noro 5860: }
5861:
1.232 noro 5862: int nd_to_vect_lf(UINT *s0,int n,ND d,mpz_t *r)
5863: {
5864: NM m;
5865: UINT *t,*s;
5866: int i;
5867:
5868: for ( i = 0; i < n; i++ ) { mpz_init(r[i]); mpz_set_ui(r[i],0); }
5869: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
5870: t = DL(m);
5871: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5872: mpz_set(r[i],BDY(CZ(m)));
5873: }
5874: for ( i = 0; !mpz_sgn(r[i]); i++ );
5875: return i;
5876: }
5877:
1.220 noro 5878: unsigned long *nd_to_vect_2(UINT *s0,int n,int *s0hash,ND p)
5879: {
5880: NM m;
5881: unsigned long *v;
5882: int i,j,h,size;
5883: UINT *s,*t;
5884:
5885: size = sizeof(unsigned long)*(n+BLEN-1)/BLEN;
5886: v = (unsigned long *)MALLOC_ATOMIC_IGNORE_OFF_PAGE(size);
5887: bzero(v,size);
5888: for ( i = j = 0, s = s0, m = BDY(p); m; j++, m = NEXT(m) ) {
5889: t = DL(m);
5890: h = ndl_hash_value(t);
5891: for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ );
5892: v[i/BLEN] |= 1L <<(i%BLEN);
5893: }
5894: return v;
5895: }
5896:
5897: int nd_nm_to_vect_2(UINT *s0,int n,int *s0hash,NDV p,NM m,unsigned long *v)
5898: {
5899: NMV mr;
5900: UINT *d,*t,*s;
5901: int i,j,len,h,head;
5902:
5903: d = DL(m);
5904: len = LEN(p);
1.235 noro 5905: t = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
1.220 noro 5906: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
5907: ndl_add(d,DL(mr),t);
5908: h = ndl_hash_value(t);
5909: for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ );
5910: if ( j == 0 ) head = i;
5911: v[i/BLEN] |= 1L <<(i%BLEN);
5912: }
5913: return head;
5914: }
5915:
1.129 noro 5916: Q *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_pair pair)
5917: {
1.157 noro 5918: NM m;
5919: NMV mr;
5920: UINT *d,*t,*s;
5921: NDV p;
5922: int i,j,len;
5923: Q *r;
5924:
5925: m = pair->mul;
5926: d = DL(m);
5927: p = nd_ps[pair->index];
5928: len = LEN(p);
5929: r = (Q *)CALLOC(n,sizeof(Q));
1.235 noro 5930: t = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
1.157 noro 5931: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
5932: ndl_add(d,DL(mr),t);
5933: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5934: r[i] = CQ(mr);
5935: }
5936: return r;
1.129 noro 5937: }
5938:
1.235 noro 5939: IndArray nm_ind_pair_to_vect_compress(int trace,UINT *s0,int n,int *s0hash,NM_ind_pair pair)
1.64 noro 5940: {
1.157 noro 5941: NM m;
5942: NMV mr;
5943: UINT *d,*t,*s;
5944: NDV p;
5945: unsigned char *ivc;
5946: unsigned short *ivs;
5947: UINT *v,*ivi,*s0v;
1.210 noro 5948: int i,j,len,prev,diff,cdiff,h;
1.157 noro 5949: IndArray r;
1.198 noro 5950: struct oEGT eg0,eg1;
1.157 noro 5951:
5952: m = pair->mul;
5953: d = DL(m);
1.235 noro 5954: if ( trace )
5955: p = nd_demand?nd_ps_trace_sym[pair->index]:nd_ps_trace[pair->index];
5956: else
5957: p = nd_demand?nd_ps_sym[pair->index]:nd_ps[pair->index];
5958:
1.157 noro 5959: len = LEN(p);
1.235 noro 5960: t = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
5961: v = (unsigned int *)MALLOC(len*sizeof(unsigned int));
1.198 noro 5962: get_eg(&eg0);
1.157 noro 5963: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
5964: ndl_add(d,DL(mr),t);
1.210 noro 5965: h = ndl_hash_value(t);
5966: for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ );
1.157 noro 5967: v[j] = i;
5968: }
1.198 noro 5969: get_eg(&eg1); add_eg(&eg_search,&eg0,&eg1);
1.157 noro 5970: r = (IndArray)MALLOC(sizeof(struct oIndArray));
5971: r->head = v[0];
5972: diff = 0;
5973: for ( i = 1; i < len; i++ ) {
5974: cdiff = v[i]-v[i-1]; diff = MAX(cdiff,diff);
5975: }
5976: if ( diff < 256 ) {
5977: r->width = 1;
5978: ivc = (unsigned char *)MALLOC_ATOMIC(len*sizeof(unsigned char));
5979: r->index.c = ivc;
5980: for ( i = 1, ivc[0] = 0; i < len; i++ ) ivc[i] = v[i]-v[i-1];
5981: } else if ( diff < 65536 ) {
5982: r->width = 2;
5983: ivs = (unsigned short *)MALLOC_ATOMIC(len*sizeof(unsigned short));
5984: r->index.s = ivs;
5985: for ( i = 1, ivs[0] = 0; i < len; i++ ) ivs[i] = v[i]-v[i-1];
5986: } else {
5987: r->width = 4;
5988: ivi = (unsigned int *)MALLOC_ATOMIC(len*sizeof(unsigned int));
5989: r->index.i = ivi;
5990: for ( i = 1, ivi[0] = 0; i < len; i++ ) ivi[i] = v[i]-v[i-1];
5991: }
5992: return r;
1.64 noro 5993: }
5994:
1.135 noro 5995: int compress_array(Q *svect,Q *cvect,int n)
5996: {
1.157 noro 5997: int i,j;
1.135 noro 5998:
1.157 noro 5999: for ( i = j = 0; i < n; i++ )
6000: if ( svect[i] ) cvect[j++] = svect[i];
6001: return j;
1.135 noro 6002: }
6003:
6004: void expand_array(Q *svect,Q *cvect,int n)
6005: {
1.157 noro 6006: int i,j;
1.135 noro 6007:
1.157 noro 6008: for ( i = j = 0; j < n; i++ )
6009: if ( svect[i] ) svect[i] = cvect[j++];
1.135 noro 6010: }
6011:
1.133 noro 6012: int ndv_reduce_vect_q(Q *svect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.107 noro 6013: {
1.157 noro 6014: int i,j,k,len,pos,prev,nz;
6015: Q cs,mcs,c1,c2,cr,gcd,t;
6016: IndArray ivect;
6017: unsigned char *ivc;
6018: unsigned short *ivs;
6019: unsigned int *ivi;
6020: NDV redv;
6021: NMV mr;
6022: NODE rp;
6023: int maxrs;
6024: double hmag;
6025: Q *cvect;
6026:
6027: maxrs = 0;
6028: for ( i = 0; i < col && !svect[i]; i++ );
6029: if ( i == col ) return maxrs;
6030: hmag = p_mag((P)svect[i])*nd_scale;
1.235 noro 6031: cvect = (Q *)MALLOC(col*sizeof(Q));
1.157 noro 6032: for ( i = 0; i < nred; i++ ) {
6033: ivect = imat[i];
6034: k = ivect->head;
6035: if ( svect[k] ) {
6036: maxrs = MAX(maxrs,rp0[i]->sugar);
1.215 noro 6037: redv = nd_demand?ndv_load(rp0[i]->index)
6038: :(trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index]);
1.157 noro 6039: len = LEN(redv); mr = BDY(redv);
6040: igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr);
6041: chsgnq(cs,&mcs);
6042: if ( !UNIQ(cr) ) {
6043: for ( j = 0; j < col; j++ ) {
6044: mulq(svect[j],cr,&c1); svect[j] = c1;
6045: }
6046: }
6047: svect[k] = 0; prev = k;
6048: switch ( ivect->width ) {
6049: case 1:
6050: ivc = ivect->index.c;
6051: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6052: pos = prev+ivc[j]; prev = pos;
6053: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
6054: }
6055: break;
6056: case 2:
6057: ivs = ivect->index.s;
6058: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6059: pos = prev+ivs[j]; prev = pos;
6060: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
6061: }
6062: break;
6063: case 4:
6064: ivi = ivect->index.i;
6065: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6066: pos = prev+ivi[j]; prev = pos;
6067: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
6068: }
6069: break;
6070: }
6071: for ( j = k+1; j < col && !svect[j]; j++ );
6072: if ( j == col ) break;
6073: if ( hmag && ((double)p_mag((P)svect[j]) > hmag) ) {
6074: nz = compress_array(svect,cvect,col);
6075: removecont_array((P *)cvect,nz,1);
6076: expand_array(svect,cvect,nz);
6077: hmag = ((double)p_mag((P)svect[j]))*nd_scale;
6078: }
6079: }
6080: }
6081: nz = compress_array(svect,cvect,col);
6082: removecont_array((P *)cvect,nz,1);
6083: expand_array(svect,cvect,nz);
6084: if ( DP_Print ) {
6085: fprintf(asir_out,"-"); fflush(asir_out);
6086: }
6087: return maxrs;
1.107 noro 6088: }
6089:
1.215 noro 6090: int ndv_reduce_vect_gz(GZ *gvect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
6091: {
6092: int i,j,k,l,len,pos,prev,nz;
6093: GZ cs,mcs,c1,c2,cr,gcd,t;
6094: IndArray ivect;
6095: unsigned char *ivc;
6096: unsigned short *ivs;
6097: unsigned int *ivi;
6098: NDV redv;
6099: NMV mr;
6100: NODE rp;
6101: int maxrs;
6102: double hmag;
6103: struct oVECT v;
6104:
6105: maxrs = 0;
6106: for ( i = 0; i < col && !gvect[i]; i++ );
6107: if ( i == col ) return maxrs;
6108: hmag = (double)n_bits_gz(gvect[i])*nd_scale;
6109: for ( i = 0; i < nred; i++ ) {
6110: ivect = imat[i];
6111: k = ivect->head;
6112: if ( gvect[k] ) {
6113: maxrs = MAX(maxrs,rp0[i]->sugar);
6114: redv = nd_ps_gz[rp0[i]->index];
6115: len = LEN(redv); mr = BDY(redv);
6116: gcdgz(gvect[k],CZ(mr),&gcd);
6117: divsgz(gvect[k],gcd,&cs);
6118: divsgz(CZ(mr),gcd,&cr);
6119: chsgngz(cs,&mcs);
6120: if ( !UNIGZ(cr) ) {
6121: for ( j = 0; j < col; j++ ) {
6122: mulgz(gvect[j],cr,&c1); gvect[j] = c1;
6123: }
6124: }
6125: gvect[k] = 0; prev = k;
6126: switch ( ivect->width ) {
6127: case 1:
6128: ivc = ivect->index.c;
6129: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6130: pos = prev+ivc[j]; prev = pos;
6131: mulgz(CZ(mr),mcs,&c2); addgz(gvect[pos],c2,&t); gvect[pos] = t;
6132: }
6133: break;
6134: case 2:
6135: ivs = ivect->index.s;
6136: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6137: pos = prev+ivs[j]; prev = pos;
6138: mulgz(CZ(mr),mcs,&c2); addgz(gvect[pos],c2,&t); gvect[pos] = t;
6139: }
6140: break;
6141: case 4:
6142: ivi = ivect->index.i;
6143: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6144: pos = prev+ivi[j]; prev = pos;
6145: mulgz(CZ(mr),mcs,&c2); addgz(gvect[pos],c2,&t); gvect[pos] = t;
6146: }
6147: break;
6148: }
6149: for ( j = k+1; j < col && !gvect[j]; j++ );
6150: if ( j == col ) break;
6151: if ( hmag && ((double)n_bits_gz(gvect[j]) > hmag) ) {
6152: v.len = col; v.body = (pointer)gvect; gcdvgz(&v,&gcd);
6153: #if 1
6154: for ( l = 0; l < col; l++ ) { divsgz(gvect[l],gcd,&t); gvect[l] = t; }
6155: #endif
6156: hmag = (double)n_bits_gz(gvect[j])*nd_scale;
6157: }
6158: }
6159: }
6160: for ( j = 0; j < col && !gvect[j]; j++ );
6161: if ( j < col ) {
6162: v.len = col; v.body = (pointer)gvect; gcdvgz(&v,&gcd);
6163: for ( l = 0; l < col; l++ ) { divsgz(gvect[l],gcd,&t); gvect[l] = t; }
6164: }
6165: if ( DP_Print ) {
6166: fprintf(asir_out,"-"); fflush(asir_out);
6167: }
6168: return maxrs;
6169: }
6170:
1.76 noro 6171: int ndv_reduce_vect(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.65 noro 6172: {
1.157 noro 6173: int i,j,k,len,pos,prev;
6174: UINT c,c1,c2,c3,up,lo,dmy;
6175: IndArray ivect;
6176: unsigned char *ivc;
6177: unsigned short *ivs;
6178: unsigned int *ivi;
6179: NDV redv;
6180: NMV mr;
6181: NODE rp;
6182: int maxrs;
6183:
6184: maxrs = 0;
6185: for ( i = 0; i < nred; i++ ) {
6186: ivect = imat[i];
6187: k = ivect->head; svect[k] %= m;
6188: if ( c = svect[k] ) {
6189: maxrs = MAX(maxrs,rp0[i]->sugar);
6190: c = m-c; redv = nd_ps[rp0[i]->index];
6191: len = LEN(redv); mr = BDY(redv);
6192: svect[k] = 0; prev = k;
6193: switch ( ivect->width ) {
6194: case 1:
6195: ivc = ivect->index.c;
6196: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
1.215 noro 6197: pos = prev+ivc[j]; c1 = CM(mr); prev = pos;
6198: if ( c1 ) {
6199: c2 = svect[pos];
6200: DMA(c1,c,c2,up,lo);
6201: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
6202: } else svect[pos] = lo;
6203: }
1.157 noro 6204: }
6205: break;
6206: case 2:
6207: ivs = ivect->index.s;
6208: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
1.215 noro 6209: pos = prev+ivs[j]; c1 = CM(mr);
1.157 noro 6210: prev = pos;
1.215 noro 6211: if ( c1 ) {
6212: c2 = svect[pos];
6213: DMA(c1,c,c2,up,lo);
6214: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
6215: } else svect[pos] = lo;
6216: }
1.157 noro 6217: }
6218: break;
6219: case 4:
6220: ivi = ivect->index.i;
6221: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
1.215 noro 6222: pos = prev+ivi[j]; c1 = CM(mr);
1.157 noro 6223: prev = pos;
1.215 noro 6224: if ( c1 ) {
6225: c2 = svect[pos];
6226: DMA(c1,c,c2,up,lo);
6227: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
6228: } else svect[pos] = lo;
6229: }
1.157 noro 6230: }
6231: break;
6232: }
6233: }
6234: }
6235: for ( i = 0; i < col; i++ )
6236: if ( svect[i] >= (UINT)m ) svect[i] %= m;
6237: return maxrs;
1.65 noro 6238: }
6239:
1.239 noro 6240: #if defined(__GNUC__)
1.240 ! noro 6241:
! 6242: int ndv_reduce_vect64(int m,U64 *svect,U64 *cvect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.239 noro 6243: {
6244: int i,j,k,len,pos,prev;
1.240 ! noro 6245: U64 a,c,c1,c2;
1.239 noro 6246: IndArray ivect;
6247: unsigned char *ivc;
6248: unsigned short *ivs;
6249: unsigned int *ivi;
6250: NDV redv;
6251: NMV mr;
6252: NODE rp;
6253: int maxrs;
6254:
1.240 ! noro 6255: for ( i = 0; i < col; i++ ) cvect[i] = 0;
1.239 noro 6256: maxrs = 0;
6257: for ( i = 0; i < nred; i++ ) {
6258: ivect = imat[i];
1.240 ! noro 6259: k = ivect->head;
! 6260: a = svect[k]; c = cvect[k];
! 6261: MOD128(a,c,m);
! 6262: svect[k] = a; cvect[k] = 0;
1.239 noro 6263: if ( c = svect[k] ) {
6264: maxrs = MAX(maxrs,rp0[i]->sugar);
6265: c = m-c; redv = nd_ps[rp0[i]->index];
6266: len = LEN(redv); mr = BDY(redv);
6267: svect[k] = 0; prev = k;
6268: switch ( ivect->width ) {
6269: case 1:
6270: ivc = ivect->index.c;
6271: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6272: pos = prev+ivc[j]; c1 = CM(mr); prev = pos;
1.240 ! noro 6273: if ( c1 ) {
! 6274: c2 = svect[pos]+c1*c;
! 6275: if ( c2 < svect[pos] ) cvect[pos]++;
! 6276: svect[pos] = c2;
! 6277: }
1.239 noro 6278: }
6279: break;
6280: case 2:
6281: ivs = ivect->index.s;
6282: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6283: pos = prev+ivs[j]; c1 = CM(mr); prev = pos;
1.240 ! noro 6284: if ( c1 ) {
! 6285: c2 = svect[pos]+c1*c;
! 6286: if ( c2 < svect[pos] ) cvect[pos]++;
! 6287: svect[pos] = c2;
! 6288: }
1.239 noro 6289: }
6290: break;
6291: case 4:
6292: ivi = ivect->index.i;
6293: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6294: pos = prev+ivi[j]; c1 = CM(mr); prev = pos;
1.240 ! noro 6295: if ( c1 ) {
! 6296: c2 = svect[pos]+c1*c;
! 6297: if ( c2 < svect[pos] ) cvect[pos]++;
! 6298: svect[pos] = c2;
! 6299: }
1.239 noro 6300: }
6301: break;
6302: }
6303: }
6304: }
1.240 ! noro 6305: for ( i = 0; i < col; i++ ) {
! 6306: a = svect[i]; c = cvect[i]; MOD128(a,c,m); svect[i] = a;
! 6307: }
1.239 noro 6308: return maxrs;
6309: }
6310: #endif
6311:
1.76 noro 6312: int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.72 noro 6313: {
1.157 noro 6314: int i,j,k,len,pos,prev;
6315: UINT c,c1,c2,c3,up,lo,dmy;
6316: IndArray ivect;
6317: unsigned char *ivc;
6318: unsigned short *ivs;
6319: unsigned int *ivi;
6320: NDV redv;
6321: NMV mr;
6322: NODE rp;
6323: int maxrs;
6324:
6325: maxrs = 0;
6326: for ( i = 0; i < nred; i++ ) {
6327: ivect = imat[i];
1.232 noro 6328: k = ivect->head;
1.157 noro 6329: if ( c = svect[k] ) {
6330: maxrs = MAX(maxrs,rp0[i]->sugar);
6331: c = _chsgnsf(c); redv = nd_ps[rp0[i]->index];
6332: len = LEN(redv); mr = BDY(redv);
6333: svect[k] = 0; prev = k;
6334: switch ( ivect->width ) {
6335: case 1:
6336: ivc = ivect->index.c;
6337: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6338: pos = prev+ivc[j]; prev = pos;
6339: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
6340: }
6341: break;
6342: case 2:
6343: ivs = ivect->index.s;
6344: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6345: pos = prev+ivs[j]; prev = pos;
6346: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
6347: }
6348: break;
6349: case 4:
6350: ivi = ivect->index.i;
6351: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6352: pos = prev+ivi[j]; prev = pos;
6353: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
6354: }
6355: break;
6356: }
6357: }
6358: }
6359: return maxrs;
1.72 noro 6360: }
6361:
1.232 noro 6362: ND nd_add_lf(ND p1,ND p2)
6363: {
6364: int n,c,can;
6365: ND r;
6366: NM m1,m2,mr0,mr,s;
6367: GZ t;
6368:
6369: if ( !p1 ) return p2;
6370: else if ( !p2 ) return p1;
6371: else {
6372: can = 0;
6373: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
6374: c = DL_COMPARE(DL(m1),DL(m2));
6375: switch ( c ) {
6376: case 0:
6377: addlf(CZ(m1),CZ(m2),&t);
6378: s = m1; m1 = NEXT(m1);
6379: if ( t ) {
6380: can++; NEXTNM2(mr0,mr,s); CZ(mr) = (t);
6381: } else {
6382: can += 2; FREENM(s);
6383: }
6384: s = m2; m2 = NEXT(m2); FREENM(s);
6385: break;
6386: case 1:
6387: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
6388: break;
6389: case -1:
6390: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
6391: break;
6392: }
6393: }
6394: if ( !mr0 )
6395: if ( m1 ) mr0 = m1;
6396: else if ( m2 ) mr0 = m2;
6397: else return 0;
6398: else if ( m1 ) NEXT(mr) = m1;
6399: else if ( m2 ) NEXT(mr) = m2;
6400: else NEXT(mr) = 0;
6401: BDY(p1) = mr0;
6402: SG(p1) = MAX(SG(p1),SG(p2));
6403: LEN(p1) = LEN(p1)+LEN(p2)-can;
6404: FREEND(p2);
6405: return p1;
6406: }
6407: }
6408:
1.234 noro 6409: int ndv_reduce_vect_lf(mpz_t *svect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.232 noro 6410: {
6411: int i,j,k,len,pos,prev;
6412: mpz_t c,mc,c1;
6413: IndArray ivect;
6414: unsigned char *ivc;
6415: unsigned short *ivs;
6416: unsigned int *ivi;
6417: NDV redv;
6418: NMV mr;
6419: NODE rp;
6420: int maxrs;
6421:
6422: maxrs = 0;
6423: lf_lazy = 1;
6424: for ( i = 0; i < nred; i++ ) {
6425: ivect = imat[i];
6426: k = ivect->head;
6427: mpz_mod(svect[k],svect[k],BDY(current_mod_lf));
6428: if ( mpz_sgn(svect[k]) ) {
6429: maxrs = MAX(maxrs,rp0[i]->sugar);
6430: mpz_neg(svect[k],svect[k]);
1.234 noro 6431: redv = trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index];
1.232 noro 6432: len = LEN(redv); mr = BDY(redv);
6433: prev = k;
6434: switch ( ivect->width ) {
6435: case 1:
6436: ivc = ivect->index.c;
6437: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6438: pos = prev+ivc[j]; prev = pos;
6439: mpz_addmul(svect[pos],svect[k],BDY(CZ(mr)));
6440: }
6441: break;
6442: case 2:
6443: ivs = ivect->index.s;
6444: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6445: pos = prev+ivs[j]; prev = pos;
6446: mpz_addmul(svect[pos],svect[k],BDY(CZ(mr)));
6447: }
6448: break;
6449: case 4:
6450: ivi = ivect->index.i;
6451: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6452: pos = prev+ivi[j]; prev = pos;
6453: mpz_addmul(svect[pos],svect[k],BDY(CZ(mr)));
6454: }
6455: break;
6456: }
6457: mpz_set_ui(svect[k],0);
6458: }
6459: }
6460: lf_lazy=0;
6461: for ( i = 0; i < col; i++ ) {
6462: mpz_mod(svect[i],svect[i],BDY(current_mod_lf));
6463: }
6464: return maxrs;
6465: }
6466:
6467: int nd_gauss_elim_lf(mpz_t **mat0,int *sugar,int row,int col,int *colstat)
6468: {
6469: int i,j,k,l,rank,s;
6470: mpz_t a,a1,inv;
6471: mpz_t *t,*pivot,*pk;
6472: mpz_t **mat;
6473: struct oEGT eg0,eg1,eg_forward,eg_mod,eg_back;
1.234 noro 6474: int size,size1;
1.232 noro 6475:
6476: mpz_init(inv);
6477: mpz_init(a);
6478: mat = (mpz_t **)mat0;
1.234 noro 6479: size = 0;
1.232 noro 6480: for ( rank = 0, j = 0; j < col; j++ ) {
6481: for ( i = rank; i < row; i++ ) {
6482: mpz_mod(mat[i][j],mat[i][j],BDY(current_mod_lf));
6483: }
6484: for ( i = rank; i < row; i++ )
6485: if ( mpz_sgn(mat[i][j]) )
6486: break;
6487: if ( i == row ) {
6488: colstat[j] = 0;
6489: continue;
6490: } else
6491: colstat[j] = 1;
6492: if ( i != rank ) {
6493: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
6494: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
6495: }
6496: pivot = mat[rank];
6497: s = sugar[rank];
6498: mpz_invert(inv,pivot[j],BDY(current_mod_lf));
6499: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
6500: if ( mpz_sgn(*pk) ) {
6501: mpz_mul(a,*pk,inv); mpz_mod(*pk,a,BDY(current_mod_lf));
6502: }
6503: for ( i = rank+1; i < row; i++ ) {
6504: t = mat[i];
6505: if ( mpz_sgn(t[j]) ) {
6506: sugar[i] = MAX(sugar[i],s);
6507: mpz_neg(a,t[j]);
6508: red_by_vect_lf(t+j,pivot+j,a,col-j);
6509: }
6510: }
6511: rank++;
6512: }
6513: for ( j = col-1, l = rank-1; j >= 0; j-- )
6514: if ( colstat[j] ) {
6515: pivot = mat[l];
6516: s = sugar[l];
6517: for ( k = j; k < col; k++ )
6518: mpz_mod(pivot[k],pivot[k],BDY(current_mod_lf));
6519: for ( i = 0; i < l; i++ ) {
6520: t = mat[i];
6521: if ( mpz_sgn(t[j]) ) {
6522: sugar[i] = MAX(sugar[i],s);
6523: mpz_neg(a,t[j]);
6524: red_by_vect_lf(t+j,pivot+j,a,col-j);
6525: }
6526: }
6527: l--;
6528: }
6529: for ( j = 0, l = 0; l < rank; j++ )
6530: if ( colstat[j] ) {
6531: t = mat[l];
6532: for ( k = j; k < col; k++ ) {
6533: mpz_mod(t[k],t[k],BDY(current_mod_lf));
6534: }
6535: l++;
6536: }
6537: return rank;
6538: }
6539:
6540:
1.65 noro 6541: NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhead,UINT *s0vect)
6542: {
1.157 noro 6543: int j,k,len;
6544: UINT *p;
6545: UINT c;
6546: NDV r;
6547: NMV mr0,mr;
6548:
6549: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
6550: if ( !len ) return 0;
6551: else {
1.200 noro 6552: mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len);
1.103 noro 6553: #if 0
1.157 noro 6554: ndv_alloc += nmv_adv*len;
1.103 noro 6555: #endif
1.157 noro 6556: mr = mr0;
6557: p = s0vect;
6558: for ( j = k = 0; j < col; j++, p += nd_wpd )
6559: if ( !rhead[j] ) {
6560: if ( c = vect[k++] ) {
6561: ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr);
6562: }
6563: }
6564: MKNDV(nd_nvar,mr0,len,r);
6565: return r;
6566: }
1.65 noro 6567: }
6568:
1.239 noro 6569: #if defined(__GNUC__)
1.240 ! noro 6570: NDV vect64_to_ndv(U64 *vect,int spcol,int col,int *rhead,UINT *s0vect)
1.239 noro 6571: {
6572: int j,k,len;
6573: UINT *p;
6574: UINT c;
6575: NDV r;
6576: NMV mr0,mr;
6577:
6578: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
6579: if ( !len ) return 0;
6580: else {
6581: mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len);
6582: #if 0
6583: ndv_alloc += nmv_adv*len;
6584: #endif
6585: mr = mr0;
6586: p = s0vect;
6587: for ( j = k = 0; j < col; j++, p += nd_wpd )
6588: if ( !rhead[j] ) {
6589: if ( c = (UINT)vect[k++] ) {
6590: ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr);
6591: }
6592: }
6593: MKNDV(nd_nvar,mr0,len,r);
6594: return r;
6595: }
6596: }
6597: #endif
6598:
1.220 noro 6599: NDV vect_to_ndv_2(unsigned long *vect,int col,UINT *s0vect)
6600: {
6601: int j,k,len;
6602: UINT *p;
6603: NDV r;
6604: NMV mr0,mr;
6605:
6606: for ( j = 0, len = 0; j < col; j++ ) if ( vect[j/BLEN] & (1L<<(j%BLEN)) ) len++;
6607: if ( !len ) return 0;
6608: else {
6609: mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len);
6610: mr = mr0;
6611: p = s0vect;
6612: for ( j = 0; j < col; j++, p += nd_wpd )
6613: if ( vect[j/BLEN] & (1L<<(j%BLEN)) ) {
6614: ndl_copy(p,DL(mr)); CM(mr) = 1; NMV_ADV(mr);
6615: }
6616: MKNDV(nd_nvar,mr0,len,r);
6617: return r;
6618: }
6619: }
6620:
1.129 noro 6621: /* for preprocessed vector */
6622:
1.113 noro 6623: NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead,UINT *s0vect)
1.107 noro 6624: {
1.157 noro 6625: int j,k,len;
6626: UINT *p;
6627: Q c;
6628: NDV r;
6629: NMV mr0,mr;
6630:
6631: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
6632: if ( !len ) return 0;
6633: else {
1.200 noro 6634: mr0 = (NMV)MALLOC(nmv_adv*len);
1.107 noro 6635: #if 0
1.157 noro 6636: ndv_alloc += nmv_adv*len;
1.107 noro 6637: #endif
1.157 noro 6638: mr = mr0;
6639: p = s0vect;
6640: for ( j = k = 0; j < col; j++, p += nd_wpd )
6641: if ( !rhead[j] ) {
6642: if ( c = vect[k++] ) {
6643: if ( DN(c) )
6644: error("afo");
6645: ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr);
6646: }
6647: }
6648: MKNDV(nd_nvar,mr0,len,r);
6649: return r;
6650: }
1.107 noro 6651: }
6652:
1.215 noro 6653: NDV vect_to_ndv_gz(GZ *vect,int spcol,int col,int *rhead,UINT *s0vect)
6654: {
6655: int j,k,len;
6656: UINT *p;
1.232 noro 6657: GZ c;
1.215 noro 6658: NDV r;
6659: NMV mr0,mr;
6660:
6661: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
6662: if ( !len ) return 0;
6663: else {
6664: mr0 = (NMV)MALLOC(nmv_adv*len);
6665: #if 0
6666: ndv_alloc += nmv_adv*len;
6667: #endif
6668: mr = mr0;
6669: p = s0vect;
6670: for ( j = k = 0; j < col; j++, p += nd_wpd )
6671: if ( !rhead[j] ) {
6672: if ( c = vect[k++] ) {
6673: ndl_copy(p,DL(mr)); CZ(mr) = c; NMV_ADV(mr);
6674: }
6675: }
6676: MKNDV(nd_nvar,mr0,len,r);
6677: return r;
6678: }
6679: }
6680:
1.232 noro 6681: NDV vect_to_ndv_lf(mpz_t *vect,int spcol,int col,int *rhead,UINT *s0vect)
6682: {
6683: int j,k,len;
6684: UINT *p;
6685: mpz_t c;
6686: NDV r;
6687: NMV mr0,mr;
6688:
6689: for ( j = 0, len = 0; j < spcol; j++ ) if ( mpz_sgn(vect[j]) ) len++;
6690: if ( !len ) return 0;
6691: else {
6692: mr0 = (NMV)MALLOC(nmv_adv*len);
6693: #if 0
6694: ndv_alloc += nmv_adv*len;
6695: #endif
6696: mr = mr0;
6697: p = s0vect;
6698: for ( j = k = 0; j < col; j++, p += nd_wpd )
6699: if ( !rhead[j] ) {
6700: c[0] = vect[k++][0];
6701: if ( mpz_sgn(c) ) {
6702: ndl_copy(p,DL(mr)); MPZTOGZ(c,CZ(mr)); NMV_ADV(mr);
6703: }
6704: }
6705: MKNDV(nd_nvar,mr0,len,r);
6706: return r;
6707: }
6708: }
6709:
1.129 noro 6710: /* for plain vector */
6711:
6712: NDV plain_vect_to_ndv_q(Q *vect,int col,UINT *s0vect)
6713: {
1.157 noro 6714: int j,k,len;
6715: UINT *p;
6716: Q c;
6717: NDV r;
6718: NMV mr0,mr;
6719:
6720: for ( j = 0, len = 0; j < col; j++ ) if ( vect[j] ) len++;
6721: if ( !len ) return 0;
6722: else {
1.200 noro 6723: mr0 = (NMV)MALLOC(nmv_adv*len);
1.129 noro 6724: #if 0
1.157 noro 6725: ndv_alloc += nmv_adv*len;
1.129 noro 6726: #endif
1.157 noro 6727: mr = mr0;
6728: p = s0vect;
6729: for ( j = k = 0; j < col; j++, p += nd_wpd, k++ )
6730: if ( c = vect[k] ) {
6731: if ( DN(c) )
6732: error("afo");
6733: ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr);
6734: }
6735: MKNDV(nd_nvar,mr0,len,r);
6736: return r;
6737: }
1.129 noro 6738: }
6739:
1.133 noro 6740: int nd_sp_f4(int m,int trace,ND_pairs l,PGeoBucket bucket)
1.65 noro 6741: {
1.157 noro 6742: ND_pairs t;
6743: NODE sp0,sp;
6744: int stat;
6745: ND spol;
6746:
6747: for ( t = l; t; t = NEXT(t) ) {
6748: stat = nd_sp(m,trace,t,&spol);
6749: if ( !stat ) return 0;
6750: if ( spol ) {
6751: add_pbucket_symbolic(bucket,spol);
6752: }
6753: }
6754: return 1;
1.65 noro 6755: }
6756:
1.133 noro 6757: int nd_symbolic_preproc(PGeoBucket bucket,int trace,UINT **s0vect,NODE *r)
1.65 noro 6758: {
1.157 noro 6759: NODE rp0,rp;
6760: NM mul,head,s0,s;
6761: int index,col,i,sugar;
6762: RHist h;
6763: UINT *s0v,*p;
6764: NM_ind_pair pair;
6765: ND red;
6766: NDV *ps;
1.235 noro 6767: static int afo;
1.157 noro 6768:
6769: s0 = 0; rp0 = 0; col = 0;
1.215 noro 6770: if ( nd_demand )
6771: ps = trace?nd_ps_trace_sym:nd_ps_sym;
6772: else
6773: ps = trace?nd_ps_trace:nd_ps;
1.157 noro 6774: while ( 1 ) {
6775: head = remove_head_pbucket_symbolic(bucket);
6776: if ( !head ) break;
6777: if ( !s0 ) s0 = head;
6778: else NEXT(s) = head;
6779: s = head;
6780: index = ndl_find_reducer(DL(head));
6781: if ( index >= 0 ) {
6782: h = nd_psh[index];
6783: NEWNM(mul);
6784: ndl_sub(DL(head),DL(h),DL(mul));
1.235 noro 6785: if ( ndl_check_bound2(index,DL(mul)) )
6786: return 0;
1.157 noro 6787: sugar = TD(DL(mul))+SG(ps[index]);
6788: MKNM_ind_pair(pair,mul,index,sugar);
6789: red = ndv_mul_nm_symbolic(mul,ps[index]);
6790: add_pbucket_symbolic(bucket,nd_remove_head(red));
6791: NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair;
6792: }
6793: col++;
6794: }
6795: if ( rp0 ) NEXT(rp) = 0;
6796: NEXT(s) = 0;
6797: s0v = (UINT *)MALLOC_ATOMIC(col*nd_wpd*sizeof(UINT));
6798: for ( i = 0, p = s0v, s = s0; i < col;
6799: i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p);
6800: *s0vect = s0v;
6801: *r = rp0;
6802: return col;
1.65 noro 6803: }
6804:
1.234 noro 6805: NODE nd_f4(int m,int checkonly,int **indp)
1.69 noro 6806: {
1.234 noro 6807: int i,nh,stat,index,f4red;
1.208 noro 6808: NODE r,g,tn0,tn,node;
6809: ND_pairs d,l,t,ll0,ll;
6810: LIST l0,l1;
1.157 noro 6811: ND spol,red;
6812: NDV nf,redv;
6813: NM s0,s;
1.231 noro 6814: NODE rp0,srp0,nflist,nzlist,nzlist_t;
1.208 noro 6815: int nsp,nred,col,rank,len,k,j,a,i1s,i2s;
1.157 noro 6816: UINT c;
6817: UINT **spmat;
6818: UINT *s0vect,*svect,*p,*v;
6819: int *colstat;
6820: IndArray *imat;
6821: int *rhead;
6822: int spcol,sprow;
6823: int sugar;
6824: PGeoBucket bucket;
6825: struct oEGT eg0,eg1,eg_f4;
1.208 noro 6826: Q i1,i2,sugarq;
1.103 noro 6827: #if 0
1.157 noro 6828: ndv_alloc = 0;
1.103 noro 6829: #endif
1.157 noro 6830: g = 0; d = 0;
6831: for ( i = 0; i < nd_psn; i++ ) {
1.231 noro 6832: if ( !nd_nzlist ) d = update_pairs(d,g,i,0);
1.157 noro 6833: g = update_base(g,i);
6834: }
1.208 noro 6835: nzlist = 0;
1.231 noro 6836: nzlist_t = nd_nzlist;
1.234 noro 6837: f4red = 0;
1.231 noro 6838: while ( d || nzlist_t ) {
1.157 noro 6839: get_eg(&eg0);
1.208 noro 6840: if ( nd_nzlist ) {
1.231 noro 6841: node = BDY((LIST)BDY(nzlist_t));
1.232 noro 6842: sugar = (int)ARG0(node);
1.231 noro 6843: tn = BDY((LIST)ARG1(node));
6844: if ( !tn ) {
6845: nzlist_t = NEXT(nzlist_t);
6846: continue;
6847: }
6848: /* tn = [[i1,i2],...] */
6849: l = nd_ipairtospair(tn);
6850: } else {
6851: l = nd_minsugarp(d,&d);
6852: sugar = nd_sugarweight?l->sugar2:SG(l);
6853: if ( MaxDeg > 0 && sugar > MaxDeg ) break;
1.208 noro 6854: }
1.157 noro 6855: bucket = create_pbucket();
6856: stat = nd_sp_f4(m,0,l,bucket);
6857: if ( !stat ) {
1.231 noro 6858: if ( !nd_nzlist ) {
6859: for ( t = l; NEXT(t); t = NEXT(t) );
6860: NEXT(t) = d; d = l;
6861: d = nd_reconstruct(0,d);
6862: }
1.157 noro 6863: continue;
6864: }
6865: if ( bucket->m < 0 ) continue;
6866: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
6867: if ( !col ) {
6868: for ( t = l; NEXT(t); t = NEXT(t) );
6869: NEXT(t) = d; d = l;
6870: d = nd_reconstruct(0,d);
6871: continue;
6872: }
6873: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
6874: if ( DP_Print )
6875: fprintf(asir_out,"sugar=%d,symb=%fsec,",
6876: sugar,eg_f4.exectime+eg_f4.gctime);
1.210 noro 6877: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,nd_gentrace?&ll:0);
1.234 noro 6878: if ( checkonly && nflist ) return 0;
1.157 noro 6879: /* adding new bases */
6880: for ( r = nflist; r; r = NEXT(r) ) {
6881: nf = (NDV)BDY(r);
6882: ndv_removecont(m,nf);
6883: if ( !m && nd_nalg ) {
6884: ND nf1;
6885:
6886: nf1 = ndvtond(m,nf);
6887: nd_monic(0,&nf1);
6888: nd_removecont(m,nf1);
6889: nf = ndtondv(m,nf1);
6890: }
1.215 noro 6891: nh = ndv_newps(m,nf,0,1);
1.231 noro 6892: if ( !nd_nzlist ) d = update_pairs(d,g,nh,0);
1.157 noro 6893: g = update_base(g,nh);
6894: }
1.234 noro 6895: if ( DP_Print ) {
6896: fprintf(asir_out,"f4red=%d,gblen=%d,",f4red,length(g)); fflush(asir_out);
6897: }
1.208 noro 6898: if ( nd_gentrace ) {
6899: for ( t = ll, tn0 = 0; t; t = NEXT(t) ) {
6900: NEXTNODE(tn0,tn);
6901: STOQ(t->i1,i1); STOQ(t->i2,i2);
6902: node = mknode(2,i1,i2); MKLIST(l0,node);
6903: BDY(tn) = l0;
6904: }
6905: if ( tn0 ) NEXT(tn) = 0; MKLIST(l0,tn0);
6906: STOQ(sugar,sugarq); node = mknode(2,sugarq,l0); MKLIST(l1,node);
6907: MKNODE(node,l1,nzlist); nzlist = node;
6908: }
1.231 noro 6909: if ( nd_nzlist ) nzlist_t = NEXT(nzlist_t);
1.234 noro 6910: f4red++;
6911: if ( nd_f4red && f4red >= nd_f4red ) break;
6912: if ( nd_rank0 && !nflist ) break;
1.208 noro 6913: }
6914: if ( nd_gentrace ) {
6915: MKLIST(l0,reverse_node(nzlist));
6916: MKNODE(nd_alltracelist,l0,0);
1.157 noro 6917: }
1.103 noro 6918: #if 0
1.157 noro 6919: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.103 noro 6920: #endif
1.215 noro 6921: conv_ilist(nd_demand,0,g,indp);
1.157 noro 6922: return g;
1.69 noro 6923: }
1.74 noro 6924:
1.167 noro 6925: NODE nd_f4_trace(int m,int **indp)
1.133 noro 6926: {
1.157 noro 6927: int i,nh,stat,index;
6928: NODE r,g;
6929: ND_pairs d,l,l0,t;
6930: ND spol,red;
6931: NDV nf,redv,nfqv,nfv;
6932: NM s0,s;
6933: NODE rp0,srp0,nflist;
6934: int nsp,nred,col,rank,len,k,j,a;
6935: UINT c;
6936: UINT **spmat;
6937: UINT *s0vect,*svect,*p,*v;
6938: int *colstat;
6939: IndArray *imat;
6940: int *rhead;
6941: int spcol,sprow;
6942: int sugar;
6943: PGeoBucket bucket;
6944: struct oEGT eg0,eg1,eg_f4;
6945:
6946: g = 0; d = 0;
6947: for ( i = 0; i < nd_psn; i++ ) {
1.168 noro 6948: d = update_pairs(d,g,i,0);
1.157 noro 6949: g = update_base(g,i);
6950: }
6951: while ( d ) {
6952: get_eg(&eg0);
6953: l = nd_minsugarp(d,&d);
6954: sugar = SG(l);
1.228 noro 6955: if ( MaxDeg > 0 && sugar > MaxDeg ) break;
1.157 noro 6956: bucket = create_pbucket();
6957: stat = nd_sp_f4(m,0,l,bucket);
6958: if ( !stat ) {
6959: for ( t = l; NEXT(t); t = NEXT(t) );
6960: NEXT(t) = d; d = l;
6961: d = nd_reconstruct(1,d);
6962: continue;
6963: }
6964: if ( bucket->m < 0 ) continue;
6965: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
6966: if ( !col ) {
6967: for ( t = l; NEXT(t); t = NEXT(t) );
6968: NEXT(t) = d; d = l;
6969: d = nd_reconstruct(1,d);
6970: continue;
6971: }
6972: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
6973: if ( DP_Print )
6974: fprintf(asir_out,"sugar=%d,symb=%fsec,",
6975: sugar,eg_f4.exectime+eg_f4.gctime);
6976: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0);
6977: if ( !l0 ) continue;
6978: l = l0;
6979:
6980: /* over Q */
6981: bucket = create_pbucket();
6982: stat = nd_sp_f4(0,1,l,bucket);
6983: if ( !stat ) {
6984: for ( t = l; NEXT(t); t = NEXT(t) );
6985: NEXT(t) = d; d = l;
6986: d = nd_reconstruct(1,d);
6987: continue;
6988: }
6989: if ( bucket->m < 0 ) continue;
6990: col = nd_symbolic_preproc(bucket,1,&s0vect,&rp0);
6991: if ( !col ) {
6992: for ( t = l; NEXT(t); t = NEXT(t) );
6993: NEXT(t) = d; d = l;
6994: d = nd_reconstruct(1,d);
6995: continue;
6996: }
6997: nflist = nd_f4_red(0,l,1,s0vect,col,rp0,0);
6998: /* adding new bases */
6999: for ( r = nflist; r; r = NEXT(r) ) {
7000: nfqv = (NDV)BDY(r);
7001: ndv_removecont(0,nfqv);
7002: if ( !rem(NM(HCQ(nfqv)),m) ) return 0;
7003: if ( nd_nalg ) {
7004: ND nf1;
7005:
7006: nf1 = ndvtond(m,nfqv);
7007: nd_monic(0,&nf1);
7008: nd_removecont(0,nf1);
7009: nfqv = ndtondv(0,nf1); nd_free(nf1);
7010: }
7011: nfv = ndv_dup(0,nfqv);
7012: ndv_mod(m,nfv);
7013: ndv_removecont(m,nfv);
1.215 noro 7014: nh = ndv_newps(0,nfv,nfqv,1);
1.168 noro 7015: d = update_pairs(d,g,nh,0);
1.157 noro 7016: g = update_base(g,nh);
7017: }
7018: }
1.133 noro 7019: #if 0
1.157 noro 7020: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.133 noro 7021: #endif
1.215 noro 7022: conv_ilist(nd_demand,1,g,indp);
1.157 noro 7023: return g;
1.133 noro 7024: }
7025:
1.220 noro 7026: int rref(matrix mat,int *sugar)
7027: {
7028: int row,col,i,j,k,l,s,wcol,wj;
7029: unsigned long bj;
7030: unsigned long **a;
7031: unsigned long *ai,*ak,*as,*t;
7032: int *pivot;
7033:
7034: row = mat->row;
7035: col = mat->col;
7036: a = mat->a;
7037: wcol = (col+BLEN-1)/BLEN;
7038: pivot = (int *)MALLOC_ATOMIC(row*sizeof(int));
7039: i = 0;
7040: for ( j = 0; j < col; j++ ) {
7041: wj = j/BLEN; bj = 1L<<(j%BLEN);
7042: for ( k = i; k < row; k++ )
7043: if ( a[k][wj] & bj ) break;
7044: if ( k == row ) continue;
7045: pivot[i] = j;
7046: if ( k != i ) {
7047: t = a[i]; a[i] = a[k]; a[k] = t;
7048: s = sugar[i]; sugar[i] = sugar[k]; sugar[k] = s;
7049: }
7050: ai = a[i];
7051: for ( k = i+1; k < row; k++ ) {
7052: ak = a[k];
7053: if ( ak[wj] & bj ) {
7054: for ( l = wj; l < wcol; l++ )
7055: ak[l] ^= ai[l];
7056: sugar[k] = MAX(sugar[k],sugar[i]);
7057: }
7058: }
7059: i++;
7060: }
7061: for ( k = i-1; k >= 0; k-- ) {
7062: j = pivot[k]; wj = j/BLEN; bj = 1L<<(j%BLEN);
7063: ak = a[k];
7064: for ( s = 0; s < k; s++ ) {
7065: as = a[s];
7066: if ( as[wj] & bj ) {
7067: for ( l = wj; l < wcol; l++ )
7068: as[l] ^= ak[l];
7069: sugar[s] = MAX(sugar[s],sugar[k]);
7070: }
7071: }
7072: }
7073: return i;
7074: }
7075:
7076: void print_matrix(matrix mat)
7077: {
7078: int row,col,i,j;
7079: unsigned long *ai;
7080:
7081: row = mat->row;
7082: col = mat->col;
7083: printf("%d x %d\n",row,col);
7084: for ( i = 0; i < row; i++ ) {
7085: ai = mat->a[i];
7086: for ( j = 0; j < col; j++ ) {
7087: if ( ai[j/BLEN] & (1L<<(j%BLEN)) ) putchar('1');
7088: else putchar('0');
7089: }
7090: putchar('\n');
7091: }
7092: }
7093:
7094: NDV vect_to_ndv_2(unsigned long *vect,int col,UINT *s0vect);
7095:
7096: void red_by_vect_2(matrix mat,int *sugar,unsigned long *v,int rhead,int rsugar)
7097: {
7098: int row,col,wcol,wj,i,j;
7099: unsigned long bj;
7100: unsigned long *ai;
7101: unsigned long **a;
7102: int len;
7103: int *pos;
7104:
7105: row = mat->row;
7106: col = mat->col;
7107: wcol = (col+BLEN-1)/BLEN;
1.235 noro 7108: pos = (int *)MALLOC(wcol*sizeof(int));
1.220 noro 7109: bzero(pos,wcol*sizeof(int));
7110: for ( i = j = 0; i < wcol; i++ )
7111: if ( v[i] ) pos[j++] = i;;
7112: len = j;
7113: wj = rhead/BLEN;
7114: bj = 1L<<rhead%BLEN;
7115: a = mat->a;
7116: for ( i = 0; i < row; i++ ) {
7117: ai = a[i];
7118: if ( ai[wj]&bj ) {
7119: for ( j = 0; j < len; j++ )
7120: ai[pos[j]] ^= v[pos[j]];
7121: sugar[i] = MAX(sugar[i],rsugar);
7122: }
7123: }
7124: }
7125:
7126: NODE nd_f4_red_2(ND_pairs sp0,UINT *s0vect,int col,NODE rp0,ND_pairs *nz)
7127: {
7128: int nsp,nred,i,i0,k,rank,row;
7129: NODE r0,rp;
7130: ND_pairs sp;
7131: ND spol;
7132: NM_ind_pair rt;
7133: int *s0hash;
7134: UINT *s;
7135: int *pivot,*sugar,*head;
7136: matrix mat;
7137: NM m;
7138: NODE r;
7139: struct oEGT eg0,eg1,eg2,eg_elim1,eg_elim2;
7140: int rhead,rsugar,size;
7141: unsigned long *v;
7142:
7143: get_eg(&eg0);
7144: init_eg(&eg_search);
7145: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
7146: nred = length(rp0);
7147: mat = alloc_matrix(nsp,col);
1.235 noro 7148: s0hash = (int *)MALLOC(col*sizeof(int));
1.220 noro 7149: for ( i = 0, s = s0vect; i < col; i++, s += nd_wpd )
7150: s0hash[i] = ndl_hash_value(s);
7151:
1.235 noro 7152: sugar = (int *)MALLOC(nsp*sizeof(int));
1.220 noro 7153: for ( i = 0, sp = sp0; sp; sp = NEXT(sp) ) {
7154: nd_sp(2,0,sp,&spol);
7155: if ( spol ) {
7156: mat->a[i] = nd_to_vect_2(s0vect,col,s0hash,spol);
7157: sugar[i] = SG(spol);
7158: i++;
7159: }
7160: }
7161: mat->row = i;
1.227 noro 7162: if ( DP_Print ) {
7163: fprintf(asir_out,"%dx%d,",mat->row,mat->col); fflush(asir_out);
7164: }
1.220 noro 7165: size = ((col+BLEN-1)/BLEN)*sizeof(unsigned long);
7166: v = CALLOC((col+BLEN-1)/BLEN,sizeof(unsigned long));
7167: for ( rp = rp0, i = 0; rp; rp = NEXT(rp), i++ ) {
7168: rt = (NM_ind_pair)BDY(rp);
7169: bzero(v,size);
7170: rhead = nd_nm_to_vect_2(s0vect,col,s0hash,nd_ps[rt->index],rt->mul,v);
7171: rsugar = SG(nd_ps[rt->index])+TD(DL(rt->mul));
7172: red_by_vect_2(mat,sugar,v,rhead,rsugar);
7173: }
7174:
7175: get_eg(&eg1);
7176: init_eg(&eg_elim1); add_eg(&eg_elim1,&eg0,&eg1);
7177: rank = rref(mat,sugar);
7178:
7179: for ( i = 0, r0 = 0; i < rank; i++ ) {
7180: NEXTNODE(r0,r);
7181: BDY(r) = (pointer)vect_to_ndv_2(mat->a[i],col,s0vect);
7182: SG((NDV)BDY(r)) = sugar[i];
7183: }
7184: if ( r0 ) NEXT(r) = 0;
7185: get_eg(&eg2);
7186: init_eg(&eg_elim2); add_eg(&eg_elim2,&eg1,&eg2);
7187: if ( DP_Print ) {
7188: fprintf(asir_out,"elim1=%fsec,elim2=%fsec\n",
7189: eg_elim1.exectime+eg_elim1.gctime,eg_elim2.exectime+eg_elim2.gctime);
7190: fflush(asir_out);
7191: }
7192: return r0;
7193: }
7194:
7195:
1.133 noro 7196: NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz)
1.63 noro 7197: {
1.157 noro 7198: IndArray *imat;
7199: int nsp,nred,i;
7200: int *rhead;
7201: NODE r0,rp;
7202: ND_pairs sp;
7203: NM_ind_pair *rvect;
1.210 noro 7204: UINT *s;
7205: int *s0hash;
7206:
1.220 noro 7207: if ( m == 2 && nd_rref2 )
7208: return nd_f4_red_2(sp0,s0vect,col,rp0,nz);
7209:
1.198 noro 7210: init_eg(&eg_search);
1.157 noro 7211: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
7212: nred = length(rp0);
1.235 noro 7213: imat = (IndArray *)MALLOC(nred*sizeof(IndArray));
7214: rhead = (int *)MALLOC(col*sizeof(int));
1.157 noro 7215: for ( i = 0; i < col; i++ ) rhead[i] = 0;
7216:
7217: /* construction of index arrays */
1.227 noro 7218: if ( DP_Print ) {
7219: fprintf(stderr,"%dx%d,",nsp+nred,col);
7220: }
1.235 noro 7221: rvect = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair));
7222: s0hash = (int *)MALLOC(col*sizeof(int));
1.210 noro 7223: for ( i = 0, s = s0vect; i < col; i++, s += nd_wpd )
7224: s0hash[i] = ndl_hash_value(s);
1.157 noro 7225: for ( rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) {
7226: rvect[i] = (NM_ind_pair)BDY(rp);
1.235 noro 7227: imat[i] = nm_ind_pair_to_vect_compress(trace,s0vect,col,s0hash,rvect[i]);
1.157 noro 7228: rhead[imat[i]->head] = 1;
7229: }
1.240 ! noro 7230: if ( m > 0 )
1.239 noro 7231: #if defined(__GNUC__)
1.240 ! noro 7232: r0 = nd_f4_red_mod64_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz);
! 7233: #else
! 7234: r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz);
1.239 noro 7235: #endif
7236: else if ( m == -1 )
7237: r0 = nd_f4_red_sf_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz);
1.232 noro 7238: else if ( m == -2 )
1.234 noro 7239: r0 = nd_f4_red_lf_main(m,sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred);
1.157 noro 7240: else
1.237 noro 7241: #if defined(VISUAL)
7242: r0 = nd_f4_red_q_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred);
7243: #else
1.215 noro 7244: r0 = nd_f4_red_gz_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred);
1.237 noro 7245: #endif
1.227 noro 7246: if ( DP_Print ) print_eg("search",&eg_search);
1.157 noro 7247: return r0;
1.106 noro 7248: }
1.74 noro 7249:
1.239 noro 7250: /* for Fp, 2<=p<2^16 */
7251:
1.106 noro 7252: NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
1.133 noro 7253: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz)
1.106 noro 7254: {
1.157 noro 7255: int spcol,sprow,a;
7256: int i,j,k,l,rank;
7257: NODE r0,r;
7258: ND_pairs sp;
7259: ND spol;
7260: int **spmat;
7261: UINT *svect,*v;
7262: int *colstat;
7263: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
7264: int maxrs;
7265: int *spsugar;
7266: ND_pairs *spactive;
7267:
7268: spcol = col-nred;
7269: get_eg(&eg0);
7270: /* elimination (1st step) */
1.235 noro 7271: spmat = (int **)MALLOC(nsp*sizeof(UINT *));
7272: svect = (UINT *)MALLOC(col*sizeof(UINT));
7273: spsugar = (int *)MALLOC(nsp*sizeof(int));
7274: spactive = !nz?0:(ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
1.157 noro 7275: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
7276: nd_sp(m,0,sp,&spol);
7277: if ( !spol ) continue;
7278: nd_to_vect(m,s0vect,col,spol,svect);
7279: if ( m == -1 )
7280: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred);
7281: else
7282: maxrs = ndv_reduce_vect(m,svect,col,imat,rvect,nred);
7283: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
7284: if ( i < col ) {
7285: spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT));
7286: for ( j = k = 0; j < col; j++ )
7287: if ( !rhead[j] ) v[k++] = svect[j];
7288: spsugar[sprow] = MAX(maxrs,SG(spol));
7289: if ( nz )
7290: spactive[sprow] = sp;
7291: sprow++;
7292: }
7293: nd_free(spol);
7294: }
7295: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
7296: if ( DP_Print ) {
7297: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
7298: fflush(asir_out);
7299: }
7300: /* free index arrays */
1.200 noro 7301: for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c);
1.157 noro 7302:
7303: /* elimination (2nd step) */
1.235 noro 7304: colstat = (int *)MALLOC(spcol*sizeof(int));
1.157 noro 7305: if ( m == -1 )
7306: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
7307: else
7308: rank = nd_gauss_elim_mod(spmat,spsugar,spactive,sprow,spcol,m,colstat);
7309: r0 = 0;
7310: for ( i = 0; i < rank; i++ ) {
7311: NEXTNODE(r0,r); BDY(r) =
7312: (pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
7313: SG((NDV)BDY(r)) = spsugar[i];
1.200 noro 7314: GCFREE(spmat[i]);
1.157 noro 7315: }
7316: if ( r0 ) NEXT(r) = 0;
7317:
1.200 noro 7318: for ( ; i < sprow; i++ ) GCFREE(spmat[i]);
1.157 noro 7319: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
7320: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
7321: if ( DP_Print ) {
7322: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
7323: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
7324: nsp,nred,sprow,spcol,rank);
7325: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
7326: }
7327: if ( nz ) {
7328: for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1];
7329: if ( rank > 0 ) {
7330: NEXT(spactive[rank-1]) = 0;
7331: *nz = spactive[0];
7332: } else
7333: *nz = 0;
7334: }
7335: return r0;
1.74 noro 7336: }
7337:
1.239 noro 7338: #if defined(__GNUC__)
7339: /* for Fp, 2^15=<p<2^29 */
7340:
1.240 ! noro 7341: NODE nd_f4_red_mod64_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
1.239 noro 7342: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz)
7343: {
7344: int spcol,sprow,a;
7345: int i,j,k,l,rank;
7346: NODE r0,r;
7347: ND_pairs sp;
7348: ND spol;
1.240 ! noro 7349: U64 **spmat;
! 7350: U64 *svect,*cvect;
! 7351: U64 *v;
1.239 noro 7352: int *colstat;
7353: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
7354: int maxrs;
7355: int *spsugar;
7356: ND_pairs *spactive;
7357:
7358: spcol = col-nred;
7359: get_eg(&eg0);
7360: /* elimination (1st step) */
1.240 ! noro 7361: spmat = (U64 **)MALLOC(nsp*sizeof(U64 *));
! 7362: svect = (U64 *)MALLOC(col*sizeof(U64));
! 7363: cvect = (U64 *)MALLOC(col*sizeof(U64));
1.239 noro 7364: spsugar = (int *)MALLOC(nsp*sizeof(int));
7365: spactive = !nz?0:(ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
7366: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
7367: nd_sp(m,0,sp,&spol);
7368: if ( !spol ) continue;
1.240 ! noro 7369: nd_to_vect64(m,s0vect,col,spol,svect);
! 7370: maxrs = ndv_reduce_vect64(m,svect,cvect,col,imat,rvect,nred);
1.239 noro 7371: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
7372: if ( i < col ) {
1.240 ! noro 7373: spmat[sprow] = v = (U64 *)MALLOC_ATOMIC(spcol*sizeof(U64));
1.239 noro 7374: for ( j = k = 0; j < col; j++ )
7375: if ( !rhead[j] ) v[k++] = (UINT)svect[j];
7376: spsugar[sprow] = MAX(maxrs,SG(spol));
7377: if ( nz )
7378: spactive[sprow] = sp;
7379: sprow++;
7380: }
7381: nd_free(spol);
7382: }
7383: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
7384: if ( DP_Print ) {
7385: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
7386: fflush(asir_out);
7387: }
7388: /* free index arrays */
7389: for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c);
7390:
7391: /* elimination (2nd step) */
7392: colstat = (int *)MALLOC(spcol*sizeof(int));
1.240 ! noro 7393: rank = nd_gauss_elim_mod64(spmat,spsugar,spactive,sprow,spcol,m,colstat);
1.239 noro 7394: r0 = 0;
7395: for ( i = 0; i < rank; i++ ) {
7396: NEXTNODE(r0,r); BDY(r) =
1.240 ! noro 7397: (pointer)vect64_to_ndv(spmat[i],spcol,col,rhead,s0vect);
1.239 noro 7398: SG((NDV)BDY(r)) = spsugar[i];
7399: GCFREE(spmat[i]);
7400: }
7401: if ( r0 ) NEXT(r) = 0;
7402:
7403: for ( ; i < sprow; i++ ) GCFREE(spmat[i]);
7404: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
7405: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
7406: if ( DP_Print ) {
7407: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
7408: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
7409: nsp,nred,sprow,spcol,rank);
7410: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
7411: }
7412: if ( nz ) {
7413: for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1];
7414: if ( rank > 0 ) {
7415: NEXT(spactive[rank-1]) = 0;
7416: *nz = spactive[0];
7417: } else
7418: *nz = 0;
7419: }
7420: return r0;
7421: }
7422: #endif
7423:
7424: /* for small finite fields */
7425:
7426: NODE nd_f4_red_sf_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
7427: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz)
7428: {
7429: int spcol,sprow,a;
7430: int i,j,k,l,rank;
7431: NODE r0,r;
7432: ND_pairs sp;
7433: ND spol;
7434: int **spmat;
7435: UINT *svect,*v;
7436: int *colstat;
7437: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
7438: int maxrs;
7439: int *spsugar;
7440: ND_pairs *spactive;
7441:
7442: spcol = col-nred;
7443: get_eg(&eg0);
7444: /* elimination (1st step) */
7445: spmat = (int **)MALLOC(nsp*sizeof(UINT *));
7446: svect = (UINT *)MALLOC(col*sizeof(UINT));
7447: spsugar = (int *)MALLOC(nsp*sizeof(int));
7448: spactive = !nz?0:(ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
7449: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
7450: nd_sp(m,0,sp,&spol);
7451: if ( !spol ) continue;
7452: nd_to_vect(m,s0vect,col,spol,svect);
7453: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred);
7454: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
7455: if ( i < col ) {
7456: spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT));
7457: for ( j = k = 0; j < col; j++ )
7458: if ( !rhead[j] ) v[k++] = svect[j];
7459: spsugar[sprow] = MAX(maxrs,SG(spol));
7460: if ( nz )
7461: spactive[sprow] = sp;
7462: sprow++;
7463: }
7464: nd_free(spol);
7465: }
7466: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
7467: if ( DP_Print ) {
7468: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
7469: fflush(asir_out);
7470: }
7471: /* free index arrays */
7472: for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c);
7473:
7474: /* elimination (2nd step) */
7475: colstat = (int *)MALLOC(spcol*sizeof(int));
7476: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
7477: r0 = 0;
7478: for ( i = 0; i < rank; i++ ) {
7479: NEXTNODE(r0,r); BDY(r) =
7480: (pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
7481: SG((NDV)BDY(r)) = spsugar[i];
7482: GCFREE(spmat[i]);
7483: }
7484: if ( r0 ) NEXT(r) = 0;
7485:
7486: for ( ; i < sprow; i++ ) GCFREE(spmat[i]);
7487: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
7488: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
7489: if ( DP_Print ) {
7490: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
7491: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
7492: nsp,nred,sprow,spcol,rank);
7493: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
7494: }
7495: if ( nz ) {
7496: for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1];
7497: if ( rank > 0 ) {
7498: NEXT(spactive[rank-1]) = 0;
7499: *nz = spactive[0];
7500: } else
7501: *nz = 0;
7502: }
7503: return r0;
7504: }
7505:
1.234 noro 7506: NODE nd_f4_red_lf_main(int m,ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
1.232 noro 7507: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
7508: {
7509: int spcol,sprow,a;
7510: int i,j,k,l,rank;
7511: NODE r0,r;
7512: ND_pairs sp;
7513: ND spol;
7514: mpz_t **spmat;
7515: mpz_t *svect,*v;
7516: int *colstat;
7517: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
7518: int maxrs;
7519: int *spsugar;
7520: pointer *w;
7521:
7522: spcol = col-nred;
7523: get_eg(&eg0);
7524: /* elimination (1st step) */
1.235 noro 7525: spmat = (mpz_t **)MALLOC(nsp*sizeof(mpz_t *));
7526: svect = (mpz_t *)MALLOC(col*sizeof(mpz_t));
7527: spsugar = (int *)MALLOC(nsp*sizeof(int));
1.232 noro 7528: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
1.234 noro 7529: nd_sp(m,trace,sp,&spol);
1.232 noro 7530: if ( !spol ) continue;
7531: nd_to_vect_lf(s0vect,col,spol,svect);
1.234 noro 7532: maxrs = ndv_reduce_vect_lf(svect,trace,col,imat,rvect,nred);
1.232 noro 7533: for ( i = 0; i < col; i++ ) if ( mpz_sgn(svect[i]) ) break;
7534: if ( i < col ) {
7535: spmat[sprow] = v = (mpz_t *)MALLOC(spcol*sizeof(mpz_t));
7536: for ( j = k = 0; j < col; j++ )
7537: if ( !rhead[j] ) v[k++][0] = svect[j][0];
7538: spsugar[sprow] = MAX(maxrs,SG(spol));
7539: sprow++;
7540: }
7541: /* nd_free(spol); */
7542: }
7543: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
7544: if ( DP_Print ) {
7545: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
7546: fflush(asir_out);
7547: }
7548: /* free index arrays */
7549: /* for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c); */
7550:
7551: /* elimination (2nd step) */
1.235 noro 7552: colstat = (int *)MALLOC(spcol*sizeof(int));
1.232 noro 7553: rank = nd_gauss_elim_lf(spmat,spsugar,sprow,spcol,colstat);
1.235 noro 7554: w = (pointer *)MALLOC(rank*sizeof(pointer));
1.232 noro 7555: for ( i = 0; i < rank; i++ ) {
7556: #if 0
7557: w[rank-i-1] = (pointer)vect_to_ndv_lf(spmat[i],spcol,col,rhead,s0vect);
7558: SG((NDV)w[rank-i-1]) = spsugar[i];
7559: #else
7560: w[i] = (pointer)vect_to_ndv_lf(spmat[i],spcol,col,rhead,s0vect);
7561: SG((NDV)w[i]) = spsugar[i];
7562: #endif
7563: /* GCFREE(spmat[i]); */
7564:
7565: }
7566: #if 0
7567: qsort(w,rank,sizeof(NDV),
7568: (int (*)(const void *,const void *))ndv_compare);
7569: #endif
7570: r0 = 0;
7571: for ( i = 0; i < rank; i++ ) {
7572: NEXTNODE(r0,r); BDY(r) = w[i];
7573: }
7574: if ( r0 ) NEXT(r) = 0;
7575:
7576: /* for ( ; i < sprow; i++ ) GCFREE(spmat[i]); */
7577: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
7578: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
7579: if ( DP_Print ) {
7580: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
7581: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
7582: nsp,nred,sprow,spcol,rank);
7583: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
7584: }
7585: return r0;
7586: }
7587:
1.133 noro 7588: #if 1
7589: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
1.107 noro 7590: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
7591: {
1.157 noro 7592: int spcol,sprow,a;
7593: int i,j,k,l,rank;
7594: NODE r0,r;
7595: ND_pairs sp;
7596: ND spol;
7597: Q **spmat;
7598: Q *svect,*v;
7599: int *colstat;
7600: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
7601: int maxrs;
7602: int *spsugar;
7603: pointer *w;
7604:
7605: spcol = col-nred;
7606: get_eg(&eg0);
7607: /* elimination (1st step) */
1.235 noro 7608: spmat = (Q **)MALLOC(nsp*sizeof(Q *));
7609: svect = (Q *)MALLOC(col*sizeof(Q));
7610: spsugar = (int *)MALLOC(nsp*sizeof(int));
1.157 noro 7611: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
7612: nd_sp(0,trace,sp,&spol);
7613: if ( !spol ) continue;
7614: nd_to_vect_q(s0vect,col,spol,svect);
7615: maxrs = ndv_reduce_vect_q(svect,trace,col,imat,rvect,nred);
7616: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
7617: if ( i < col ) {
7618: spmat[sprow] = v = (Q *)MALLOC(spcol*sizeof(Q));
7619: for ( j = k = 0; j < col; j++ )
7620: if ( !rhead[j] ) v[k++] = svect[j];
7621: spsugar[sprow] = MAX(maxrs,SG(spol));
7622: sprow++;
7623: }
7624: /* nd_free(spol); */
7625: }
7626: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
7627: if ( DP_Print ) {
7628: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
7629: fflush(asir_out);
7630: }
7631: /* free index arrays */
1.200 noro 7632: /* for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c); */
1.157 noro 7633:
7634: /* elimination (2nd step) */
1.235 noro 7635: colstat = (int *)MALLOC(spcol*sizeof(int));
1.157 noro 7636: rank = nd_gauss_elim_q(spmat,spsugar,sprow,spcol,colstat);
1.235 noro 7637: w = (pointer *)MALLOC(rank*sizeof(pointer));
1.157 noro 7638: for ( i = 0; i < rank; i++ ) {
1.213 noro 7639: #if 0
1.157 noro 7640: w[rank-i-1] = (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect);
7641: SG((NDV)w[rank-i-1]) = spsugar[i];
1.213 noro 7642: #else
7643: w[i] = (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect);
7644: SG((NDV)w[i]) = spsugar[i];
7645: #endif
1.200 noro 7646: /* GCFREE(spmat[i]); */
1.157 noro 7647: }
1.138 noro 7648: #if 0
1.157 noro 7649: qsort(w,rank,sizeof(NDV),
7650: (int (*)(const void *,const void *))ndv_compare);
1.137 noro 7651: #endif
1.157 noro 7652: r0 = 0;
7653: for ( i = 0; i < rank; i++ ) {
7654: NEXTNODE(r0,r); BDY(r) = w[i];
7655: }
7656: if ( r0 ) NEXT(r) = 0;
7657:
1.200 noro 7658: /* for ( ; i < sprow; i++ ) GCFREE(spmat[i]); */
1.157 noro 7659: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
7660: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
7661: if ( DP_Print ) {
7662: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
7663: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
7664: nsp,nred,sprow,spcol,rank);
7665: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
7666: }
7667: return r0;
1.107 noro 7668: }
1.215 noro 7669:
7670: NODE nd_f4_red_gz_main(ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
7671: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
7672: {
7673: int spcol,sprow,a;
7674: int i,j,k,l,rank;
7675: NODE r0,r;
7676: ND_pairs sp;
7677: ND spol;
7678: GZ **spmat;
7679: GZ *svect,*v;
7680: int *colstat;
7681: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
7682: int maxrs;
7683: int *spsugar;
7684: pointer *w;
7685:
7686: spcol = col-nred;
7687: get_eg(&eg0);
7688: /* elimination (1st step) */
1.235 noro 7689: spmat = (GZ **)MALLOC(nsp*sizeof(GZ *));
7690: svect = (GZ *)MALLOC(col*sizeof(GZ));
7691: spsugar = (int *)MALLOC(nsp*sizeof(int));
1.215 noro 7692: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
7693: nd_sp(0,trace,sp,&spol);
7694: if ( !spol ) continue;
7695: spol = ndtondgz(spol);
7696: nd_to_vect_q(s0vect,col,spol,(Q *)svect);
7697: maxrs = ndv_reduce_vect_gz(svect,trace,col,imat,rvect,nred);
7698: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
7699: if ( i < col ) {
7700: spmat[sprow] = v = (GZ *)MALLOC(spcol*sizeof(GZ));
7701: for ( j = k = 0; j < col; j++ )
7702: if ( !rhead[j] ) v[k++] = svect[j];
7703: spsugar[sprow] = MAX(maxrs,SG(spol));
7704: sprow++;
7705: }
7706: /* nd_free(spol); */
7707: }
7708: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
7709: if ( DP_Print ) {
7710: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
7711: fflush(asir_out);
7712: }
7713: /* free index arrays */
7714: /* for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c); */
7715:
7716: /* elimination (2nd step) */
1.235 noro 7717: colstat = (int *)MALLOC(spcol*sizeof(int));
1.215 noro 7718: rank = nd_gauss_elim_gz(spmat,spsugar,sprow,spcol,colstat);
1.235 noro 7719: w = (pointer *)MALLOC(rank*sizeof(pointer));
1.215 noro 7720: for ( i = 0; i < rank; i++ ) {
7721: #if 0
7722: w[rank-i-1] = (pointer)vect_to_ndv_gz(spmat[i],spcol,col,rhead,s0vect);
7723: w[rank-i-1] = ndvgztondv(w[rank-i-1]);
7724: SG((NDV)w[rank-i-1]) = spsugar[i];
7725: #else
1.232 noro 7726: w[i] = (pointer)vect_to_ndv_gz(spmat[i],spcol,col,rhead,s0vect);
1.215 noro 7727: w[i] = ndvgztondv(w[i]);
7728: SG((NDV)w[i]) = spsugar[i];
7729: #endif
7730: /* GCFREE(spmat[i]); */
7731:
7732: }
7733: #if 0
7734: qsort(w,rank,sizeof(NDV),
7735: (int (*)(const void *,const void *))ndv_compare);
7736: #endif
7737: r0 = 0;
7738: for ( i = 0; i < rank; i++ ) {
7739: NEXTNODE(r0,r); BDY(r) = w[i];
7740: }
7741: if ( r0 ) NEXT(r) = 0;
7742:
7743: /* for ( ; i < sprow; i++ ) GCFREE(spmat[i]); */
7744: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
7745: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
7746: if ( DP_Print ) {
7747: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
7748: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
7749: nsp,nred,sprow,spcol,rank);
7750: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
7751: }
7752: return r0;
7753: }
1.129 noro 7754: #else
7755: void printm(Q **mat,int row,int col)
7756: {
1.157 noro 7757: int i,j;
7758: printf("[");
7759: for ( i = 0; i < row; i++ ) {
7760: for ( j = 0; j < col; j++ ) {
7761: printexpr(CO,mat[i][j]); printf(" ");
7762: }
7763: printf("]\n");
7764: }
1.129 noro 7765: }
7766:
7767: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vect,int col,
7768: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
7769: {
1.157 noro 7770: int row,a;
7771: int i,j,rank;
7772: NODE r0,r;
7773: ND_pairs sp;
7774: ND spol;
7775: Q **mat;
7776: int *colstat;
7777: int *sugar;
7778:
7779: row = nsp+nred;
7780: /* make the matrix */
1.235 noro 7781: mat = (Q **)MALLOC(row*sizeof(Q *));
7782: sugar = (int *)MALLOC(row*sizeof(int));
1.157 noro 7783: for ( row = a = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
7784: nd_sp(0,0,sp,&spol);
7785: if ( !spol ) continue;
7786: mat[row] = (Q *)MALLOC(col*sizeof(Q));
7787: nd_to_vect_q(s0vect,col,spol,mat[row]);
7788: sugar[row] = SG(spol);
7789: row++;
7790: }
7791: for ( i = 0; i < nred; i++, row++ ) {
7792: mat[row] = nm_ind_pair_to_vect(0,s0vect,col,rvect[i]);
7793: sugar[row] = rvect[i]->sugar;
7794: }
7795: /* elimination */
1.235 noro 7796: colstat = (int *)MALLOC(col*sizeof(int));
1.157 noro 7797: rank = nd_gauss_elim_q(mat,sugar,row,col,colstat);
7798: r0 = 0;
7799: for ( i = 0; i < rank; i++ ) {
7800: for ( j = 0; j < col; j++ ) if ( mat[i][j] ) break;
7801: if ( j == col ) error("nd_f4_red_q_main : cannot happen");
7802: if ( rhead[j] ) continue;
7803: NEXTNODE(r0,r); BDY(r) =
7804: (pointer)plain_vect_to_ndv_q(mat[i],col,s0vect);
7805: SG((NDV)BDY(r)) = sugar[i];
7806: }
7807: if ( r0 ) NEXT(r) = 0;
7808: printf("\n");
7809: return r0;
1.129 noro 7810: }
7811: #endif
1.107 noro 7812:
1.74 noro 7813: FILE *nd_write,*nd_read;
7814:
7815: void nd_send_int(int a) {
1.157 noro 7816: write_int(nd_write,&a);
1.74 noro 7817: }
7818:
7819: void nd_send_intarray(int *p,int len) {
1.157 noro 7820: write_intarray(nd_write,p,len);
1.74 noro 7821: }
7822:
7823: int nd_recv_int() {
1.157 noro 7824: int a;
1.74 noro 7825:
1.157 noro 7826: read_int(nd_read,&a);
7827: return a;
1.74 noro 7828: }
7829:
7830: void nd_recv_intarray(int *p,int len) {
1.157 noro 7831: read_intarray(nd_read,p,len);
1.74 noro 7832: }
7833:
7834: void nd_send_ndv(NDV p) {
1.157 noro 7835: int len,i;
7836: NMV m;
1.74 noro 7837:
1.157 noro 7838: if ( !p ) nd_send_int(0);
7839: else {
7840: len = LEN(p);
7841: nd_send_int(len);
7842: m = BDY(p);
7843: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
7844: nd_send_int(CM(m));
7845: nd_send_intarray(DL(m),nd_wpd);
7846: }
7847: }
1.74 noro 7848: }
7849:
7850: void nd_send_nd(ND p) {
1.157 noro 7851: int len,i;
7852: NM m;
1.74 noro 7853:
1.157 noro 7854: if ( !p ) nd_send_int(0);
7855: else {
7856: len = LEN(p);
7857: nd_send_int(len);
7858: m = BDY(p);
7859: for ( i = 0; i < len; i++, m = NEXT(m) ) {
7860: nd_send_int(CM(m));
7861: nd_send_intarray(DL(m),nd_wpd);
7862: }
7863: }
1.74 noro 7864: }
1.65 noro 7865:
1.74 noro 7866: NDV nd_recv_ndv()
7867: {
1.157 noro 7868: int len,i;
7869: NMV m,m0;
7870: NDV r;
7871:
7872: len = nd_recv_int();
7873: if ( !len ) return 0;
7874: else {
1.200 noro 7875: m0 = m = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len);
1.103 noro 7876: #if 0
1.157 noro 7877: ndv_alloc += len*nmv_adv;
1.103 noro 7878: #endif
1.157 noro 7879: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
7880: CM(m) = nd_recv_int();
7881: nd_recv_intarray(DL(m),nd_wpd);
7882: }
7883: MKNDV(nd_nvar,m0,len,r);
7884: return r;
7885: }
1.74 noro 7886: }
1.65 noro 7887:
1.113 noro 7888: int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int col,int *colstat)
1.107 noro 7889: {
1.176 noro 7890: int i,j,t,c,rank,inv;
1.157 noro 7891: int *ci,*ri;
7892: Q dn;
7893: MAT m,nm;
7894:
7895: NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0;
7896: rank = generic_gauss_elim(m,&nm,&dn,&ri,&ci);
7897: for ( i = 0; i < row; i++ )
7898: for ( j = 0; j < col; j++ )
7899: mat0[i][j] = 0;
7900: c = col-rank;
7901: for ( i = 0; i < rank; i++ ) {
7902: mat0[i][ri[i]] = dn;
7903: for ( j = 0; j < c; j++ )
7904: mat0[i][ci[j]] = (Q)BDY(nm)[i][j];
7905: }
7906: return rank;
1.76 noro 7907: }
7908:
1.215 noro 7909: int nd_gauss_elim_gz(GZ **mat0,int *sugar,int row,int col,int *colstat)
7910: {
7911: int i,j,t,c,rank,inv;
7912: int *ci,*ri;
1.216 noro 7913: GZ dn;
1.215 noro 7914: MAT m,nm;
7915:
7916: NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0;
1.216 noro 7917: rank = gz_generic_gauss_elim(m,&nm,&dn,&ri,&ci);
1.215 noro 7918: for ( i = 0; i < row; i++ )
7919: for ( j = 0; j < col; j++ )
7920: mat0[i][j] = 0;
7921: c = col-rank;
7922: for ( i = 0; i < rank; i++ ) {
1.216 noro 7923: mat0[i][ri[i]] = dn;
1.215 noro 7924: for ( j = 0; j < c; j++ )
7925: mat0[i][ci[j]] = (GZ)BDY(nm)[i][j];
7926: }
7927: return rank;
7928: }
7929:
1.133 noro 7930: int nd_gauss_elim_mod(int **mat0,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat)
1.76 noro 7931: {
1.157 noro 7932: int i,j,k,l,inv,a,rank,s;
7933: unsigned int *t,*pivot,*pk;
7934: unsigned int **mat;
7935: ND_pairs pair;
7936:
7937: mat = (unsigned int **)mat0;
7938: for ( rank = 0, j = 0; j < col; j++ ) {
7939: for ( i = rank; i < row; i++ )
7940: mat[i][j] %= md;
7941: for ( i = rank; i < row; i++ )
7942: if ( mat[i][j] )
7943: break;
7944: if ( i == row ) {
7945: colstat[j] = 0;
7946: continue;
7947: } else
7948: colstat[j] = 1;
7949: if ( i != rank ) {
7950: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
7951: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
7952: if ( spactive ) {
7953: pair = spactive[i]; spactive[i] = spactive[rank];
7954: spactive[rank] = pair;
7955: }
7956: }
7957: pivot = mat[rank];
7958: s = sugar[rank];
7959: inv = invm(pivot[j],md);
7960: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
7961: if ( *pk ) {
7962: if ( *pk >= (unsigned int)md )
7963: *pk %= md;
7964: DMAR(*pk,inv,0,md,*pk)
7965: }
7966: for ( i = rank+1; i < row; i++ ) {
7967: t = mat[i];
7968: if ( a = t[j] ) {
7969: sugar[i] = MAX(sugar[i],s);
7970: red_by_vect(md,t+j,pivot+j,md-a,col-j);
7971: }
7972: }
7973: rank++;
7974: }
7975: for ( j = col-1, l = rank-1; j >= 0; j-- )
7976: if ( colstat[j] ) {
7977: pivot = mat[l];
7978: s = sugar[l];
7979: for ( i = 0; i < l; i++ ) {
7980: t = mat[i];
7981: t[j] %= md;
7982: if ( a = t[j] ) {
7983: sugar[i] = MAX(sugar[i],s);
7984: red_by_vect(md,t+j,pivot+j,md-a,col-j);
7985: }
7986: }
7987: l--;
7988: }
7989: for ( j = 0, l = 0; l < rank; j++ )
7990: if ( colstat[j] ) {
7991: t = mat[l];
7992: for ( k = j; k < col; k++ )
7993: if ( t[k] >= (unsigned int)md )
7994: t[k] %= md;
7995: l++;
7996: }
7997: return rank;
1.76 noro 7998: }
7999:
1.239 noro 8000: #if defined(__GNUC__)
1.240 ! noro 8001:
! 8002: int nd_gauss_elim_mod64(U64 **mat,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat)
1.239 noro 8003: {
1.240 ! noro 8004: int i,j,k,l,rank,s;
! 8005: U64 inv;
! 8006: U64 a;
! 8007: UINT c;
! 8008: U64 *t,*pivot,*pk;
! 8009: UINT *ck;
! 8010: UINT **cmat;
! 8011: UINT *ct;
! 8012: ND_pairs pair;
! 8013:
! 8014: cmat = (UINT **)MALLOC(row*sizeof(UINT *));
! 8015: for ( i = 0; i < row; i++ ) {
! 8016: cmat[i] = MALLOC_ATOMIC(col*sizeof(UINT));
! 8017: bzero(cmat[i],col*sizeof(UINT));
! 8018: }
1.239 noro 8019:
1.240 ! noro 8020: for ( rank = 0, j = 0; j < col; j++ ) {
! 8021: for ( i = rank; i < row; i++ ) {
! 8022: a = mat[i][j]; c = cmat[i][j];
! 8023: MOD128(a,c,md);
! 8024: mat[i][j] = a; cmat[i][j] = 0;
! 8025: }
! 8026: for ( i = rank; i < row; i++ )
! 8027: if ( mat[i][j] )
! 8028: break;
! 8029: if ( i == row ) {
! 8030: colstat[j] = 0;
! 8031: continue;
! 8032: } else
! 8033: colstat[j] = 1;
! 8034: if ( i != rank ) {
! 8035: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
! 8036: ct = cmat[i]; cmat[i] = cmat[rank]; cmat[rank] = ct;
! 8037: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
! 8038: if ( spactive ) {
! 8039: pair = spactive[i]; spactive[i] = spactive[rank];
! 8040: spactive[rank] = pair;
! 8041: }
! 8042: }
! 8043: /* column j is normalized */
! 8044: s = sugar[rank];
! 8045: inv = invm((UINT)mat[rank][j],md);
! 8046: /* normalize pivot row */
! 8047: for ( k = j, pk = mat[rank]+j, ck = cmat[rank]+j; k < col; k++, pk++, ck++ ) {
! 8048: a = *pk; c = *ck; MOD128(a,c,md); *pk = (a*inv)%md; *ck = 0;
! 8049: }
! 8050: for ( i = rank+1; i < row; i++ ) {
! 8051: if ( a = mat[i][j] ) {
! 8052: sugar[i] = MAX(sugar[i],s);
! 8053: red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[rank]+j,(int)(md-a),col-j);
! 8054: }
1.239 noro 8055: }
1.240 ! noro 8056: rank++;
! 8057: }
! 8058: for ( j = col-1, l = rank-1; j >= 0; j-- )
! 8059: if ( colstat[j] ) {
! 8060: for ( k = j, pk = mat[l]+j, ck = cmat[l]+j; k < col; k++, pk++, ck++ ) {
! 8061: a = *pk; c = *ck; MOD128(a,c,md); *pk = a; *ck = 0;
! 8062: }
! 8063: s = sugar[l];
! 8064: for ( i = 0; i < l; i++ ) {
! 8065: a = mat[i][j]; c = cmat[i][j]; MOD128(a,c,md); mat[i][j] = a; cmat[i][j] = 0;
! 8066: if ( a ) {
! 8067: sugar[i] = MAX(sugar[i],s);
! 8068: red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[l]+j,(int)(md-a),col-j);
! 8069: }
! 8070: }
! 8071: l--;
! 8072: }
! 8073: for ( i = 0; i < row; i++ ) GCFREE(cmat[i]);
! 8074: GCFREE(cmat);
! 8075: return rank;
1.239 noro 8076: }
8077: #endif
8078:
1.76 noro 8079: int nd_gauss_elim_sf(int **mat0,int *sugar,int row,int col,int md,int *colstat)
8080: {
1.157 noro 8081: int i,j,k,l,inv,a,rank,s;
8082: unsigned int *t,*pivot,*pk;
8083: unsigned int **mat;
8084:
8085: mat = (unsigned int **)mat0;
8086: for ( rank = 0, j = 0; j < col; j++ ) {
8087: for ( i = rank; i < row; i++ )
8088: if ( mat[i][j] )
8089: break;
8090: if ( i == row ) {
8091: colstat[j] = 0;
8092: continue;
8093: } else
8094: colstat[j] = 1;
8095: if ( i != rank ) {
8096: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
8097: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
8098: }
8099: pivot = mat[rank];
8100: s = sugar[rank];
8101: inv = _invsf(pivot[j]);
8102: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
8103: if ( *pk )
8104: *pk = _mulsf(*pk,inv);
8105: for ( i = rank+1; i < row; i++ ) {
8106: t = mat[i];
8107: if ( a = t[j] ) {
8108: sugar[i] = MAX(sugar[i],s);
8109: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
8110: }
8111: }
8112: rank++;
8113: }
8114: for ( j = col-1, l = rank-1; j >= 0; j-- )
8115: if ( colstat[j] ) {
8116: pivot = mat[l];
8117: s = sugar[l];
8118: for ( i = 0; i < l; i++ ) {
8119: t = mat[i];
8120: if ( a = t[j] ) {
8121: sugar[i] = MAX(sugar[i],s);
8122: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
8123: }
8124: }
8125: l--;
8126: }
8127: return rank;
1.77 noro 8128: }
8129:
8130: int ndv_ishomo(NDV p)
8131: {
1.157 noro 8132: NMV m;
8133: int len,h;
1.77 noro 8134:
1.157 noro 8135: if ( !p ) return 1;
8136: len = LEN(p);
8137: m = BDY(p);
8138: h = TD(DL(m));
8139: NMV_ADV(m);
8140: for ( len--; len; len--, NMV_ADV(m) )
8141: if ( TD(DL(m)) != h ) return 0;
8142: return 1;
1.77 noro 8143: }
8144:
8145: void ndv_save(NDV p,int index)
8146: {
1.157 noro 8147: FILE *s;
8148: char name[BUFSIZ];
8149: short id;
8150: int nv,sugar,len,n,i,td,e,j;
8151: NMV m;
8152: unsigned int *dl;
8153: int mpos;
8154:
8155: sprintf(name,"%s/%d",Demand,index);
8156: s = fopen(name,"w");
8157: savevl(s,0);
8158: if ( !p ) {
8159: saveobj(s,0);
8160: return;
8161: }
8162: id = O_DP;
8163: nv = NV(p);
8164: sugar = SG(p);
8165: len = LEN(p);
8166: write_short(s,&id); write_int(s,&nv); write_int(s,&sugar);
8167: write_int(s,&len);
8168:
8169: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
8170: saveobj(s,(Obj)CQ(m));
8171: dl = DL(m);
8172: td = TD(dl);
8173: write_int(s,&td);
8174: for ( j = 0; j < nv; j++ ) {
8175: e = GET_EXP(dl,j);
8176: write_int(s,&e);
8177: }
8178: if ( nd_module ) {
8179: mpos = MPOS(dl); write_int(s,&mpos);
8180: }
8181: }
8182: fclose(s);
1.77 noro 8183: }
8184:
1.206 noro 8185: void nd_save_mod(ND p,int index)
8186: {
8187: FILE *s;
8188: char name[BUFSIZ];
8189: int nv,sugar,len,c;
8190: NM m;
8191:
8192: sprintf(name,"%s/%d",Demand,index);
8193: s = fopen(name,"w");
8194: if ( !p ) {
8195: len = 0;
8196: write_int(s,&len);
8197: fclose(s);
8198: return;
8199: }
8200: nv = NV(p);
8201: sugar = SG(p);
8202: len = LEN(p);
8203: write_int(s,&nv); write_int(s,&sugar); write_int(s,&len);
8204: for ( m = BDY(p); m; m = NEXT(m) ) {
8205: c = CM(m); write_int(s,&c);
8206: write_intarray(s,DL(m),nd_wpd);
8207: }
8208: fclose(s);
8209: }
8210:
1.77 noro 8211: NDV ndv_load(int index)
8212: {
1.157 noro 8213: FILE *s;
8214: char name[BUFSIZ];
8215: short id;
8216: int nv,sugar,len,n,i,td,e,j;
8217: NDV d;
8218: NMV m0,m;
8219: unsigned int *dl;
8220: Obj obj;
8221: int mpos;
8222:
8223: sprintf(name,"%s/%d",Demand,index);
8224: s = fopen(name,"r");
8225: if ( !s ) return 0;
8226:
8227: skipvl(s);
8228: read_short(s,&id);
8229: if ( !id ) return 0;
8230: read_int(s,&nv);
8231: read_int(s,&sugar);
8232: read_int(s,&len);
8233:
8234: m0 = m = MALLOC(len*nmv_adv);
8235: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
8236: loadobj(s,&obj); CQ(m) = (Q)obj;
8237: dl = DL(m);
8238: ndl_zero(dl);
8239: read_int(s,&td); TD(dl) = td;
8240: for ( j = 0; j < nv; j++ ) {
8241: read_int(s,&e);
8242: PUT_EXP(dl,j,e);
8243: }
8244: if ( nd_module ) {
8245: read_int(s,&mpos); MPOS(dl) = mpos;
8246: }
8247: if ( nd_blockmask ) ndl_weight_mask(dl);
8248: }
8249: fclose(s);
8250: MKNDV(nv,m0,len,d);
8251: SG(d) = sugar;
8252: return d;
1.99 noro 8253: }
8254:
1.206 noro 8255: ND nd_load_mod(int index)
8256: {
8257: FILE *s;
8258: char name[BUFSIZ];
8259: int nv,sugar,len,i,c;
8260: ND d;
8261: NM m0,m;
8262:
8263: sprintf(name,"%s/%d",Demand,index);
8264: s = fopen(name,"r");
8265: /* if the file does not exist, it means p[index]=0 */
8266: if ( !s ) return 0;
8267:
8268: read_int(s,&nv);
8269: if ( !nv ) { fclose(s); return 0; }
8270:
8271: read_int(s,&sugar);
8272: read_int(s,&len);
8273: for ( m0 = 0, i = 0; i < len; i++ ) {
8274: NEXTNM(m0,m);
8275: read_int(s,&c); CM(m) = c;
8276: read_intarray(s,DL(m),nd_wpd);
8277: }
8278: NEXT(m) = 0;
8279: MKND(nv,m0,len,d);
8280: SG(d) = sugar;
8281: fclose(s);
8282: return d;
8283: }
8284:
1.102 noro 8285: void nd_det(int mod,MAT f,P *rp)
1.99 noro 8286: {
1.157 noro 8287: VL fv,tv;
8288: int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a;
8289: pointer **m;
8290: Q mone;
8291: P **w;
8292: P mp,r;
8293: NDV **dm;
8294: NDV *t,*mi,*mj;
8295: NDV d,s,mij,mjj;
8296: ND u;
8297: NMV nmv;
8298: UINT *bound;
8299: PGeoBucket bucket;
8300: struct order_spec *ord;
8301: Q dq,dt,ds;
8302: N gn,qn,dn0,nm,dn;
8303:
8304: create_order_spec(0,0,&ord);
8305: nd_init_ord(ord);
8306: get_vars((Obj)f,&fv);
8307: if ( f->row != f->col )
8308: error("nd_det : non-square matrix");
8309: n = f->row;
8310: m = f->body;
8311: for ( nvar = 0, tv = fv; tv; tv = NEXT(tv), nvar++ );
8312:
8313: if ( !nvar ) {
8314: if ( !mod )
8315: detp(CO,(P **)m,n,rp);
8316: else {
8317: w = (P **)almat_pointer(n,n);
8318: for ( i = 0; i < n; i++ )
8319: for ( j = 0; j < n; j++ )
8320: ptomp(mod,(P)m[i][j],&w[i][j]);
8321: detmp(CO,mod,w,n,&mp);
8322: mptop(mp,rp);
8323: }
8324: return;
8325: }
8326:
8327: if ( !mod ) {
8328: w = (P **)almat_pointer(n,n);
8329: dq = ONE;
8330: for ( i = 0; i < n; i++ ) {
8331: dn0 = ONEN;
8332: for ( j = 0; j < n; j++ ) {
8333: if ( !m[i][j] ) continue;
8334: lgp(m[i][j],&nm,&dn);
8335: gcdn(dn0,dn,&gn); divsn(dn0,gn,&qn); muln(qn,dn,&dn0);
8336: }
8337: if ( !UNIN(dn0) ) {
8338: NTOQ(dn0,1,ds);
8339: for ( j = 0; j < n; j++ )
8340: mulp(CO,(P)m[i][j],(P)ds,&w[i][j]);
8341: mulq(dq,ds,&dt); dq = dt;
8342: } else
8343: for ( j = 0; j < n; j++ )
8344: w[i][j] = (P)m[i][j];
8345: }
8346: m = (pointer **)w;
8347: }
8348:
1.178 noro 8349: for ( i = 0, max = 1; i < n; i++ )
1.157 noro 8350: for ( j = 0; j < n; j++ )
8351: for ( tv = fv; tv; tv = NEXT(tv) ) {
8352: e = getdeg(tv->v,(P)m[i][j]);
8353: max = MAX(e,max);
8354: }
8355: nd_setup_parameters(nvar,max);
8356: dm = (NDV **)almat_pointer(n,n);
1.178 noro 8357: for ( i = 0, max = 1; i < n; i++ )
1.157 noro 8358: for ( j = 0; j < n; j++ ) {
8359: dm[i][j] = ptondv(CO,fv,m[i][j]);
8360: if ( mod ) ndv_mod(mod,dm[i][j]);
8361: if ( dm[i][j] && !LEN(dm[i][j]) ) dm[i][j] = 0;
8362: }
8363: d = ptondv(CO,fv,(P)ONE);
8364: if ( mod ) ndv_mod(mod,d);
8365: chsgnq(ONE,&mone);
8366: for ( j = 0, sgn = 1; j < n; j++ ) {
1.222 fujimoto 8367: if ( DP_Print ) {
8368: fprintf(stderr,".",j);
8369: }
1.157 noro 8370: for ( i = j; i < n && !dm[i][j]; i++ );
8371: if ( i == n ) {
8372: *rp = 0;
8373: return;
8374: }
8375: k0 = i; l0 = j; len0 = LEN(dm[k0][l0]);
8376: for ( k = j; k < n; k++ )
8377: for ( l = j; l < n; l++ )
8378: if ( dm[k][l] && LEN(dm[k][l]) < len0 ) {
8379: k0 = k; l0 = l; len0 = LEN(dm[k][l]);
8380: }
8381: if ( k0 != j ) {
8382: t = dm[j]; dm[j] = dm[k0]; dm[k0] = t;
8383: sgn = -sgn;
8384: }
8385: if ( l0 != j ) {
8386: for ( k = j; k < n; k++ ) {
8387: s = dm[k][j]; dm[k][j] = dm[k][l0]; dm[k][l0] = s;
8388: }
8389: sgn = -sgn;
8390: }
8391: bound = nd_det_compute_bound(dm,n,j);
8392: for ( k = 0; k < nd_nvar; k++ )
8393: if ( bound[k]*2 > nd_mask0 ) break;
8394: if ( k < nd_nvar )
8395: nd_det_reconstruct(dm,n,j,d);
8396:
8397: for ( i = j+1, mj = dm[j], mjj = mj[j]; i < n; i++ ) {
8398: /* if ( DP_Print ) fprintf(stderr," i=%d\n ",i); */
8399: mi = dm[i]; mij = mi[j];
8400: if ( mod )
8401: ndv_mul_c(mod,mij,mod-1);
8402: else
8403: ndv_mul_c_q(mij,mone);
8404: for ( k = j+1; k < n; k++ ) {
8405: /* if ( DP_Print ) fprintf(stderr,"k=%d ",k); */
8406: bucket = create_pbucket();
8407: if ( mi[k] ) {
8408: nmv = BDY(mjj); len = LEN(mjj);
8409: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
8410: u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d)));
8411: add_pbucket(mod,bucket,u);
8412: }
8413: }
8414: if ( mj[k] && mij ) {
8415: nmv = BDY(mij); len = LEN(mij);
8416: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
8417: u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d)));
8418: add_pbucket(mod,bucket,u);
8419: }
8420: }
8421: u = nd_quo(mod,bucket,d);
8422: mi[k] = ndtondv(mod,u);
8423: }
8424: /* if ( DP_Print ) fprintf(stderr,"\n",k); */
8425: }
8426: d = mjj;
8427: }
1.222 fujimoto 8428: if ( DP_Print ) {
8429: fprintf(stderr,"\n",k);
8430: }
1.157 noro 8431: if ( sgn < 0 )
8432: if ( mod )
8433: ndv_mul_c(mod,d,mod-1);
8434: else
8435: ndv_mul_c_q(d,mone);
8436: r = ndvtop(mod,CO,fv,d);
8437: if ( !mod && !UNIQ(dq) )
8438: divsp(CO,r,(P)dq,rp);
8439: else
8440: *rp = r;
1.99 noro 8441: }
8442:
1.102 noro 8443: ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d)
1.99 noro 8444: {
1.157 noro 8445: NM mr,mr0;
8446: NM tnm;
8447: NMV m;
8448: UINT *d0,*dt,*dm;
8449: int c,n,td,i,c1,c2,len;
8450: Q q;
8451: ND r;
8452:
8453: if ( !p ) return 0;
8454: else {
8455: n = NV(p); m = BDY(p); len = LEN(p);
8456: d0 = DL(m0);
8457: td = TD(d);
8458: mr0 = 0;
8459: NEWNM(tnm);
8460: if ( mod ) {
8461: c = CM(m0);
8462: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
8463: ndl_add(DL(m),d0,DL(tnm));
8464: if ( ndl_reducible(DL(tnm),d) ) {
8465: NEXTNM(mr0,mr);
8466: c1 = CM(m); DMAR(c1,c,0,mod,c2); CM(mr) = c2;
8467: ndl_copy(DL(tnm),DL(mr));
8468: }
8469: }
8470: } else {
8471: q = CQ(m0);
8472: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
8473: ndl_add(DL(m),d0,DL(tnm));
8474: if ( ndl_reducible(DL(tnm),d) ) {
8475: NEXTNM(mr0,mr);
8476: mulq(CQ(m),q,&CQ(mr));
8477: ndl_copy(DL(tnm),DL(mr));
8478: }
8479: }
8480: }
8481: if ( !mr0 )
8482: return 0;
8483: else {
8484: NEXT(mr) = 0;
8485: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
8486: MKND(NV(p),mr0,len,r);
8487: SG(r) = SG(p) + TD(d0);
8488: return r;
8489: }
8490: }
1.114 noro 8491: }
8492:
8493: void nd_det_reconstruct(NDV **dm,int n,int j,NDV d)
8494: {
1.157 noro 8495: int i,obpe,oadv,h,k,l;
8496: static NM prev_nm_free_list;
8497: EPOS oepos;
8498:
8499: obpe = nd_bpe;
8500: oadv = nmv_adv;
8501: oepos = nd_epos;
8502: if ( obpe < 2 ) nd_bpe = 2;
8503: else if ( obpe < 3 ) nd_bpe = 3;
8504: else if ( obpe < 4 ) nd_bpe = 4;
8505: else if ( obpe < 5 ) nd_bpe = 5;
8506: else if ( obpe < 6 ) nd_bpe = 6;
8507: else if ( obpe < 8 ) nd_bpe = 8;
8508: else if ( obpe < 10 ) nd_bpe = 10;
8509: else if ( obpe < 16 ) nd_bpe = 16;
8510: else if ( obpe < 32 ) nd_bpe = 32;
8511: else error("nd_det_reconstruct : exponent too large");
8512:
8513: nd_setup_parameters(nd_nvar,0);
8514: prev_nm_free_list = _nm_free_list;
8515: _nm_free_list = 0;
8516: for ( k = j; k < n; k++ )
8517: for (l = j; l < n; l++ )
8518: ndv_realloc(dm[k][l],obpe,oadv,oepos);
8519: ndv_realloc(d,obpe,oadv,oepos);
8520: prev_nm_free_list = 0;
1.114 noro 8521: #if 0
1.157 noro 8522: GC_gcollect();
1.114 noro 8523: #endif
8524: }
8525:
1.153 noro 8526: /* returns a UINT array containing degree bounds */
8527:
1.114 noro 8528: UINT *nd_det_compute_bound(NDV **dm,int n,int j)
8529: {
1.157 noro 8530: UINT *d0,*d1,*d,*t,*r;
8531: int k,l,i;
1.114 noro 8532:
1.157 noro 8533: d0 = (UINT *)MALLOC(nd_nvar*sizeof(UINT));
8534: for ( k = 0; k < nd_nvar; k++ ) d0[k] = 0;
8535: for ( k = j; k < n; k++ )
8536: for ( l = j; l < n; l++ )
8537: if ( dm[k][l] ) {
8538: d = ndv_compute_bound(dm[k][l]);
8539: for ( i = 0; i < nd_nvar; i++ )
8540: d0[i] = MAX(d0[i],d[i]);
8541: }
8542: return d0;
1.117 noro 8543: }
8544:
8545: DL nd_separate_d(UINT *d,UINT *trans)
8546: {
1.157 noro 8547: int n,td,i,e,j;
8548: DL a;
1.117 noro 8549:
1.157 noro 8550: ndl_zero(trans);
8551: td = 0;
8552: for ( i = 0; i < nd_ntrans; i++ ) {
8553: e = GET_EXP(d,i);
8554: PUT_EXP(trans,i,e);
8555: td += MUL_WEIGHT(e,i);
8556: }
8557: if ( nd_ntrans+nd_nalg < nd_nvar ) {
8558: /* homogenized */
8559: i = nd_nvar-1;
8560: e = GET_EXP(d,i);
8561: PUT_EXP(trans,i,e);
8562: td += MUL_WEIGHT(e,i);
8563: }
8564: TD(trans) = td;
8565: if ( nd_blockmask) ndl_weight_mask(trans);
8566: NEWDL(a,nd_nalg);
8567: td = 0;
8568: for ( i = 0; i < nd_nalg; i++ ) {
8569: j = nd_ntrans+i;
8570: e = GET_EXP(d,j);
8571: a->d[i] = e;
8572: td += e;
8573: }
8574: a->td = td;
8575: return a;
1.117 noro 8576: }
8577:
1.118 noro 8578: int nd_monic(int mod,ND *p)
1.117 noro 8579: {
1.157 noro 8580: UINT *trans,*t;
8581: DL alg;
8582: MP mp0,mp;
8583: NM m,m0,m1,ma0,ma,mb,mr0,mr;
8584: ND r;
8585: DL dl;
8586: DP nm;
8587: NDV ndv;
8588: DAlg inv,cd;
8589: ND s,c;
8590: Q l,mul;
8591: N ln;
8592: int n,ntrans,i,e,td,is_lc,len;
8593: NumberField nf;
8594: struct oEGT eg0,eg1;
8595:
8596: if ( !(nf = get_numberfield()) )
8597: error("nd_monic : current_numberfield is not set");
8598:
8599: /* Q coef -> DAlg coef */
8600: NEWNM(ma0); ma = ma0;
8601: m = BDY(*p);
8602: is_lc = 1;
8603: while ( 1 ) {
8604: NEWMP(mp0); mp = mp0;
1.238 noro 8605: mp->c = (Obj)CQ(m);
1.157 noro 8606: mp->dl = nd_separate_d(DL(m),DL(ma));
8607: NEWNM(mb);
8608: for ( m = NEXT(m); m; m = NEXT(m) ) {
8609: alg = nd_separate_d(DL(m),DL(mb));
8610: if ( !ndl_equal(DL(ma),DL(mb)) )
8611: break;
1.238 noro 8612: NEXTMP(mp0,mp); mp->c = (Obj)CQ(m); mp->dl = alg;
1.157 noro 8613: }
8614: NEXT(mp) = 0;
8615: MKDP(nd_nalg,mp0,nm);
8616: MKDAlg(nm,ONE,cd);
8617: if ( is_lc == 1 ) {
8618: /* if the lc is a rational number, we have nothing to do */
8619: if ( !mp0->dl->td )
8620: return 1;
8621:
8622: get_eg(&eg0);
8623: invdalg(cd,&inv);
8624: get_eg(&eg1); add_eg(&eg_invdalg,&eg0,&eg1);
8625: /* check the validity of inv */
8626: if ( mod && !rem(NM(inv->dn),mod) )
8627: return 0;
8628: CA(ma) = nf->one;
8629: is_lc = 0;
8630: ln = ONEN;
8631: } else {
8632: muldalg(cd,inv,&CA(ma));
8633: lcmn(ln,NM(CA(ma)->dn),&ln);
8634: }
8635: if ( m ) {
8636: NEXT(ma) = mb; ma = mb;
8637: } else {
8638: NEXT(ma) = 0;
8639: break;
8640: }
8641: }
8642: /* l = lcm(denoms) */
8643: NTOQ(ln,1,l);
8644: for ( mr0 = 0, m = ma0; m; m = NEXT(m) ) {
8645: divq(l,CA(m)->dn,&mul);
8646: for ( mp = BDY(CA(m)->nm); mp; mp = NEXT(mp) ) {
8647: NEXTNM(mr0,mr);
8648: mulq((Q)mp->c,mul,&CQ(mr));
8649: dl = mp->dl;
8650: td = TD(DL(m));
8651: ndl_copy(DL(m),DL(mr));
8652: for ( i = 0; i < nd_nalg; i++ ) {
8653: e = dl->d[i];
8654: PUT_EXP(DL(mr),i+nd_ntrans,e);
8655: td += MUL_WEIGHT(e,i+nd_ntrans);
8656: }
1.163 noro 8657: if ( nd_module ) MPOS(DL(mr)) = MPOS(DL(m));
1.157 noro 8658: TD(DL(mr)) = td;
8659: if ( nd_blockmask) ndl_weight_mask(DL(mr));
8660: }
8661: }
8662: NEXT(mr) = 0;
8663: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
8664: MKND(NV(*p),mr0,len,r);
8665: /* XXX */
8666: SG(r) = SG(*p);
8667: nd_free(*p);
8668: *p = r;
8669: return 1;
1.59 noro 8670: }
1.167 noro 8671:
8672: NODE reverse_node(NODE n)
8673: {
8674: NODE t,t1;
8675:
8676: for ( t = 0; n; n = NEXT(n) ) {
8677: MKNODE(t1,BDY(n),t); t = t1;
8678: }
8679: return t;
8680: }
8681:
8682: P ndc_div(int mod,union oNDC a,union oNDC b)
8683: {
8684: union oNDC c;
8685: int inv,t;
8686:
8687: if ( mod == -1 ) c.m = _mulsf(a.m,_invsf(b.m));
1.232 noro 8688: else if ( mod == -2 ) divlf(a.z,b.z,&c.z);
1.167 noro 8689: else if ( mod ) {
8690: inv = invm(b.m,mod);
8691: DMAR(a.m,inv,0,mod,t); c.m = t;
8692: } else if ( nd_vc )
8693: divsp(nd_vc,a.p,b.p,&c.p);
8694: else
8695: divq(a.z,b.z,&c.z);
8696: return ndctop(mod,c);
8697: }
8698:
8699: P ndctop(int mod,union oNDC c)
8700: {
8701: Q q;
8702: int e;
8703: GFS gfs;
8704:
8705: if ( mod == -1 ) {
8706: e = IFTOF(c.m); MKGFS(e,gfs); return (P)gfs;
1.232 noro 8707: } else if ( mod > 0 ) {
1.167 noro 8708: STOQ(c.m,q); return (P)q;
8709: } else
8710: return (P)c.p;
8711: }
8712:
8713: /* [0,0,0,cont] = p -> p/cont */
8714:
8715: void finalize_tracelist(int i,P cont)
8716: {
8717: LIST l;
8718: NODE node;
8719: Q iq;
8720:
8721: if ( !UNIQ(cont) ) {
1.196 noro 8722: node = mknode(4,NULLP,NULLP,NULLP,cont);
1.167 noro 8723: MKLIST(l,node); MKNODE(node,l,nd_tracelist);
8724: nd_tracelist = node;
8725: }
8726: STOQ(i,iq);
8727: nd_tracelist = reverse_node(nd_tracelist);
8728: MKLIST(l,nd_tracelist);
8729: node = mknode(2,iq,l); MKLIST(l,node);
8730: MKNODE(node,l,nd_alltracelist); MKLIST(l,node);
8731: nd_alltracelist = node; nd_tracelist = 0;
8732: }
8733:
8734: void conv_ilist(int demand,int trace,NODE g,int **indp)
8735: {
8736: int n,i,j;
8737: int *ind;
8738: NODE t;
8739:
8740: n = length(g);
8741: ind = (int *)MALLOC(n*sizeof(int));
8742: for ( i = 0, t = g; i < n; i++, t = NEXT(t) ) {
8743: j = (long)BDY(t); ind[i] = j;
8744: BDY(t) = (pointer)(demand?ndv_load(j):(trace?nd_ps_trace[j]:nd_ps[j]));
8745: }
8746: if ( indp ) *indp = ind;
8747: }
1.172 noro 8748:
8749: void parse_nd_option(NODE opt)
8750: {
1.187 noro 8751: NODE t,p,u;
1.231 noro 8752: int i,s,n;
1.172 noro 8753: char *key;
8754: Obj value;
8755:
1.187 noro 8756: nd_gentrace = 0; nd_gensyz = 0; nd_nora = 0; nd_gbblock = 0;
1.208 noro 8757: nd_newelim = 0; nd_intersect = 0; nd_nzlist = 0;
1.209 noro 8758: nd_splist = 0; nd_check_splist = 0;
1.231 noro 8759: nd_sugarweight = 0;
1.234 noro 8760: nd_f4red =0;
8761: nd_rank0 = 0;
1.172 noro 8762: for ( t = opt; t; t = NEXT(t) ) {
8763: p = BDY((LIST)BDY(t));
8764: key = BDY((STRING)BDY(p));
8765: value = (Obj)BDY(NEXT(p));
8766: if ( !strcmp(key,"gentrace") )
8767: nd_gentrace = value?1:0;
8768: else if ( !strcmp(key,"gensyz") )
8769: nd_gensyz = value?1:0;
1.173 noro 8770: else if ( !strcmp(key,"nora") )
8771: nd_nora = value?1:0;
1.187 noro 8772: else if ( !strcmp(key,"gbblock") ) {
1.233 noro 8773: if ( value && OID(value) == O_LIST ) {
8774: u = BDY((LIST)value);
8775: nd_gbblock = MALLOC((2*length(u)+1)*sizeof(int));
8776: for ( i = 0; u; u = NEXT(u) ) {
8777: p = BDY((LIST)BDY(u));
8778: s = nd_gbblock[i++] = QTOS((Q)BDY(p));
8779: nd_gbblock[i++] = s+QTOS((Q)BDY(NEXT(p)))-1;
8780: }
8781: nd_gbblock[i] = -1;
8782: } else
8783: nd_gbblock = 0;
1.192 noro 8784: } else if ( !strcmp(key,"newelim") )
8785: nd_newelim = value?1:0;
1.195 noro 8786: else if ( !strcmp(key,"intersect") )
8787: nd_intersect = value?1:0;
1.234 noro 8788: else if ( !strcmp(key,"lf") )
8789: nd_lf = value?1:0;
1.208 noro 8790: else if ( !strcmp(key,"trace") ) {
8791: u = BDY((LIST)value);
8792: nd_nzlist = BDY((LIST)ARG2(u));
8793: nd_bpe = QTOS((Q)ARG3(u));
1.234 noro 8794: } else if ( !strcmp(key,"f4red") ) {
8795: nd_f4red = QTOS((Q)value);
8796: } else if ( !strcmp(key,"rank0") ) {
8797: nd_rank0 = value?1:0;
8798: } else if ( !strcmp(key,"splist") ) {
1.209 noro 8799: nd_splist = value?1:0;
1.234 noro 8800: } else if ( !strcmp(key,"check_splist") ) {
1.209 noro 8801: nd_check_splist = BDY((LIST)value);
1.231 noro 8802: } else if ( !strcmp(key,"sugarweight") ) {
8803: u = BDY((LIST)value);
8804: n = length(u);
8805: nd_sugarweight = MALLOC(n*sizeof(int));
8806: for ( i = 0; i < n; i++, u = NEXT(u) )
8807: nd_sugarweight[i] = QTOS((Q)BDY(u));
1.208 noro 8808: }
1.172 noro 8809: }
8810: }
1.204 noro 8811:
8812: ND mdptond(DP d);
8813: ND nd_mul_nm(int mod,NM m0,ND p);
1.207 noro 8814: ND *btog(NODE ti,ND **p,int nb,int mod);
8815: ND btog_one(NODE ti,ND *p,int nb,int mod);
1.204 noro 8816: MAT nd_btog(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,MAT *rp);
1.205 noro 8817: VECT nd_btog_one(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,int pos,MAT *rp);
1.204 noro 8818:
8819: /* d:monomial */
8820: ND mdptond(DP d)
8821: {
8822: NM m;
8823: ND r;
8824:
8825: if ( OID(d) == 1 )
8826: r = ptond(CO,CO,(P)d);
8827: else {
8828: NEWNM(m);
8829: dltondl(NV(d),BDY(d)->dl,DL(m));
8830: CQ(m) = (Q)BDY(d)->c;
8831: NEXT(m) = 0;
8832: MKND(NV(d),m,1,r);
8833: }
8834: return r;
8835: }
8836:
8837: ND nd_mul_nm(int mod,NM m0,ND p)
8838: {
8839: UINT *d0;
8840: int c0,c1,c;
8841: NM tm,mr,mr0;
8842: ND r;
8843:
8844: if ( !p ) return 0;
8845: d0 = DL(m0);
8846: c0 = CM(m0);
8847: mr0 = 0;
8848: for ( tm = BDY(p); tm; tm = NEXT(tm) ) {
8849: NEXTNM(mr0,mr);
8850: c = CM(tm); DMAR(c0,c,0,mod,c1); CM(mr) = c1;
8851: ndl_add(d0,DL(tm),DL(mr));
8852: }
8853: NEXT(mr) = 0;
8854: MKND(NV(p),mr0,LEN(p),r);
8855: return r;
8856: }
8857:
1.207 noro 8858: ND *btog(NODE ti,ND **p,int nb,int mod)
1.204 noro 8859: {
8860: PGeoBucket *r;
8861: int i,ci;
8862: NODE t,s;
8863: ND m,tp;
8864: ND *pi,*rd;
8865: P c;
8866:
8867: r = (PGeoBucket *)MALLOC(nb*sizeof(PGeoBucket));
8868: for ( i = 0; i < nb; i++ )
8869: r[i] = create_pbucket();
8870: for ( t = ti; t; t = NEXT(t) ) {
8871: s = BDY((LIST)BDY(t));
8872: if ( ARG0(s) ) {
8873: m = mdptond((DP)ARG2(s));
8874: ptomp(mod,(P)HCQ(m),&c);
8875: if ( ci = ((MQ)c)->cont ) {
8876: HCM(m) = ci;
8877: pi = p[QTOS((Q)ARG1(s))];
8878: for ( i = 0; i < nb; i++ ) {
8879: tp = nd_mul_nm(mod,BDY(m),pi[i]);
8880: add_pbucket(mod,r[i],tp);
8881: }
8882: }
8883: ci = 1;
8884: } else {
8885: ptomp(mod,(P)ARG3(s),&c); ci = ((MQ)c)->cont;
8886: ci = invm(ci,mod);
8887: }
8888: }
8889: rd = (ND *)MALLOC(nb*sizeof(ND));
8890: for ( i = 0; i < nb; i++ )
8891: rd[i] = normalize_pbucket(mod,r[i]);
8892: if ( ci != 1 )
8893: for ( i = 0; i < nb; i++ ) nd_mul_c(mod,rd[i],ci);
8894: return rd;
8895: }
8896:
1.207 noro 8897: ND btog_one(NODE ti,ND *p,int nb,int mod)
1.205 noro 8898: {
8899: PGeoBucket r;
1.206 noro 8900: int i,ci,j;
1.205 noro 8901: NODE t,s;
8902: ND m,tp;
8903: ND pi,rd;
8904: P c;
8905:
8906: r = create_pbucket();
8907: for ( t = ti; t; t = NEXT(t) ) {
8908: s = BDY((LIST)BDY(t));
8909: if ( ARG0(s) ) {
8910: m = mdptond((DP)ARG2(s));
8911: ptomp(mod,(P)HCQ(m),&c);
8912: if ( ci = ((MQ)c)->cont ) {
8913: HCM(m) = ci;
1.206 noro 8914: pi = p[j=QTOS((Q)ARG1(s))];
8915: if ( !pi ) {
8916: pi = nd_load_mod(j);
8917: tp = nd_mul_nm(mod,BDY(m),pi);
8918: nd_free(pi);
8919: add_pbucket(mod,r,tp);
8920: } else {
8921: tp = nd_mul_nm(mod,BDY(m),pi);
8922: add_pbucket(mod,r,tp);
8923: }
1.205 noro 8924: }
8925: ci = 1;
8926: } else {
8927: ptomp(mod,(P)ARG3(s),&c); ci = ((MQ)c)->cont;
8928: ci = invm(ci,mod);
8929: }
8930: }
8931: rd = normalize_pbucket(mod,r);
1.206 noro 8932: free_pbucket(r);
1.205 noro 8933: if ( ci != 1 ) nd_mul_c(mod,rd,ci);
8934: return rd;
8935: }
1.204 noro 8936:
8937: MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *ord,LIST tlist,MAT *rp)
8938: {
8939: int i,j,n,m,nb,pi0,pi1,nvar;
8940: VL fv,tv,vv;
8941: NODE permtrace,perm,trace,intred,ind,t,pi,ti;
8942: ND **p;
8943: ND *c;
8944: ND u;
8945: P inv;
8946: MAT mat;
8947:
8948: parse_nd_option(current_option);
8949: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
8950: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
8951: switch ( ord->id ) {
8952: case 1:
8953: if ( ord->nv != nvar )
8954: error("nd_check : invalid order specification");
8955: break;
8956: default:
8957: break;
8958: }
8959: nd_init_ord(ord);
8960: #if 0
8961: nd_bpe = QTOS((Q)ARG7(BDY(tlist)));
8962: #else
8963: nd_bpe = 32;
8964: #endif
8965: nd_setup_parameters(nvar,0);
8966: permtrace = BDY((LIST)ARG2(BDY(tlist)));
8967: intred = BDY((LIST)ARG3(BDY(tlist)));
8968: ind = BDY((LIST)ARG4(BDY(tlist)));
8969: perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace);
8970: for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) {
8971: j = QTOS((Q)BDY(BDY((LIST)BDY(t))));
8972: if ( j > i ) i = j;
8973: }
8974: n = i+1;
8975: nb = length(BDY(f));
8976: p = (ND **)MALLOC(n*sizeof(ND *));
8977: for ( t = perm, i = 0; t; t = NEXT(t), i++ ) {
8978: pi = BDY((LIST)BDY(t));
8979: pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi));
8980: p[pi0] = c = (ND *)MALLOC(nb*sizeof(ND));
8981: ptomp(mod,(P)ARG2(pi),&inv);
1.218 noro 8982: ((MQ)inv)->cont = invm(((MQ)inv)->cont,mod);
1.204 noro 8983: u = ptond(CO,vv,(P)ONE);
8984: HCM(u) = ((MQ)inv)->cont;
8985: c[pi1] = u;
8986: }
8987: for ( t = trace,i=0; t; t = NEXT(t), i++ ) {
8988: printf("%d ",i); fflush(stdout);
8989: ti = BDY((LIST)BDY(t));
1.207 noro 8990: p[j=QTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod);
1.204 noro 8991: }
8992: for ( t = intred, i=0; t; t = NEXT(t), i++ ) {
8993: printf("%d ",i); fflush(stdout);
8994: ti = BDY((LIST)BDY(t));
1.207 noro 8995: p[j=QTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod);
1.204 noro 8996: }
8997: m = length(ind);
8998: MKMAT(mat,nb,m);
8999: for ( j = 0, t = ind; j < m; j++, t = NEXT(t) )
9000: for ( i = 0, c = p[QTOS((Q)BDY(t))]; i < nb; i++ )
9001: BDY(mat)[i][j] = ndtodp(mod,c[i]);
9002: return mat;
9003: }
9004:
1.205 noro 9005: VECT nd_btog_one(LIST f,LIST v,int mod,struct order_spec *ord,
9006: LIST tlist,int pos,MAT *rp)
9007: {
9008: int i,j,n,m,nb,pi0,pi1,nvar;
9009: VL fv,tv,vv;
9010: NODE permtrace,perm,trace,intred,ind,t,pi,ti;
9011: ND *p;
9012: ND *c;
9013: ND u;
9014: P inv;
9015: VECT vect;
9016:
9017: parse_nd_option(current_option);
9018: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
9019: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
9020: switch ( ord->id ) {
9021: case 1:
9022: if ( ord->nv != nvar )
9023: error("nd_check : invalid order specification");
9024: break;
9025: default:
9026: break;
9027: }
9028: nd_init_ord(ord);
9029: #if 0
9030: nd_bpe = QTOS((Q)ARG7(BDY(tlist)));
9031: #else
9032: nd_bpe = 32;
9033: #endif
9034: nd_setup_parameters(nvar,0);
9035: permtrace = BDY((LIST)ARG2(BDY(tlist)));
9036: intred = BDY((LIST)ARG3(BDY(tlist)));
9037: ind = BDY((LIST)ARG4(BDY(tlist)));
9038: perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace);
9039: for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) {
9040: j = QTOS((Q)BDY(BDY((LIST)BDY(t))));
9041: if ( j > i ) i = j;
9042: }
9043: n = i+1;
9044: nb = length(BDY(f));
9045: p = (ND *)MALLOC(n*sizeof(ND *));
9046: for ( t = perm, i = 0; t; t = NEXT(t), i++ ) {
9047: pi = BDY((LIST)BDY(t));
9048: pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi));
9049: if ( pi1 == pos ) {
1.218 noro 9050: ptomp(mod,(P)ARG2(pi),&inv);
9051: ((MQ)inv)->cont = invm(((MQ)inv)->cont,mod);
1.205 noro 9052: u = ptond(CO,vv,(P)ONE);
9053: HCM(u) = ((MQ)inv)->cont;
9054: p[pi0] = u;
9055: }
9056: }
9057: for ( t = trace,i=0; t; t = NEXT(t), i++ ) {
9058: printf("%d ",i); fflush(stdout);
9059: ti = BDY((LIST)BDY(t));
1.207 noro 9060: p[j=QTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod);
1.206 noro 9061: if ( Demand ) {
9062: nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0;
9063: }
1.205 noro 9064: }
9065: for ( t = intred, i=0; t; t = NEXT(t), i++ ) {
9066: printf("%d ",i); fflush(stdout);
9067: ti = BDY((LIST)BDY(t));
1.207 noro 9068: p[j=QTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod);
1.206 noro 9069: if ( Demand ) {
9070: nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0;
9071: }
1.205 noro 9072: }
9073: m = length(ind);
9074: MKVECT(vect,m);
1.206 noro 9075: for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) {
9076: u = p[QTOS((Q)BDY(t))];
9077: if ( !u ) {
9078: u = nd_load_mod(QTOS((Q)BDY(t)));
9079: BDY(vect)[j] = ndtodp(mod,u);
9080: nd_free(u);
9081: } else
9082: BDY(vect)[j] = ndtodp(mod,u);
9083: }
1.205 noro 9084: return vect;
9085: }
1.232 noro 9086:
9087: void ndv_print_lf(NDV p)
9088: {
9089: NMV m;
9090: int i,len;
9091:
9092: if ( !p ) printf("0\n");
9093: else {
9094: len = LEN(p);
9095: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
9096: printf("+");
9097: mpz_out_str(asir_out,10,BDY(CZ(m)));
9098: printf("*");
9099: ndl_print(DL(m));
9100: }
9101: printf("\n");
9102: }
9103: }
1.234 noro 9104:
9105: void nd_f4_lf_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp)
9106: {
9107: VL tv,fv,vv,vc,av;
9108: NODE fd,fd0,in0,in,r,r0,t,s,cand,alist;
9109: int m,nocheck,nvar,mindex,e,max;
9110: NDV c;
9111: NMV a;
9112: P p,zp;
9113: Q dmy;
9114: EPOS oepos;
9115: int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg,mrank,trank,ompos;
9116: Alg alpha,dp;
9117: P poly;
9118: LIST f1,f2,zpl;
9119: Obj obj;
9120: NumberField nf;
9121: struct order_spec *ord1;
9122: struct oEGT eg_check,eg0,eg1;
9123: NODE tr,tl1,tl2,tl3,tl4;
9124: LIST l1,l2,l3,l4,l5;
9125: int *perm;
9126: int j,ret;
9127: Q jq,bpe;
9128:
9129: nd_module = 0;
9130: parse_nd_option(current_option);
9131: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
9132: if ( nd_vc )
9133: error("nd_f4_lf_trace : computation over a rational function field is not implemented");
9134: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
9135: switch ( ord->id ) {
9136: case 1:
9137: if ( ord->nv != nvar )
9138: error("nd_f4_lf_trace : invalid order specification");
9139: break;
9140: default:
9141: break;
9142: }
9143:
9144: nd_ntrans = nvar;
9145: nd_nalg = 0;
9146:
9147: nocheck = 0;
9148: mindex = 0;
9149:
1.235 noro 9150: /* do not use on-demand load/save */
9151: nd_demand = 0;
1.234 noro 9152: m = trace > 1 ? trace : get_lprime(mindex);
9153: nd_init_ord(ord);
9154: mrank = 0;
9155: for ( t = BDY(f), max = 1; t; t = NEXT(t) )
9156: for ( tv = vv; tv; tv = NEXT(tv) ) {
9157: if ( nd_module ) {
9158: s = BDY((LIST)BDY(t));
9159: trank = length(s);
9160: mrank = MAX(mrank,trank);
9161: for ( ; s; s = NEXT(s) ) {
9162: e = getdeg(tv->v,(P)BDY(s));
9163: max = MAX(e,max);
9164: }
9165: } else {
9166: e = getdeg(tv->v,(P)BDY(t));
9167: max = MAX(e,max);
9168: }
9169: }
9170: nd_setup_parameters(nvar,max);
9171: obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; ompos = nd_mpos;
9172: ishomo = 1;
9173: /* XXX */
9174: for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
9175: if ( nd_module ) {
9176: c = (pointer)pltondv(CO,vv,(LIST)BDY(t));
9177: } else {
9178: c = (pointer)ptondv(CO,vv,(P)BDY(t));
9179: }
9180: if ( ishomo )
9181: ishomo = ishomo && ndv_ishomo(c);
9182: if ( c ) {
9183: NEXTNODE(in0,in); BDY(in) = (pointer)c;
9184: NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c);
9185: }
9186: }
9187: if ( in0 ) NEXT(in) = 0;
9188: if ( fd0 ) NEXT(fd) = 0;
9189: if ( !ishomo && homo ) {
9190: for ( t = in0, wmax = max; t; t = NEXT(t) ) {
9191: c = (NDV)BDY(t); len = LEN(c);
9192: for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) )
9193: wmax = MAX(TD(DL(a)),wmax);
9194: }
9195: homogenize_order(ord,nvar,&ord1);
9196: nd_init_ord(ord1);
9197: nd_setup_parameters(nvar+1,wmax);
9198: for ( t = fd0; t; t = NEXT(t) )
9199: ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos);
9200: }
9201: if ( MaxDeg > 0 ) nocheck = 1;
1.235 noro 9202: ret = ndv_setup(-2,m,fd0,nd_gbblock?1:0,0);
9203: if ( ret )
9204: cand = nd_f4_lf_trace_main(m,&perm);
9205: if ( !ret || !cand ) {
9206: *rp = 0; return;
9207: }
9208: if ( !ishomo && homo ) {
9209: /* dehomogenization */
9210: for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord);
9211: nd_init_ord(ord);
9212: nd_setup_parameters(nvar,0);
1.234 noro 9213: }
1.235 noro 9214: cand = ndv_reducebase(cand,perm);
9215: cand = ndv_reduceall(-2,cand);
9216: cbpe = nd_bpe;
9217: get_eg(&eg0);
9218: if ( ret = ndv_check_membership(-2,in0,obpe,oadv,oepos,cand) ) {
9219: /* gbcheck : cand is a GB of Id(cand) ? */
9220: ret = nd_f4(-2,0,0);
9221: }
9222: if ( !ret ) {
9223: /* failure */
9224: *rp = 0; return;
9225: }
1.234 noro 9226: get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1);
9227: if ( DP_Print )
9228: fprintf(asir_out,"check=%fsec\n",eg_check.exectime+eg_check.gctime);
9229: /* dp->p */
9230: nd_bpe = cbpe;
9231: nd_setup_parameters(nd_nvar,0);
9232: for ( r = cand; r; r = NEXT(r) ) {
9233: if ( nd_module ) BDY(r) = ndvtopl(-2,CO,vv,BDY(r),mrank);
9234: else BDY(r) = (pointer)ndvtop(-2,CO,vv,BDY(r));
9235: }
9236: MKLIST(*rp,cand);
9237: }
9238:
9239: NODE nd_f4_lf_trace_main(int m,int **indp)
9240: {
9241: int i,nh,stat,index;
9242: NODE r,rm,g;
9243: ND_pairs d,l,l0,t;
9244: ND spol,red;
9245: NDV nf,redv,nfqv,nfv;
9246: NM s0,s;
9247: NODE rp0,srp0,nflist,nflist_lf;
9248: int nsp,nred,col,rank,len,k,j,a;
9249: UINT c;
9250: UINT **spmat;
9251: UINT *s0vect,*svect,*p,*v;
9252: int *colstat;
9253: IndArray *imat;
9254: int *rhead;
9255: int spcol,sprow;
9256: int sugar;
9257: PGeoBucket bucket;
9258: struct oEGT eg0,eg1,eg_f4;
9259:
9260: g = 0; d = 0;
9261: for ( i = 0; i < nd_psn; i++ ) {
9262: d = update_pairs(d,g,i,0);
9263: g = update_base(g,i);
9264: }
9265: while ( d ) {
9266: get_eg(&eg0);
9267: l = nd_minsugarp(d,&d);
9268: sugar = SG(l);
9269: if ( MaxDeg > 0 && sugar > MaxDeg ) break;
9270: bucket = create_pbucket();
9271: stat = nd_sp_f4(m,0,l,bucket);
9272: if ( !stat ) {
9273: for ( t = l; NEXT(t); t = NEXT(t) );
9274: NEXT(t) = d; d = l;
9275: d = nd_reconstruct(1,d);
9276: continue;
9277: }
9278: if ( bucket->m < 0 ) continue;
9279: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
9280: if ( !col ) {
9281: for ( t = l; NEXT(t); t = NEXT(t) );
9282: NEXT(t) = d; d = l;
9283: d = nd_reconstruct(1,d);
9284: continue;
9285: }
9286: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
9287: if ( DP_Print )
9288: fprintf(asir_out,"sugar=%d,symb=%fsec,",
9289: sugar,eg_f4.exectime+eg_f4.gctime);
9290: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0);
9291: if ( !l0 ) continue;
9292: l = l0;
9293:
9294: /* over LF */
9295: bucket = create_pbucket();
9296: stat = nd_sp_f4(-2,1,l,bucket);
9297: if ( !stat ) {
9298: for ( t = l; NEXT(t); t = NEXT(t) );
9299: NEXT(t) = d; d = l;
9300: d = nd_reconstruct(1,d);
9301: continue;
9302: }
9303: if ( bucket->m < 0 ) continue;
9304: col = nd_symbolic_preproc(bucket,1,&s0vect,&rp0);
9305: if ( !col ) {
9306: for ( t = l; NEXT(t); t = NEXT(t) );
9307: NEXT(t) = d; d = l;
9308: d = nd_reconstruct(1,d);
9309: continue;
9310: }
9311: nflist_lf = nd_f4_red(-2,l,1,s0vect,col,rp0,0);
9312: /* adding new bases */
9313: for ( rm = nflist, r = nflist_lf; r && rm; rm = NEXT(rm), r = NEXT(r) ) {
9314: nfv = (NDV)BDY(rm);
9315: nfqv = (NDV)BDY(r);
9316: if ( DL_COMPARE(HDL(nfv),HDL(nfqv)) ) return 0;
9317: ndv_removecont(m,nfv);
9318: ndv_removecont(-2,nfqv);
9319: nh = ndv_newps(-2,nfv,nfqv,1);
9320: d = update_pairs(d,g,nh,0);
9321: g = update_base(g,nh);
9322: }
9323: if ( r || rm ) return 0;
9324: }
9325: conv_ilist(nd_demand,1,g,indp);
9326: return g;
9327: }
9328:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>