Annotation of OpenXM_contrib2/asir2000/engine/nd.c, Revision 1.239
1.239 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.238 2017/08/31 02:36:21 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);
! 103: NODE nd_f4_red_mod128_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
! 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__)
! 5826: int nd_to_vect128(int mod,UINT *s0,int n,ND d,U128 *r)
! 5827: {
! 5828: NM m;
! 5829: UINT *t,*s;
! 5830: int i;
! 5831:
! 5832: for ( i = 0; i < n; i++ ) r[i] = 0;
! 5833: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
! 5834: t = DL(m);
! 5835: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
! 5836: r[i] = (U128)CM(m);
! 5837: }
! 5838: for ( i = 0; !r[i]; i++ );
! 5839: return i;
! 5840: }
! 5841: #endif
! 5842:
1.113 noro 5843: int nd_to_vect_q(UINT *s0,int n,ND d,Q *r)
1.74 noro 5844: {
1.157 noro 5845: NM m;
5846: UINT *t,*s;
5847: int i;
5848:
5849: for ( i = 0; i < n; i++ ) r[i] = 0;
5850: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
5851: t = DL(m);
5852: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5853: r[i] = CQ(m);
5854: }
5855: for ( i = 0; !r[i]; i++ );
5856: return i;
1.74 noro 5857: }
5858:
1.232 noro 5859: int nd_to_vect_lf(UINT *s0,int n,ND d,mpz_t *r)
5860: {
5861: NM m;
5862: UINT *t,*s;
5863: int i;
5864:
5865: for ( i = 0; i < n; i++ ) { mpz_init(r[i]); mpz_set_ui(r[i],0); }
5866: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
5867: t = DL(m);
5868: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5869: mpz_set(r[i],BDY(CZ(m)));
5870: }
5871: for ( i = 0; !mpz_sgn(r[i]); i++ );
5872: return i;
5873: }
5874:
1.220 noro 5875: unsigned long *nd_to_vect_2(UINT *s0,int n,int *s0hash,ND p)
5876: {
5877: NM m;
5878: unsigned long *v;
5879: int i,j,h,size;
5880: UINT *s,*t;
5881:
5882: size = sizeof(unsigned long)*(n+BLEN-1)/BLEN;
5883: v = (unsigned long *)MALLOC_ATOMIC_IGNORE_OFF_PAGE(size);
5884: bzero(v,size);
5885: for ( i = j = 0, s = s0, m = BDY(p); m; j++, m = NEXT(m) ) {
5886: t = DL(m);
5887: h = ndl_hash_value(t);
5888: for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ );
5889: v[i/BLEN] |= 1L <<(i%BLEN);
5890: }
5891: return v;
5892: }
5893:
5894: int nd_nm_to_vect_2(UINT *s0,int n,int *s0hash,NDV p,NM m,unsigned long *v)
5895: {
5896: NMV mr;
5897: UINT *d,*t,*s;
5898: int i,j,len,h,head;
5899:
5900: d = DL(m);
5901: len = LEN(p);
1.235 noro 5902: t = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
1.220 noro 5903: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
5904: ndl_add(d,DL(mr),t);
5905: h = ndl_hash_value(t);
5906: for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ );
5907: if ( j == 0 ) head = i;
5908: v[i/BLEN] |= 1L <<(i%BLEN);
5909: }
5910: return head;
5911: }
5912:
1.129 noro 5913: Q *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_pair pair)
5914: {
1.157 noro 5915: NM m;
5916: NMV mr;
5917: UINT *d,*t,*s;
5918: NDV p;
5919: int i,j,len;
5920: Q *r;
5921:
5922: m = pair->mul;
5923: d = DL(m);
5924: p = nd_ps[pair->index];
5925: len = LEN(p);
5926: r = (Q *)CALLOC(n,sizeof(Q));
1.235 noro 5927: t = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
1.157 noro 5928: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
5929: ndl_add(d,DL(mr),t);
5930: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
5931: r[i] = CQ(mr);
5932: }
5933: return r;
1.129 noro 5934: }
5935:
1.235 noro 5936: IndArray nm_ind_pair_to_vect_compress(int trace,UINT *s0,int n,int *s0hash,NM_ind_pair pair)
1.64 noro 5937: {
1.157 noro 5938: NM m;
5939: NMV mr;
5940: UINT *d,*t,*s;
5941: NDV p;
5942: unsigned char *ivc;
5943: unsigned short *ivs;
5944: UINT *v,*ivi,*s0v;
1.210 noro 5945: int i,j,len,prev,diff,cdiff,h;
1.157 noro 5946: IndArray r;
1.198 noro 5947: struct oEGT eg0,eg1;
1.157 noro 5948:
5949: m = pair->mul;
5950: d = DL(m);
1.235 noro 5951: if ( trace )
5952: p = nd_demand?nd_ps_trace_sym[pair->index]:nd_ps_trace[pair->index];
5953: else
5954: p = nd_demand?nd_ps_sym[pair->index]:nd_ps[pair->index];
5955:
1.157 noro 5956: len = LEN(p);
1.235 noro 5957: t = (UINT *)MALLOC(nd_wpd*sizeof(UINT));
5958: v = (unsigned int *)MALLOC(len*sizeof(unsigned int));
1.198 noro 5959: get_eg(&eg0);
1.157 noro 5960: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
5961: ndl_add(d,DL(mr),t);
1.210 noro 5962: h = ndl_hash_value(t);
5963: for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ );
1.157 noro 5964: v[j] = i;
5965: }
1.198 noro 5966: get_eg(&eg1); add_eg(&eg_search,&eg0,&eg1);
1.157 noro 5967: r = (IndArray)MALLOC(sizeof(struct oIndArray));
5968: r->head = v[0];
5969: diff = 0;
5970: for ( i = 1; i < len; i++ ) {
5971: cdiff = v[i]-v[i-1]; diff = MAX(cdiff,diff);
5972: }
5973: if ( diff < 256 ) {
5974: r->width = 1;
5975: ivc = (unsigned char *)MALLOC_ATOMIC(len*sizeof(unsigned char));
5976: r->index.c = ivc;
5977: for ( i = 1, ivc[0] = 0; i < len; i++ ) ivc[i] = v[i]-v[i-1];
5978: } else if ( diff < 65536 ) {
5979: r->width = 2;
5980: ivs = (unsigned short *)MALLOC_ATOMIC(len*sizeof(unsigned short));
5981: r->index.s = ivs;
5982: for ( i = 1, ivs[0] = 0; i < len; i++ ) ivs[i] = v[i]-v[i-1];
5983: } else {
5984: r->width = 4;
5985: ivi = (unsigned int *)MALLOC_ATOMIC(len*sizeof(unsigned int));
5986: r->index.i = ivi;
5987: for ( i = 1, ivi[0] = 0; i < len; i++ ) ivi[i] = v[i]-v[i-1];
5988: }
5989: return r;
1.64 noro 5990: }
5991:
1.135 noro 5992: int compress_array(Q *svect,Q *cvect,int n)
5993: {
1.157 noro 5994: int i,j;
1.135 noro 5995:
1.157 noro 5996: for ( i = j = 0; i < n; i++ )
5997: if ( svect[i] ) cvect[j++] = svect[i];
5998: return j;
1.135 noro 5999: }
6000:
6001: void expand_array(Q *svect,Q *cvect,int n)
6002: {
1.157 noro 6003: int i,j;
1.135 noro 6004:
1.157 noro 6005: for ( i = j = 0; j < n; i++ )
6006: if ( svect[i] ) svect[i] = cvect[j++];
1.135 noro 6007: }
6008:
1.133 noro 6009: int ndv_reduce_vect_q(Q *svect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.107 noro 6010: {
1.157 noro 6011: int i,j,k,len,pos,prev,nz;
6012: Q cs,mcs,c1,c2,cr,gcd,t;
6013: IndArray ivect;
6014: unsigned char *ivc;
6015: unsigned short *ivs;
6016: unsigned int *ivi;
6017: NDV redv;
6018: NMV mr;
6019: NODE rp;
6020: int maxrs;
6021: double hmag;
6022: Q *cvect;
6023:
6024: maxrs = 0;
6025: for ( i = 0; i < col && !svect[i]; i++ );
6026: if ( i == col ) return maxrs;
6027: hmag = p_mag((P)svect[i])*nd_scale;
1.235 noro 6028: cvect = (Q *)MALLOC(col*sizeof(Q));
1.157 noro 6029: for ( i = 0; i < nred; i++ ) {
6030: ivect = imat[i];
6031: k = ivect->head;
6032: if ( svect[k] ) {
6033: maxrs = MAX(maxrs,rp0[i]->sugar);
1.215 noro 6034: redv = nd_demand?ndv_load(rp0[i]->index)
6035: :(trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index]);
1.157 noro 6036: len = LEN(redv); mr = BDY(redv);
6037: igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr);
6038: chsgnq(cs,&mcs);
6039: if ( !UNIQ(cr) ) {
6040: for ( j = 0; j < col; j++ ) {
6041: mulq(svect[j],cr,&c1); svect[j] = c1;
6042: }
6043: }
6044: svect[k] = 0; prev = k;
6045: switch ( ivect->width ) {
6046: case 1:
6047: ivc = ivect->index.c;
6048: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6049: pos = prev+ivc[j]; prev = pos;
6050: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
6051: }
6052: break;
6053: case 2:
6054: ivs = ivect->index.s;
6055: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6056: pos = prev+ivs[j]; prev = pos;
6057: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
6058: }
6059: break;
6060: case 4:
6061: ivi = ivect->index.i;
6062: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6063: pos = prev+ivi[j]; prev = pos;
6064: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
6065: }
6066: break;
6067: }
6068: for ( j = k+1; j < col && !svect[j]; j++ );
6069: if ( j == col ) break;
6070: if ( hmag && ((double)p_mag((P)svect[j]) > hmag) ) {
6071: nz = compress_array(svect,cvect,col);
6072: removecont_array((P *)cvect,nz,1);
6073: expand_array(svect,cvect,nz);
6074: hmag = ((double)p_mag((P)svect[j]))*nd_scale;
6075: }
6076: }
6077: }
6078: nz = compress_array(svect,cvect,col);
6079: removecont_array((P *)cvect,nz,1);
6080: expand_array(svect,cvect,nz);
6081: if ( DP_Print ) {
6082: fprintf(asir_out,"-"); fflush(asir_out);
6083: }
6084: return maxrs;
1.107 noro 6085: }
6086:
1.215 noro 6087: int ndv_reduce_vect_gz(GZ *gvect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
6088: {
6089: int i,j,k,l,len,pos,prev,nz;
6090: GZ cs,mcs,c1,c2,cr,gcd,t;
6091: IndArray ivect;
6092: unsigned char *ivc;
6093: unsigned short *ivs;
6094: unsigned int *ivi;
6095: NDV redv;
6096: NMV mr;
6097: NODE rp;
6098: int maxrs;
6099: double hmag;
6100: struct oVECT v;
6101:
6102: maxrs = 0;
6103: for ( i = 0; i < col && !gvect[i]; i++ );
6104: if ( i == col ) return maxrs;
6105: hmag = (double)n_bits_gz(gvect[i])*nd_scale;
6106: for ( i = 0; i < nred; i++ ) {
6107: ivect = imat[i];
6108: k = ivect->head;
6109: if ( gvect[k] ) {
6110: maxrs = MAX(maxrs,rp0[i]->sugar);
6111: redv = nd_ps_gz[rp0[i]->index];
6112: len = LEN(redv); mr = BDY(redv);
6113: gcdgz(gvect[k],CZ(mr),&gcd);
6114: divsgz(gvect[k],gcd,&cs);
6115: divsgz(CZ(mr),gcd,&cr);
6116: chsgngz(cs,&mcs);
6117: if ( !UNIGZ(cr) ) {
6118: for ( j = 0; j < col; j++ ) {
6119: mulgz(gvect[j],cr,&c1); gvect[j] = c1;
6120: }
6121: }
6122: gvect[k] = 0; prev = k;
6123: switch ( ivect->width ) {
6124: case 1:
6125: ivc = ivect->index.c;
6126: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6127: pos = prev+ivc[j]; prev = pos;
6128: mulgz(CZ(mr),mcs,&c2); addgz(gvect[pos],c2,&t); gvect[pos] = t;
6129: }
6130: break;
6131: case 2:
6132: ivs = ivect->index.s;
6133: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6134: pos = prev+ivs[j]; prev = pos;
6135: mulgz(CZ(mr),mcs,&c2); addgz(gvect[pos],c2,&t); gvect[pos] = t;
6136: }
6137: break;
6138: case 4:
6139: ivi = ivect->index.i;
6140: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6141: pos = prev+ivi[j]; prev = pos;
6142: mulgz(CZ(mr),mcs,&c2); addgz(gvect[pos],c2,&t); gvect[pos] = t;
6143: }
6144: break;
6145: }
6146: for ( j = k+1; j < col && !gvect[j]; j++ );
6147: if ( j == col ) break;
6148: if ( hmag && ((double)n_bits_gz(gvect[j]) > hmag) ) {
6149: v.len = col; v.body = (pointer)gvect; gcdvgz(&v,&gcd);
6150: #if 1
6151: for ( l = 0; l < col; l++ ) { divsgz(gvect[l],gcd,&t); gvect[l] = t; }
6152: #endif
6153: hmag = (double)n_bits_gz(gvect[j])*nd_scale;
6154: }
6155: }
6156: }
6157: for ( j = 0; j < col && !gvect[j]; j++ );
6158: if ( j < col ) {
6159: v.len = col; v.body = (pointer)gvect; gcdvgz(&v,&gcd);
6160: for ( l = 0; l < col; l++ ) { divsgz(gvect[l],gcd,&t); gvect[l] = t; }
6161: }
6162: if ( DP_Print ) {
6163: fprintf(asir_out,"-"); fflush(asir_out);
6164: }
6165: return maxrs;
6166: }
6167:
1.76 noro 6168: int ndv_reduce_vect(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.65 noro 6169: {
1.157 noro 6170: int i,j,k,len,pos,prev;
6171: UINT c,c1,c2,c3,up,lo,dmy;
6172: IndArray ivect;
6173: unsigned char *ivc;
6174: unsigned short *ivs;
6175: unsigned int *ivi;
6176: NDV redv;
6177: NMV mr;
6178: NODE rp;
6179: int maxrs;
6180:
6181: maxrs = 0;
6182: for ( i = 0; i < nred; i++ ) {
6183: ivect = imat[i];
6184: k = ivect->head; svect[k] %= m;
6185: if ( c = svect[k] ) {
6186: maxrs = MAX(maxrs,rp0[i]->sugar);
6187: c = m-c; redv = nd_ps[rp0[i]->index];
6188: len = LEN(redv); mr = BDY(redv);
6189: svect[k] = 0; prev = k;
6190: switch ( ivect->width ) {
6191: case 1:
6192: ivc = ivect->index.c;
6193: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
1.215 noro 6194: pos = prev+ivc[j]; c1 = CM(mr); prev = pos;
6195: if ( c1 ) {
6196: c2 = svect[pos];
6197: DMA(c1,c,c2,up,lo);
6198: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
6199: } else svect[pos] = lo;
6200: }
1.157 noro 6201: }
6202: break;
6203: case 2:
6204: ivs = ivect->index.s;
6205: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
1.215 noro 6206: pos = prev+ivs[j]; c1 = CM(mr);
1.157 noro 6207: prev = pos;
1.215 noro 6208: if ( c1 ) {
6209: c2 = svect[pos];
6210: DMA(c1,c,c2,up,lo);
6211: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
6212: } else svect[pos] = lo;
6213: }
1.157 noro 6214: }
6215: break;
6216: case 4:
6217: ivi = ivect->index.i;
6218: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
1.215 noro 6219: pos = prev+ivi[j]; c1 = CM(mr);
1.157 noro 6220: prev = pos;
1.215 noro 6221: if ( c1 ) {
6222: c2 = svect[pos];
6223: DMA(c1,c,c2,up,lo);
6224: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
6225: } else svect[pos] = lo;
6226: }
1.157 noro 6227: }
6228: break;
6229: }
6230: }
6231: }
6232: for ( i = 0; i < col; i++ )
6233: if ( svect[i] >= (UINT)m ) svect[i] %= m;
6234: return maxrs;
1.65 noro 6235: }
6236:
1.239 ! noro 6237: #if defined(__GNUC__)
! 6238: int ndv_reduce_vect128(int m,U128 *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
! 6239: {
! 6240: int i,j,k,len,pos,prev;
! 6241: U64 c,c1;
! 6242: U128 a;
! 6243: IndArray ivect;
! 6244: unsigned char *ivc;
! 6245: unsigned short *ivs;
! 6246: unsigned int *ivi;
! 6247: NDV redv;
! 6248: NMV mr;
! 6249: NODE rp;
! 6250: int maxrs;
! 6251:
! 6252: maxrs = 0;
! 6253: for ( i = 0; i < nred; i++ ) {
! 6254: ivect = imat[i];
! 6255: k = ivect->head; svect[k] %= m;
! 6256: if ( c = svect[k] ) {
! 6257: maxrs = MAX(maxrs,rp0[i]->sugar);
! 6258: c = m-c; redv = nd_ps[rp0[i]->index];
! 6259: len = LEN(redv); mr = BDY(redv);
! 6260: svect[k] = 0; prev = k;
! 6261: switch ( ivect->width ) {
! 6262: case 1:
! 6263: ivc = ivect->index.c;
! 6264: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
! 6265: pos = prev+ivc[j]; c1 = CM(mr); prev = pos;
! 6266: if ( c1 ) svect[pos] += c1*c;
! 6267: }
! 6268: break;
! 6269: case 2:
! 6270: ivs = ivect->index.s;
! 6271: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
! 6272: pos = prev+ivs[j]; c1 = CM(mr); prev = pos;
! 6273: if ( c1 ) svect[pos] += c1*c;
! 6274: }
! 6275: break;
! 6276: case 4:
! 6277: ivi = ivect->index.i;
! 6278: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
! 6279: pos = prev+ivi[j]; c1 = CM(mr); prev = pos;
! 6280: if ( c1 ) svect[pos] += c1*c;
! 6281: }
! 6282: break;
! 6283: }
! 6284: }
! 6285: }
! 6286: for ( i = 0; i < col; i++ ) svect[i] %= m;
! 6287: return maxrs;
! 6288: }
! 6289: #endif
! 6290:
1.76 noro 6291: int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.72 noro 6292: {
1.157 noro 6293: int i,j,k,len,pos,prev;
6294: UINT c,c1,c2,c3,up,lo,dmy;
6295: IndArray ivect;
6296: unsigned char *ivc;
6297: unsigned short *ivs;
6298: unsigned int *ivi;
6299: NDV redv;
6300: NMV mr;
6301: NODE rp;
6302: int maxrs;
6303:
6304: maxrs = 0;
6305: for ( i = 0; i < nred; i++ ) {
6306: ivect = imat[i];
1.232 noro 6307: k = ivect->head;
1.157 noro 6308: if ( c = svect[k] ) {
6309: maxrs = MAX(maxrs,rp0[i]->sugar);
6310: c = _chsgnsf(c); redv = nd_ps[rp0[i]->index];
6311: len = LEN(redv); mr = BDY(redv);
6312: svect[k] = 0; prev = k;
6313: switch ( ivect->width ) {
6314: case 1:
6315: ivc = ivect->index.c;
6316: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6317: pos = prev+ivc[j]; prev = pos;
6318: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
6319: }
6320: break;
6321: case 2:
6322: ivs = ivect->index.s;
6323: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6324: pos = prev+ivs[j]; prev = pos;
6325: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
6326: }
6327: break;
6328: case 4:
6329: ivi = ivect->index.i;
6330: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6331: pos = prev+ivi[j]; prev = pos;
6332: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
6333: }
6334: break;
6335: }
6336: }
6337: }
6338: return maxrs;
1.72 noro 6339: }
6340:
1.232 noro 6341: ND nd_add_lf(ND p1,ND p2)
6342: {
6343: int n,c,can;
6344: ND r;
6345: NM m1,m2,mr0,mr,s;
6346: GZ t;
6347:
6348: if ( !p1 ) return p2;
6349: else if ( !p2 ) return p1;
6350: else {
6351: can = 0;
6352: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
6353: c = DL_COMPARE(DL(m1),DL(m2));
6354: switch ( c ) {
6355: case 0:
6356: addlf(CZ(m1),CZ(m2),&t);
6357: s = m1; m1 = NEXT(m1);
6358: if ( t ) {
6359: can++; NEXTNM2(mr0,mr,s); CZ(mr) = (t);
6360: } else {
6361: can += 2; FREENM(s);
6362: }
6363: s = m2; m2 = NEXT(m2); FREENM(s);
6364: break;
6365: case 1:
6366: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
6367: break;
6368: case -1:
6369: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
6370: break;
6371: }
6372: }
6373: if ( !mr0 )
6374: if ( m1 ) mr0 = m1;
6375: else if ( m2 ) mr0 = m2;
6376: else return 0;
6377: else if ( m1 ) NEXT(mr) = m1;
6378: else if ( m2 ) NEXT(mr) = m2;
6379: else NEXT(mr) = 0;
6380: BDY(p1) = mr0;
6381: SG(p1) = MAX(SG(p1),SG(p2));
6382: LEN(p1) = LEN(p1)+LEN(p2)-can;
6383: FREEND(p2);
6384: return p1;
6385: }
6386: }
6387:
1.234 noro 6388: int ndv_reduce_vect_lf(mpz_t *svect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.232 noro 6389: {
6390: int i,j,k,len,pos,prev;
6391: mpz_t c,mc,c1;
6392: IndArray ivect;
6393: unsigned char *ivc;
6394: unsigned short *ivs;
6395: unsigned int *ivi;
6396: NDV redv;
6397: NMV mr;
6398: NODE rp;
6399: int maxrs;
6400:
6401: maxrs = 0;
6402: lf_lazy = 1;
6403: for ( i = 0; i < nred; i++ ) {
6404: ivect = imat[i];
6405: k = ivect->head;
6406: mpz_mod(svect[k],svect[k],BDY(current_mod_lf));
6407: if ( mpz_sgn(svect[k]) ) {
6408: maxrs = MAX(maxrs,rp0[i]->sugar);
6409: mpz_neg(svect[k],svect[k]);
1.234 noro 6410: redv = trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index];
1.232 noro 6411: len = LEN(redv); mr = BDY(redv);
6412: prev = k;
6413: switch ( ivect->width ) {
6414: case 1:
6415: ivc = ivect->index.c;
6416: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6417: pos = prev+ivc[j]; prev = pos;
6418: mpz_addmul(svect[pos],svect[k],BDY(CZ(mr)));
6419: }
6420: break;
6421: case 2:
6422: ivs = ivect->index.s;
6423: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6424: pos = prev+ivs[j]; prev = pos;
6425: mpz_addmul(svect[pos],svect[k],BDY(CZ(mr)));
6426: }
6427: break;
6428: case 4:
6429: ivi = ivect->index.i;
6430: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
6431: pos = prev+ivi[j]; prev = pos;
6432: mpz_addmul(svect[pos],svect[k],BDY(CZ(mr)));
6433: }
6434: break;
6435: }
6436: mpz_set_ui(svect[k],0);
6437: }
6438: }
6439: lf_lazy=0;
6440: for ( i = 0; i < col; i++ ) {
6441: mpz_mod(svect[i],svect[i],BDY(current_mod_lf));
6442: }
6443: return maxrs;
6444: }
6445:
6446: int nd_gauss_elim_lf(mpz_t **mat0,int *sugar,int row,int col,int *colstat)
6447: {
6448: int i,j,k,l,rank,s;
6449: mpz_t a,a1,inv;
6450: mpz_t *t,*pivot,*pk;
6451: mpz_t **mat;
6452: struct oEGT eg0,eg1,eg_forward,eg_mod,eg_back;
1.234 noro 6453: int size,size1;
1.232 noro 6454:
6455: mpz_init(inv);
6456: mpz_init(a);
6457: mat = (mpz_t **)mat0;
1.234 noro 6458: size = 0;
1.232 noro 6459: for ( rank = 0, j = 0; j < col; j++ ) {
6460: for ( i = rank; i < row; i++ ) {
6461: mpz_mod(mat[i][j],mat[i][j],BDY(current_mod_lf));
6462: }
6463: for ( i = rank; i < row; i++ )
6464: if ( mpz_sgn(mat[i][j]) )
6465: break;
6466: if ( i == row ) {
6467: colstat[j] = 0;
6468: continue;
6469: } else
6470: colstat[j] = 1;
6471: if ( i != rank ) {
6472: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
6473: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
6474: }
6475: pivot = mat[rank];
6476: s = sugar[rank];
6477: mpz_invert(inv,pivot[j],BDY(current_mod_lf));
6478: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
6479: if ( mpz_sgn(*pk) ) {
6480: mpz_mul(a,*pk,inv); mpz_mod(*pk,a,BDY(current_mod_lf));
6481: }
6482: for ( i = rank+1; i < row; i++ ) {
6483: t = mat[i];
6484: if ( mpz_sgn(t[j]) ) {
6485: sugar[i] = MAX(sugar[i],s);
6486: mpz_neg(a,t[j]);
6487: red_by_vect_lf(t+j,pivot+j,a,col-j);
6488: }
6489: }
6490: rank++;
6491: }
6492: for ( j = col-1, l = rank-1; j >= 0; j-- )
6493: if ( colstat[j] ) {
6494: pivot = mat[l];
6495: s = sugar[l];
6496: for ( k = j; k < col; k++ )
6497: mpz_mod(pivot[k],pivot[k],BDY(current_mod_lf));
6498: for ( i = 0; i < l; i++ ) {
6499: t = mat[i];
6500: if ( mpz_sgn(t[j]) ) {
6501: sugar[i] = MAX(sugar[i],s);
6502: mpz_neg(a,t[j]);
6503: red_by_vect_lf(t+j,pivot+j,a,col-j);
6504: }
6505: }
6506: l--;
6507: }
6508: for ( j = 0, l = 0; l < rank; j++ )
6509: if ( colstat[j] ) {
6510: t = mat[l];
6511: for ( k = j; k < col; k++ ) {
6512: mpz_mod(t[k],t[k],BDY(current_mod_lf));
6513: }
6514: l++;
6515: }
6516: return rank;
6517: }
6518:
6519:
1.65 noro 6520: NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhead,UINT *s0vect)
6521: {
1.157 noro 6522: int j,k,len;
6523: UINT *p;
6524: UINT c;
6525: NDV r;
6526: NMV mr0,mr;
6527:
6528: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
6529: if ( !len ) return 0;
6530: else {
1.200 noro 6531: mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len);
1.103 noro 6532: #if 0
1.157 noro 6533: ndv_alloc += nmv_adv*len;
1.103 noro 6534: #endif
1.157 noro 6535: mr = mr0;
6536: p = s0vect;
6537: for ( j = k = 0; j < col; j++, p += nd_wpd )
6538: if ( !rhead[j] ) {
6539: if ( c = vect[k++] ) {
6540: ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr);
6541: }
6542: }
6543: MKNDV(nd_nvar,mr0,len,r);
6544: return r;
6545: }
1.65 noro 6546: }
6547:
1.239 ! noro 6548: #if defined(__GNUC__)
! 6549: NDV vect128o_ndv(U128 *vect,int spcol,int col,int *rhead,UINT *s0vect)
! 6550: {
! 6551: int j,k,len;
! 6552: UINT *p;
! 6553: UINT c;
! 6554: NDV r;
! 6555: NMV mr0,mr;
! 6556:
! 6557: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
! 6558: if ( !len ) return 0;
! 6559: else {
! 6560: mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len);
! 6561: #if 0
! 6562: ndv_alloc += nmv_adv*len;
! 6563: #endif
! 6564: mr = mr0;
! 6565: p = s0vect;
! 6566: for ( j = k = 0; j < col; j++, p += nd_wpd )
! 6567: if ( !rhead[j] ) {
! 6568: if ( c = (UINT)vect[k++] ) {
! 6569: ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr);
! 6570: }
! 6571: }
! 6572: MKNDV(nd_nvar,mr0,len,r);
! 6573: return r;
! 6574: }
! 6575: }
! 6576: #endif
! 6577:
1.220 noro 6578: NDV vect_to_ndv_2(unsigned long *vect,int col,UINT *s0vect)
6579: {
6580: int j,k,len;
6581: UINT *p;
6582: NDV r;
6583: NMV mr0,mr;
6584:
6585: for ( j = 0, len = 0; j < col; j++ ) if ( vect[j/BLEN] & (1L<<(j%BLEN)) ) len++;
6586: if ( !len ) return 0;
6587: else {
6588: mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len);
6589: mr = mr0;
6590: p = s0vect;
6591: for ( j = 0; j < col; j++, p += nd_wpd )
6592: if ( vect[j/BLEN] & (1L<<(j%BLEN)) ) {
6593: ndl_copy(p,DL(mr)); CM(mr) = 1; NMV_ADV(mr);
6594: }
6595: MKNDV(nd_nvar,mr0,len,r);
6596: return r;
6597: }
6598: }
6599:
1.129 noro 6600: /* for preprocessed vector */
6601:
1.113 noro 6602: NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead,UINT *s0vect)
1.107 noro 6603: {
1.157 noro 6604: int j,k,len;
6605: UINT *p;
6606: Q c;
6607: NDV r;
6608: NMV mr0,mr;
6609:
6610: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
6611: if ( !len ) return 0;
6612: else {
1.200 noro 6613: mr0 = (NMV)MALLOC(nmv_adv*len);
1.107 noro 6614: #if 0
1.157 noro 6615: ndv_alloc += nmv_adv*len;
1.107 noro 6616: #endif
1.157 noro 6617: mr = mr0;
6618: p = s0vect;
6619: for ( j = k = 0; j < col; j++, p += nd_wpd )
6620: if ( !rhead[j] ) {
6621: if ( c = vect[k++] ) {
6622: if ( DN(c) )
6623: error("afo");
6624: ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr);
6625: }
6626: }
6627: MKNDV(nd_nvar,mr0,len,r);
6628: return r;
6629: }
1.107 noro 6630: }
6631:
1.215 noro 6632: NDV vect_to_ndv_gz(GZ *vect,int spcol,int col,int *rhead,UINT *s0vect)
6633: {
6634: int j,k,len;
6635: UINT *p;
1.232 noro 6636: GZ c;
1.215 noro 6637: NDV r;
6638: NMV mr0,mr;
6639:
6640: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
6641: if ( !len ) return 0;
6642: else {
6643: mr0 = (NMV)MALLOC(nmv_adv*len);
6644: #if 0
6645: ndv_alloc += nmv_adv*len;
6646: #endif
6647: mr = mr0;
6648: p = s0vect;
6649: for ( j = k = 0; j < col; j++, p += nd_wpd )
6650: if ( !rhead[j] ) {
6651: if ( c = vect[k++] ) {
6652: ndl_copy(p,DL(mr)); CZ(mr) = c; NMV_ADV(mr);
6653: }
6654: }
6655: MKNDV(nd_nvar,mr0,len,r);
6656: return r;
6657: }
6658: }
6659:
1.232 noro 6660: NDV vect_to_ndv_lf(mpz_t *vect,int spcol,int col,int *rhead,UINT *s0vect)
6661: {
6662: int j,k,len;
6663: UINT *p;
6664: mpz_t c;
6665: NDV r;
6666: NMV mr0,mr;
6667:
6668: for ( j = 0, len = 0; j < spcol; j++ ) if ( mpz_sgn(vect[j]) ) len++;
6669: if ( !len ) return 0;
6670: else {
6671: mr0 = (NMV)MALLOC(nmv_adv*len);
6672: #if 0
6673: ndv_alloc += nmv_adv*len;
6674: #endif
6675: mr = mr0;
6676: p = s0vect;
6677: for ( j = k = 0; j < col; j++, p += nd_wpd )
6678: if ( !rhead[j] ) {
6679: c[0] = vect[k++][0];
6680: if ( mpz_sgn(c) ) {
6681: ndl_copy(p,DL(mr)); MPZTOGZ(c,CZ(mr)); NMV_ADV(mr);
6682: }
6683: }
6684: MKNDV(nd_nvar,mr0,len,r);
6685: return r;
6686: }
6687: }
6688:
1.129 noro 6689: /* for plain vector */
6690:
6691: NDV plain_vect_to_ndv_q(Q *vect,int col,UINT *s0vect)
6692: {
1.157 noro 6693: int j,k,len;
6694: UINT *p;
6695: Q c;
6696: NDV r;
6697: NMV mr0,mr;
6698:
6699: for ( j = 0, len = 0; j < col; j++ ) if ( vect[j] ) len++;
6700: if ( !len ) return 0;
6701: else {
1.200 noro 6702: mr0 = (NMV)MALLOC(nmv_adv*len);
1.129 noro 6703: #if 0
1.157 noro 6704: ndv_alloc += nmv_adv*len;
1.129 noro 6705: #endif
1.157 noro 6706: mr = mr0;
6707: p = s0vect;
6708: for ( j = k = 0; j < col; j++, p += nd_wpd, k++ )
6709: if ( c = vect[k] ) {
6710: if ( DN(c) )
6711: error("afo");
6712: ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr);
6713: }
6714: MKNDV(nd_nvar,mr0,len,r);
6715: return r;
6716: }
1.129 noro 6717: }
6718:
1.133 noro 6719: int nd_sp_f4(int m,int trace,ND_pairs l,PGeoBucket bucket)
1.65 noro 6720: {
1.157 noro 6721: ND_pairs t;
6722: NODE sp0,sp;
6723: int stat;
6724: ND spol;
6725:
6726: for ( t = l; t; t = NEXT(t) ) {
6727: stat = nd_sp(m,trace,t,&spol);
6728: if ( !stat ) return 0;
6729: if ( spol ) {
6730: add_pbucket_symbolic(bucket,spol);
6731: }
6732: }
6733: return 1;
1.65 noro 6734: }
6735:
1.133 noro 6736: int nd_symbolic_preproc(PGeoBucket bucket,int trace,UINT **s0vect,NODE *r)
1.65 noro 6737: {
1.157 noro 6738: NODE rp0,rp;
6739: NM mul,head,s0,s;
6740: int index,col,i,sugar;
6741: RHist h;
6742: UINT *s0v,*p;
6743: NM_ind_pair pair;
6744: ND red;
6745: NDV *ps;
1.235 noro 6746: static int afo;
1.157 noro 6747:
6748: s0 = 0; rp0 = 0; col = 0;
1.215 noro 6749: if ( nd_demand )
6750: ps = trace?nd_ps_trace_sym:nd_ps_sym;
6751: else
6752: ps = trace?nd_ps_trace:nd_ps;
1.157 noro 6753: while ( 1 ) {
6754: head = remove_head_pbucket_symbolic(bucket);
6755: if ( !head ) break;
6756: if ( !s0 ) s0 = head;
6757: else NEXT(s) = head;
6758: s = head;
6759: index = ndl_find_reducer(DL(head));
6760: if ( index >= 0 ) {
6761: h = nd_psh[index];
6762: NEWNM(mul);
6763: ndl_sub(DL(head),DL(h),DL(mul));
1.235 noro 6764: if ( ndl_check_bound2(index,DL(mul)) )
6765: return 0;
1.157 noro 6766: sugar = TD(DL(mul))+SG(ps[index]);
6767: MKNM_ind_pair(pair,mul,index,sugar);
6768: red = ndv_mul_nm_symbolic(mul,ps[index]);
6769: add_pbucket_symbolic(bucket,nd_remove_head(red));
6770: NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair;
6771: }
6772: col++;
6773: }
6774: if ( rp0 ) NEXT(rp) = 0;
6775: NEXT(s) = 0;
6776: s0v = (UINT *)MALLOC_ATOMIC(col*nd_wpd*sizeof(UINT));
6777: for ( i = 0, p = s0v, s = s0; i < col;
6778: i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p);
6779: *s0vect = s0v;
6780: *r = rp0;
6781: return col;
1.65 noro 6782: }
6783:
1.234 noro 6784: NODE nd_f4(int m,int checkonly,int **indp)
1.69 noro 6785: {
1.234 noro 6786: int i,nh,stat,index,f4red;
1.208 noro 6787: NODE r,g,tn0,tn,node;
6788: ND_pairs d,l,t,ll0,ll;
6789: LIST l0,l1;
1.157 noro 6790: ND spol,red;
6791: NDV nf,redv;
6792: NM s0,s;
1.231 noro 6793: NODE rp0,srp0,nflist,nzlist,nzlist_t;
1.208 noro 6794: int nsp,nred,col,rank,len,k,j,a,i1s,i2s;
1.157 noro 6795: UINT c;
6796: UINT **spmat;
6797: UINT *s0vect,*svect,*p,*v;
6798: int *colstat;
6799: IndArray *imat;
6800: int *rhead;
6801: int spcol,sprow;
6802: int sugar;
6803: PGeoBucket bucket;
6804: struct oEGT eg0,eg1,eg_f4;
1.208 noro 6805: Q i1,i2,sugarq;
1.103 noro 6806: #if 0
1.157 noro 6807: ndv_alloc = 0;
1.103 noro 6808: #endif
1.157 noro 6809: g = 0; d = 0;
6810: for ( i = 0; i < nd_psn; i++ ) {
1.231 noro 6811: if ( !nd_nzlist ) d = update_pairs(d,g,i,0);
1.157 noro 6812: g = update_base(g,i);
6813: }
1.208 noro 6814: nzlist = 0;
1.231 noro 6815: nzlist_t = nd_nzlist;
1.234 noro 6816: f4red = 0;
1.231 noro 6817: while ( d || nzlist_t ) {
1.157 noro 6818: get_eg(&eg0);
1.208 noro 6819: if ( nd_nzlist ) {
1.231 noro 6820: node = BDY((LIST)BDY(nzlist_t));
1.232 noro 6821: sugar = (int)ARG0(node);
1.231 noro 6822: tn = BDY((LIST)ARG1(node));
6823: if ( !tn ) {
6824: nzlist_t = NEXT(nzlist_t);
6825: continue;
6826: }
6827: /* tn = [[i1,i2],...] */
6828: l = nd_ipairtospair(tn);
6829: } else {
6830: l = nd_minsugarp(d,&d);
6831: sugar = nd_sugarweight?l->sugar2:SG(l);
6832: if ( MaxDeg > 0 && sugar > MaxDeg ) break;
1.208 noro 6833: }
1.157 noro 6834: bucket = create_pbucket();
6835: stat = nd_sp_f4(m,0,l,bucket);
6836: if ( !stat ) {
1.231 noro 6837: if ( !nd_nzlist ) {
6838: for ( t = l; NEXT(t); t = NEXT(t) );
6839: NEXT(t) = d; d = l;
6840: d = nd_reconstruct(0,d);
6841: }
1.157 noro 6842: continue;
6843: }
6844: if ( bucket->m < 0 ) continue;
6845: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
6846: if ( !col ) {
6847: for ( t = l; NEXT(t); t = NEXT(t) );
6848: NEXT(t) = d; d = l;
6849: d = nd_reconstruct(0,d);
6850: continue;
6851: }
6852: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
6853: if ( DP_Print )
6854: fprintf(asir_out,"sugar=%d,symb=%fsec,",
6855: sugar,eg_f4.exectime+eg_f4.gctime);
1.210 noro 6856: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,nd_gentrace?&ll:0);
1.234 noro 6857: if ( checkonly && nflist ) return 0;
1.157 noro 6858: /* adding new bases */
6859: for ( r = nflist; r; r = NEXT(r) ) {
6860: nf = (NDV)BDY(r);
6861: ndv_removecont(m,nf);
6862: if ( !m && nd_nalg ) {
6863: ND nf1;
6864:
6865: nf1 = ndvtond(m,nf);
6866: nd_monic(0,&nf1);
6867: nd_removecont(m,nf1);
6868: nf = ndtondv(m,nf1);
6869: }
1.215 noro 6870: nh = ndv_newps(m,nf,0,1);
1.231 noro 6871: if ( !nd_nzlist ) d = update_pairs(d,g,nh,0);
1.157 noro 6872: g = update_base(g,nh);
6873: }
1.234 noro 6874: if ( DP_Print ) {
6875: fprintf(asir_out,"f4red=%d,gblen=%d,",f4red,length(g)); fflush(asir_out);
6876: }
1.208 noro 6877: if ( nd_gentrace ) {
6878: for ( t = ll, tn0 = 0; t; t = NEXT(t) ) {
6879: NEXTNODE(tn0,tn);
6880: STOQ(t->i1,i1); STOQ(t->i2,i2);
6881: node = mknode(2,i1,i2); MKLIST(l0,node);
6882: BDY(tn) = l0;
6883: }
6884: if ( tn0 ) NEXT(tn) = 0; MKLIST(l0,tn0);
6885: STOQ(sugar,sugarq); node = mknode(2,sugarq,l0); MKLIST(l1,node);
6886: MKNODE(node,l1,nzlist); nzlist = node;
6887: }
1.231 noro 6888: if ( nd_nzlist ) nzlist_t = NEXT(nzlist_t);
1.234 noro 6889: f4red++;
6890: if ( nd_f4red && f4red >= nd_f4red ) break;
6891: if ( nd_rank0 && !nflist ) break;
1.208 noro 6892: }
6893: if ( nd_gentrace ) {
6894: MKLIST(l0,reverse_node(nzlist));
6895: MKNODE(nd_alltracelist,l0,0);
1.157 noro 6896: }
1.103 noro 6897: #if 0
1.157 noro 6898: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.103 noro 6899: #endif
1.215 noro 6900: conv_ilist(nd_demand,0,g,indp);
1.157 noro 6901: return g;
1.69 noro 6902: }
1.74 noro 6903:
1.167 noro 6904: NODE nd_f4_trace(int m,int **indp)
1.133 noro 6905: {
1.157 noro 6906: int i,nh,stat,index;
6907: NODE r,g;
6908: ND_pairs d,l,l0,t;
6909: ND spol,red;
6910: NDV nf,redv,nfqv,nfv;
6911: NM s0,s;
6912: NODE rp0,srp0,nflist;
6913: int nsp,nred,col,rank,len,k,j,a;
6914: UINT c;
6915: UINT **spmat;
6916: UINT *s0vect,*svect,*p,*v;
6917: int *colstat;
6918: IndArray *imat;
6919: int *rhead;
6920: int spcol,sprow;
6921: int sugar;
6922: PGeoBucket bucket;
6923: struct oEGT eg0,eg1,eg_f4;
6924:
6925: g = 0; d = 0;
6926: for ( i = 0; i < nd_psn; i++ ) {
1.168 noro 6927: d = update_pairs(d,g,i,0);
1.157 noro 6928: g = update_base(g,i);
6929: }
6930: while ( d ) {
6931: get_eg(&eg0);
6932: l = nd_minsugarp(d,&d);
6933: sugar = SG(l);
1.228 noro 6934: if ( MaxDeg > 0 && sugar > MaxDeg ) break;
1.157 noro 6935: bucket = create_pbucket();
6936: stat = nd_sp_f4(m,0,l,bucket);
6937: if ( !stat ) {
6938: for ( t = l; NEXT(t); t = NEXT(t) );
6939: NEXT(t) = d; d = l;
6940: d = nd_reconstruct(1,d);
6941: continue;
6942: }
6943: if ( bucket->m < 0 ) continue;
6944: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
6945: if ( !col ) {
6946: for ( t = l; NEXT(t); t = NEXT(t) );
6947: NEXT(t) = d; d = l;
6948: d = nd_reconstruct(1,d);
6949: continue;
6950: }
6951: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
6952: if ( DP_Print )
6953: fprintf(asir_out,"sugar=%d,symb=%fsec,",
6954: sugar,eg_f4.exectime+eg_f4.gctime);
6955: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0);
6956: if ( !l0 ) continue;
6957: l = l0;
6958:
6959: /* over Q */
6960: bucket = create_pbucket();
6961: stat = nd_sp_f4(0,1,l,bucket);
6962: if ( !stat ) {
6963: for ( t = l; NEXT(t); t = NEXT(t) );
6964: NEXT(t) = d; d = l;
6965: d = nd_reconstruct(1,d);
6966: continue;
6967: }
6968: if ( bucket->m < 0 ) continue;
6969: col = nd_symbolic_preproc(bucket,1,&s0vect,&rp0);
6970: if ( !col ) {
6971: for ( t = l; NEXT(t); t = NEXT(t) );
6972: NEXT(t) = d; d = l;
6973: d = nd_reconstruct(1,d);
6974: continue;
6975: }
6976: nflist = nd_f4_red(0,l,1,s0vect,col,rp0,0);
6977: /* adding new bases */
6978: for ( r = nflist; r; r = NEXT(r) ) {
6979: nfqv = (NDV)BDY(r);
6980: ndv_removecont(0,nfqv);
6981: if ( !rem(NM(HCQ(nfqv)),m) ) return 0;
6982: if ( nd_nalg ) {
6983: ND nf1;
6984:
6985: nf1 = ndvtond(m,nfqv);
6986: nd_monic(0,&nf1);
6987: nd_removecont(0,nf1);
6988: nfqv = ndtondv(0,nf1); nd_free(nf1);
6989: }
6990: nfv = ndv_dup(0,nfqv);
6991: ndv_mod(m,nfv);
6992: ndv_removecont(m,nfv);
1.215 noro 6993: nh = ndv_newps(0,nfv,nfqv,1);
1.168 noro 6994: d = update_pairs(d,g,nh,0);
1.157 noro 6995: g = update_base(g,nh);
6996: }
6997: }
1.133 noro 6998: #if 0
1.157 noro 6999: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.133 noro 7000: #endif
1.215 noro 7001: conv_ilist(nd_demand,1,g,indp);
1.157 noro 7002: return g;
1.133 noro 7003: }
7004:
1.220 noro 7005: int rref(matrix mat,int *sugar)
7006: {
7007: int row,col,i,j,k,l,s,wcol,wj;
7008: unsigned long bj;
7009: unsigned long **a;
7010: unsigned long *ai,*ak,*as,*t;
7011: int *pivot;
7012:
7013: row = mat->row;
7014: col = mat->col;
7015: a = mat->a;
7016: wcol = (col+BLEN-1)/BLEN;
7017: pivot = (int *)MALLOC_ATOMIC(row*sizeof(int));
7018: i = 0;
7019: for ( j = 0; j < col; j++ ) {
7020: wj = j/BLEN; bj = 1L<<(j%BLEN);
7021: for ( k = i; k < row; k++ )
7022: if ( a[k][wj] & bj ) break;
7023: if ( k == row ) continue;
7024: pivot[i] = j;
7025: if ( k != i ) {
7026: t = a[i]; a[i] = a[k]; a[k] = t;
7027: s = sugar[i]; sugar[i] = sugar[k]; sugar[k] = s;
7028: }
7029: ai = a[i];
7030: for ( k = i+1; k < row; k++ ) {
7031: ak = a[k];
7032: if ( ak[wj] & bj ) {
7033: for ( l = wj; l < wcol; l++ )
7034: ak[l] ^= ai[l];
7035: sugar[k] = MAX(sugar[k],sugar[i]);
7036: }
7037: }
7038: i++;
7039: }
7040: for ( k = i-1; k >= 0; k-- ) {
7041: j = pivot[k]; wj = j/BLEN; bj = 1L<<(j%BLEN);
7042: ak = a[k];
7043: for ( s = 0; s < k; s++ ) {
7044: as = a[s];
7045: if ( as[wj] & bj ) {
7046: for ( l = wj; l < wcol; l++ )
7047: as[l] ^= ak[l];
7048: sugar[s] = MAX(sugar[s],sugar[k]);
7049: }
7050: }
7051: }
7052: return i;
7053: }
7054:
7055: void print_matrix(matrix mat)
7056: {
7057: int row,col,i,j;
7058: unsigned long *ai;
7059:
7060: row = mat->row;
7061: col = mat->col;
7062: printf("%d x %d\n",row,col);
7063: for ( i = 0; i < row; i++ ) {
7064: ai = mat->a[i];
7065: for ( j = 0; j < col; j++ ) {
7066: if ( ai[j/BLEN] & (1L<<(j%BLEN)) ) putchar('1');
7067: else putchar('0');
7068: }
7069: putchar('\n');
7070: }
7071: }
7072:
7073: NDV vect_to_ndv_2(unsigned long *vect,int col,UINT *s0vect);
7074:
7075: void red_by_vect_2(matrix mat,int *sugar,unsigned long *v,int rhead,int rsugar)
7076: {
7077: int row,col,wcol,wj,i,j;
7078: unsigned long bj;
7079: unsigned long *ai;
7080: unsigned long **a;
7081: int len;
7082: int *pos;
7083:
7084: row = mat->row;
7085: col = mat->col;
7086: wcol = (col+BLEN-1)/BLEN;
1.235 noro 7087: pos = (int *)MALLOC(wcol*sizeof(int));
1.220 noro 7088: bzero(pos,wcol*sizeof(int));
7089: for ( i = j = 0; i < wcol; i++ )
7090: if ( v[i] ) pos[j++] = i;;
7091: len = j;
7092: wj = rhead/BLEN;
7093: bj = 1L<<rhead%BLEN;
7094: a = mat->a;
7095: for ( i = 0; i < row; i++ ) {
7096: ai = a[i];
7097: if ( ai[wj]&bj ) {
7098: for ( j = 0; j < len; j++ )
7099: ai[pos[j]] ^= v[pos[j]];
7100: sugar[i] = MAX(sugar[i],rsugar);
7101: }
7102: }
7103: }
7104:
7105: NODE nd_f4_red_2(ND_pairs sp0,UINT *s0vect,int col,NODE rp0,ND_pairs *nz)
7106: {
7107: int nsp,nred,i,i0,k,rank,row;
7108: NODE r0,rp;
7109: ND_pairs sp;
7110: ND spol;
7111: NM_ind_pair rt;
7112: int *s0hash;
7113: UINT *s;
7114: int *pivot,*sugar,*head;
7115: matrix mat;
7116: NM m;
7117: NODE r;
7118: struct oEGT eg0,eg1,eg2,eg_elim1,eg_elim2;
7119: int rhead,rsugar,size;
7120: unsigned long *v;
7121:
7122: get_eg(&eg0);
7123: init_eg(&eg_search);
7124: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
7125: nred = length(rp0);
7126: mat = alloc_matrix(nsp,col);
1.235 noro 7127: s0hash = (int *)MALLOC(col*sizeof(int));
1.220 noro 7128: for ( i = 0, s = s0vect; i < col; i++, s += nd_wpd )
7129: s0hash[i] = ndl_hash_value(s);
7130:
1.235 noro 7131: sugar = (int *)MALLOC(nsp*sizeof(int));
1.220 noro 7132: for ( i = 0, sp = sp0; sp; sp = NEXT(sp) ) {
7133: nd_sp(2,0,sp,&spol);
7134: if ( spol ) {
7135: mat->a[i] = nd_to_vect_2(s0vect,col,s0hash,spol);
7136: sugar[i] = SG(spol);
7137: i++;
7138: }
7139: }
7140: mat->row = i;
1.227 noro 7141: if ( DP_Print ) {
7142: fprintf(asir_out,"%dx%d,",mat->row,mat->col); fflush(asir_out);
7143: }
1.220 noro 7144: size = ((col+BLEN-1)/BLEN)*sizeof(unsigned long);
7145: v = CALLOC((col+BLEN-1)/BLEN,sizeof(unsigned long));
7146: for ( rp = rp0, i = 0; rp; rp = NEXT(rp), i++ ) {
7147: rt = (NM_ind_pair)BDY(rp);
7148: bzero(v,size);
7149: rhead = nd_nm_to_vect_2(s0vect,col,s0hash,nd_ps[rt->index],rt->mul,v);
7150: rsugar = SG(nd_ps[rt->index])+TD(DL(rt->mul));
7151: red_by_vect_2(mat,sugar,v,rhead,rsugar);
7152: }
7153:
7154: get_eg(&eg1);
7155: init_eg(&eg_elim1); add_eg(&eg_elim1,&eg0,&eg1);
7156: rank = rref(mat,sugar);
7157:
7158: for ( i = 0, r0 = 0; i < rank; i++ ) {
7159: NEXTNODE(r0,r);
7160: BDY(r) = (pointer)vect_to_ndv_2(mat->a[i],col,s0vect);
7161: SG((NDV)BDY(r)) = sugar[i];
7162: }
7163: if ( r0 ) NEXT(r) = 0;
7164: get_eg(&eg2);
7165: init_eg(&eg_elim2); add_eg(&eg_elim2,&eg1,&eg2);
7166: if ( DP_Print ) {
7167: fprintf(asir_out,"elim1=%fsec,elim2=%fsec\n",
7168: eg_elim1.exectime+eg_elim1.gctime,eg_elim2.exectime+eg_elim2.gctime);
7169: fflush(asir_out);
7170: }
7171: return r0;
7172: }
7173:
7174:
1.133 noro 7175: NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz)
1.63 noro 7176: {
1.157 noro 7177: IndArray *imat;
7178: int nsp,nred,i;
7179: int *rhead;
7180: NODE r0,rp;
7181: ND_pairs sp;
7182: NM_ind_pair *rvect;
1.210 noro 7183: UINT *s;
7184: int *s0hash;
7185:
1.220 noro 7186: if ( m == 2 && nd_rref2 )
7187: return nd_f4_red_2(sp0,s0vect,col,rp0,nz);
7188:
1.198 noro 7189: init_eg(&eg_search);
1.157 noro 7190: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
7191: nred = length(rp0);
1.235 noro 7192: imat = (IndArray *)MALLOC(nred*sizeof(IndArray));
7193: rhead = (int *)MALLOC(col*sizeof(int));
1.157 noro 7194: for ( i = 0; i < col; i++ ) rhead[i] = 0;
7195:
7196: /* construction of index arrays */
1.227 noro 7197: if ( DP_Print ) {
7198: fprintf(stderr,"%dx%d,",nsp+nred,col);
7199: }
1.235 noro 7200: rvect = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair));
7201: s0hash = (int *)MALLOC(col*sizeof(int));
1.210 noro 7202: for ( i = 0, s = s0vect; i < col; i++, s += nd_wpd )
7203: s0hash[i] = ndl_hash_value(s);
1.157 noro 7204: for ( rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) {
7205: rvect[i] = (NM_ind_pair)BDY(rp);
1.235 noro 7206: imat[i] = nm_ind_pair_to_vect_compress(trace,s0vect,col,s0hash,rvect[i]);
1.157 noro 7207: rhead[imat[i]->head] = 1;
7208: }
1.239 ! noro 7209: #if defined(__GNUC__)
! 7210: if ( m >= (1<<15) )
! 7211: r0 = nd_f4_red_mod128_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz);
! 7212: else
! 7213: #endif
! 7214: if ( m > 0 )
1.157 noro 7215: r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz);
1.239 ! noro 7216: else if ( m == -1 )
! 7217: r0 = nd_f4_red_sf_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz);
1.232 noro 7218: else if ( m == -2 )
1.234 noro 7219: r0 = nd_f4_red_lf_main(m,sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred);
1.157 noro 7220: else
1.237 noro 7221: #if defined(VISUAL)
7222: r0 = nd_f4_red_q_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred);
7223: #else
1.215 noro 7224: r0 = nd_f4_red_gz_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred);
1.237 noro 7225: #endif
1.227 noro 7226: if ( DP_Print ) print_eg("search",&eg_search);
1.157 noro 7227: return r0;
1.106 noro 7228: }
1.74 noro 7229:
1.239 ! noro 7230: /* for Fp, 2<=p<2^16 */
! 7231:
1.106 noro 7232: NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
1.133 noro 7233: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz)
1.106 noro 7234: {
1.157 noro 7235: int spcol,sprow,a;
7236: int i,j,k,l,rank;
7237: NODE r0,r;
7238: ND_pairs sp;
7239: ND spol;
7240: int **spmat;
7241: UINT *svect,*v;
7242: int *colstat;
7243: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
7244: int maxrs;
7245: int *spsugar;
7246: ND_pairs *spactive;
7247:
7248: spcol = col-nred;
7249: get_eg(&eg0);
7250: /* elimination (1st step) */
1.235 noro 7251: spmat = (int **)MALLOC(nsp*sizeof(UINT *));
7252: svect = (UINT *)MALLOC(col*sizeof(UINT));
7253: spsugar = (int *)MALLOC(nsp*sizeof(int));
7254: spactive = !nz?0:(ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
1.157 noro 7255: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
7256: nd_sp(m,0,sp,&spol);
7257: if ( !spol ) continue;
7258: nd_to_vect(m,s0vect,col,spol,svect);
7259: if ( m == -1 )
7260: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred);
7261: else
7262: maxrs = ndv_reduce_vect(m,svect,col,imat,rvect,nred);
7263: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
7264: if ( i < col ) {
7265: spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT));
7266: for ( j = k = 0; j < col; j++ )
7267: if ( !rhead[j] ) v[k++] = svect[j];
7268: spsugar[sprow] = MAX(maxrs,SG(spol));
7269: if ( nz )
7270: spactive[sprow] = sp;
7271: sprow++;
7272: }
7273: nd_free(spol);
7274: }
7275: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
7276: if ( DP_Print ) {
7277: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
7278: fflush(asir_out);
7279: }
7280: /* free index arrays */
1.200 noro 7281: for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c);
1.157 noro 7282:
7283: /* elimination (2nd step) */
1.235 noro 7284: colstat = (int *)MALLOC(spcol*sizeof(int));
1.157 noro 7285: if ( m == -1 )
7286: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
7287: else
7288: rank = nd_gauss_elim_mod(spmat,spsugar,spactive,sprow,spcol,m,colstat);
7289: r0 = 0;
7290: for ( i = 0; i < rank; i++ ) {
7291: NEXTNODE(r0,r); BDY(r) =
7292: (pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
7293: SG((NDV)BDY(r)) = spsugar[i];
1.200 noro 7294: GCFREE(spmat[i]);
1.157 noro 7295: }
7296: if ( r0 ) NEXT(r) = 0;
7297:
1.200 noro 7298: for ( ; i < sprow; i++ ) GCFREE(spmat[i]);
1.157 noro 7299: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
7300: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
7301: if ( DP_Print ) {
7302: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
7303: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
7304: nsp,nred,sprow,spcol,rank);
7305: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
7306: }
7307: if ( nz ) {
7308: for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1];
7309: if ( rank > 0 ) {
7310: NEXT(spactive[rank-1]) = 0;
7311: *nz = spactive[0];
7312: } else
7313: *nz = 0;
7314: }
7315: return r0;
1.74 noro 7316: }
7317:
1.239 ! noro 7318: #if defined(__GNUC__)
! 7319: /* for Fp, 2^15=<p<2^29 */
! 7320:
! 7321: NODE nd_f4_red_mod128_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
! 7322: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz)
! 7323: {
! 7324: int spcol,sprow,a;
! 7325: int i,j,k,l,rank;
! 7326: NODE r0,r;
! 7327: ND_pairs sp;
! 7328: ND spol;
! 7329: U128 **spmat;
! 7330: U128 *svect,*v;
! 7331: int *colstat;
! 7332: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
! 7333: int maxrs;
! 7334: int *spsugar;
! 7335: ND_pairs *spactive;
! 7336: int **spmat32;
! 7337:
! 7338: spcol = col-nred;
! 7339: get_eg(&eg0);
! 7340: /* elimination (1st step) */
! 7341: spmat = (U128 **)MALLOC(nsp*sizeof(U128 *));
! 7342: svect = (U128 *)MALLOC(col*sizeof(U128));
! 7343: spsugar = (int *)MALLOC(nsp*sizeof(int));
! 7344: spactive = !nz?0:(ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
! 7345: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
! 7346: nd_sp(m,0,sp,&spol);
! 7347: if ( !spol ) continue;
! 7348: nd_to_vect128(m,s0vect,col,spol,svect);
! 7349: maxrs = ndv_reduce_vect128(m,svect,col,imat,rvect,nred);
! 7350: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
! 7351: if ( i < col ) {
! 7352: spmat[sprow] = v = (U128 *)MALLOC_ATOMIC(spcol*sizeof(U128));
! 7353: for ( j = k = 0; j < col; j++ )
! 7354: if ( !rhead[j] ) v[k++] = (UINT)svect[j];
! 7355: spsugar[sprow] = MAX(maxrs,SG(spol));
! 7356: if ( nz )
! 7357: spactive[sprow] = sp;
! 7358: sprow++;
! 7359: }
! 7360: nd_free(spol);
! 7361: }
! 7362: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
! 7363: if ( DP_Print ) {
! 7364: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
! 7365: fflush(asir_out);
! 7366: }
! 7367: /* free index arrays */
! 7368: for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c);
! 7369:
! 7370: /* elimination (2nd step) */
! 7371: colstat = (int *)MALLOC(spcol*sizeof(int));
! 7372: rank = nd_gauss_elim_mod128(spmat,spsugar,spactive,sprow,spcol,m,colstat);
! 7373: r0 = 0;
! 7374: for ( i = 0; i < rank; i++ ) {
! 7375: NEXTNODE(r0,r); BDY(r) =
! 7376: (pointer)vect128o_ndv(spmat[i],spcol,col,rhead,s0vect);
! 7377: SG((NDV)BDY(r)) = spsugar[i];
! 7378: GCFREE(spmat[i]);
! 7379: }
! 7380: if ( r0 ) NEXT(r) = 0;
! 7381:
! 7382: for ( ; i < sprow; i++ ) GCFREE(spmat[i]);
! 7383: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
! 7384: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
! 7385: if ( DP_Print ) {
! 7386: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
! 7387: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
! 7388: nsp,nred,sprow,spcol,rank);
! 7389: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
! 7390: }
! 7391: if ( nz ) {
! 7392: for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1];
! 7393: if ( rank > 0 ) {
! 7394: NEXT(spactive[rank-1]) = 0;
! 7395: *nz = spactive[0];
! 7396: } else
! 7397: *nz = 0;
! 7398: }
! 7399: return r0;
! 7400: }
! 7401: #endif
! 7402:
! 7403: /* for small finite fields */
! 7404:
! 7405: NODE nd_f4_red_sf_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
! 7406: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz)
! 7407: {
! 7408: int spcol,sprow,a;
! 7409: int i,j,k,l,rank;
! 7410: NODE r0,r;
! 7411: ND_pairs sp;
! 7412: ND spol;
! 7413: int **spmat;
! 7414: UINT *svect,*v;
! 7415: int *colstat;
! 7416: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
! 7417: int maxrs;
! 7418: int *spsugar;
! 7419: ND_pairs *spactive;
! 7420:
! 7421: spcol = col-nred;
! 7422: get_eg(&eg0);
! 7423: /* elimination (1st step) */
! 7424: spmat = (int **)MALLOC(nsp*sizeof(UINT *));
! 7425: svect = (UINT *)MALLOC(col*sizeof(UINT));
! 7426: spsugar = (int *)MALLOC(nsp*sizeof(int));
! 7427: spactive = !nz?0:(ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
! 7428: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
! 7429: nd_sp(m,0,sp,&spol);
! 7430: if ( !spol ) continue;
! 7431: nd_to_vect(m,s0vect,col,spol,svect);
! 7432: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred);
! 7433: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
! 7434: if ( i < col ) {
! 7435: spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT));
! 7436: for ( j = k = 0; j < col; j++ )
! 7437: if ( !rhead[j] ) v[k++] = svect[j];
! 7438: spsugar[sprow] = MAX(maxrs,SG(spol));
! 7439: if ( nz )
! 7440: spactive[sprow] = sp;
! 7441: sprow++;
! 7442: }
! 7443: nd_free(spol);
! 7444: }
! 7445: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
! 7446: if ( DP_Print ) {
! 7447: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
! 7448: fflush(asir_out);
! 7449: }
! 7450: /* free index arrays */
! 7451: for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c);
! 7452:
! 7453: /* elimination (2nd step) */
! 7454: colstat = (int *)MALLOC(spcol*sizeof(int));
! 7455: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
! 7456: r0 = 0;
! 7457: for ( i = 0; i < rank; i++ ) {
! 7458: NEXTNODE(r0,r); BDY(r) =
! 7459: (pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
! 7460: SG((NDV)BDY(r)) = spsugar[i];
! 7461: GCFREE(spmat[i]);
! 7462: }
! 7463: if ( r0 ) NEXT(r) = 0;
! 7464:
! 7465: for ( ; i < sprow; i++ ) GCFREE(spmat[i]);
! 7466: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
! 7467: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
! 7468: if ( DP_Print ) {
! 7469: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
! 7470: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
! 7471: nsp,nred,sprow,spcol,rank);
! 7472: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
! 7473: }
! 7474: if ( nz ) {
! 7475: for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1];
! 7476: if ( rank > 0 ) {
! 7477: NEXT(spactive[rank-1]) = 0;
! 7478: *nz = spactive[0];
! 7479: } else
! 7480: *nz = 0;
! 7481: }
! 7482: return r0;
! 7483: }
! 7484:
1.234 noro 7485: NODE nd_f4_red_lf_main(int m,ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
1.232 noro 7486: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
7487: {
7488: int spcol,sprow,a;
7489: int i,j,k,l,rank;
7490: NODE r0,r;
7491: ND_pairs sp;
7492: ND spol;
7493: mpz_t **spmat;
7494: mpz_t *svect,*v;
7495: int *colstat;
7496: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
7497: int maxrs;
7498: int *spsugar;
7499: pointer *w;
7500:
7501: spcol = col-nred;
7502: get_eg(&eg0);
7503: /* elimination (1st step) */
1.235 noro 7504: spmat = (mpz_t **)MALLOC(nsp*sizeof(mpz_t *));
7505: svect = (mpz_t *)MALLOC(col*sizeof(mpz_t));
7506: spsugar = (int *)MALLOC(nsp*sizeof(int));
1.232 noro 7507: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
1.234 noro 7508: nd_sp(m,trace,sp,&spol);
1.232 noro 7509: if ( !spol ) continue;
7510: nd_to_vect_lf(s0vect,col,spol,svect);
1.234 noro 7511: maxrs = ndv_reduce_vect_lf(svect,trace,col,imat,rvect,nred);
1.232 noro 7512: for ( i = 0; i < col; i++ ) if ( mpz_sgn(svect[i]) ) break;
7513: if ( i < col ) {
7514: spmat[sprow] = v = (mpz_t *)MALLOC(spcol*sizeof(mpz_t));
7515: for ( j = k = 0; j < col; j++ )
7516: if ( !rhead[j] ) v[k++][0] = svect[j][0];
7517: spsugar[sprow] = MAX(maxrs,SG(spol));
7518: sprow++;
7519: }
7520: /* nd_free(spol); */
7521: }
7522: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
7523: if ( DP_Print ) {
7524: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
7525: fflush(asir_out);
7526: }
7527: /* free index arrays */
7528: /* for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c); */
7529:
7530: /* elimination (2nd step) */
1.235 noro 7531: colstat = (int *)MALLOC(spcol*sizeof(int));
1.232 noro 7532: rank = nd_gauss_elim_lf(spmat,spsugar,sprow,spcol,colstat);
1.235 noro 7533: w = (pointer *)MALLOC(rank*sizeof(pointer));
1.232 noro 7534: for ( i = 0; i < rank; i++ ) {
7535: #if 0
7536: w[rank-i-1] = (pointer)vect_to_ndv_lf(spmat[i],spcol,col,rhead,s0vect);
7537: SG((NDV)w[rank-i-1]) = spsugar[i];
7538: #else
7539: w[i] = (pointer)vect_to_ndv_lf(spmat[i],spcol,col,rhead,s0vect);
7540: SG((NDV)w[i]) = spsugar[i];
7541: #endif
7542: /* GCFREE(spmat[i]); */
7543:
7544: }
7545: #if 0
7546: qsort(w,rank,sizeof(NDV),
7547: (int (*)(const void *,const void *))ndv_compare);
7548: #endif
7549: r0 = 0;
7550: for ( i = 0; i < rank; i++ ) {
7551: NEXTNODE(r0,r); BDY(r) = w[i];
7552: }
7553: if ( r0 ) NEXT(r) = 0;
7554:
7555: /* for ( ; i < sprow; i++ ) GCFREE(spmat[i]); */
7556: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
7557: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
7558: if ( DP_Print ) {
7559: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
7560: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
7561: nsp,nred,sprow,spcol,rank);
7562: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
7563: }
7564: return r0;
7565: }
7566:
1.133 noro 7567: #if 1
7568: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
1.107 noro 7569: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
7570: {
1.157 noro 7571: int spcol,sprow,a;
7572: int i,j,k,l,rank;
7573: NODE r0,r;
7574: ND_pairs sp;
7575: ND spol;
7576: Q **spmat;
7577: Q *svect,*v;
7578: int *colstat;
7579: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
7580: int maxrs;
7581: int *spsugar;
7582: pointer *w;
7583:
7584: spcol = col-nred;
7585: get_eg(&eg0);
7586: /* elimination (1st step) */
1.235 noro 7587: spmat = (Q **)MALLOC(nsp*sizeof(Q *));
7588: svect = (Q *)MALLOC(col*sizeof(Q));
7589: spsugar = (int *)MALLOC(nsp*sizeof(int));
1.157 noro 7590: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
7591: nd_sp(0,trace,sp,&spol);
7592: if ( !spol ) continue;
7593: nd_to_vect_q(s0vect,col,spol,svect);
7594: maxrs = ndv_reduce_vect_q(svect,trace,col,imat,rvect,nred);
7595: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
7596: if ( i < col ) {
7597: spmat[sprow] = v = (Q *)MALLOC(spcol*sizeof(Q));
7598: for ( j = k = 0; j < col; j++ )
7599: if ( !rhead[j] ) v[k++] = svect[j];
7600: spsugar[sprow] = MAX(maxrs,SG(spol));
7601: sprow++;
7602: }
7603: /* nd_free(spol); */
7604: }
7605: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
7606: if ( DP_Print ) {
7607: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
7608: fflush(asir_out);
7609: }
7610: /* free index arrays */
1.200 noro 7611: /* for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c); */
1.157 noro 7612:
7613: /* elimination (2nd step) */
1.235 noro 7614: colstat = (int *)MALLOC(spcol*sizeof(int));
1.157 noro 7615: rank = nd_gauss_elim_q(spmat,spsugar,sprow,spcol,colstat);
1.235 noro 7616: w = (pointer *)MALLOC(rank*sizeof(pointer));
1.157 noro 7617: for ( i = 0; i < rank; i++ ) {
1.213 noro 7618: #if 0
1.157 noro 7619: w[rank-i-1] = (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect);
7620: SG((NDV)w[rank-i-1]) = spsugar[i];
1.213 noro 7621: #else
7622: w[i] = (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect);
7623: SG((NDV)w[i]) = spsugar[i];
7624: #endif
1.200 noro 7625: /* GCFREE(spmat[i]); */
1.157 noro 7626: }
1.138 noro 7627: #if 0
1.157 noro 7628: qsort(w,rank,sizeof(NDV),
7629: (int (*)(const void *,const void *))ndv_compare);
1.137 noro 7630: #endif
1.157 noro 7631: r0 = 0;
7632: for ( i = 0; i < rank; i++ ) {
7633: NEXTNODE(r0,r); BDY(r) = w[i];
7634: }
7635: if ( r0 ) NEXT(r) = 0;
7636:
1.200 noro 7637: /* for ( ; i < sprow; i++ ) GCFREE(spmat[i]); */
1.157 noro 7638: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
7639: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
7640: if ( DP_Print ) {
7641: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
7642: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
7643: nsp,nred,sprow,spcol,rank);
7644: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
7645: }
7646: return r0;
1.107 noro 7647: }
1.215 noro 7648:
7649: NODE nd_f4_red_gz_main(ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col,
7650: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
7651: {
7652: int spcol,sprow,a;
7653: int i,j,k,l,rank;
7654: NODE r0,r;
7655: ND_pairs sp;
7656: ND spol;
7657: GZ **spmat;
7658: GZ *svect,*v;
7659: int *colstat;
7660: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
7661: int maxrs;
7662: int *spsugar;
7663: pointer *w;
7664:
7665: spcol = col-nred;
7666: get_eg(&eg0);
7667: /* elimination (1st step) */
1.235 noro 7668: spmat = (GZ **)MALLOC(nsp*sizeof(GZ *));
7669: svect = (GZ *)MALLOC(col*sizeof(GZ));
7670: spsugar = (int *)MALLOC(nsp*sizeof(int));
1.215 noro 7671: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
7672: nd_sp(0,trace,sp,&spol);
7673: if ( !spol ) continue;
7674: spol = ndtondgz(spol);
7675: nd_to_vect_q(s0vect,col,spol,(Q *)svect);
7676: maxrs = ndv_reduce_vect_gz(svect,trace,col,imat,rvect,nred);
7677: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
7678: if ( i < col ) {
7679: spmat[sprow] = v = (GZ *)MALLOC(spcol*sizeof(GZ));
7680: for ( j = k = 0; j < col; j++ )
7681: if ( !rhead[j] ) v[k++] = svect[j];
7682: spsugar[sprow] = MAX(maxrs,SG(spol));
7683: sprow++;
7684: }
7685: /* nd_free(spol); */
7686: }
7687: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
7688: if ( DP_Print ) {
7689: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
7690: fflush(asir_out);
7691: }
7692: /* free index arrays */
7693: /* for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c); */
7694:
7695: /* elimination (2nd step) */
1.235 noro 7696: colstat = (int *)MALLOC(spcol*sizeof(int));
1.215 noro 7697: rank = nd_gauss_elim_gz(spmat,spsugar,sprow,spcol,colstat);
1.235 noro 7698: w = (pointer *)MALLOC(rank*sizeof(pointer));
1.215 noro 7699: for ( i = 0; i < rank; i++ ) {
7700: #if 0
7701: w[rank-i-1] = (pointer)vect_to_ndv_gz(spmat[i],spcol,col,rhead,s0vect);
7702: w[rank-i-1] = ndvgztondv(w[rank-i-1]);
7703: SG((NDV)w[rank-i-1]) = spsugar[i];
7704: #else
1.232 noro 7705: w[i] = (pointer)vect_to_ndv_gz(spmat[i],spcol,col,rhead,s0vect);
1.215 noro 7706: w[i] = ndvgztondv(w[i]);
7707: SG((NDV)w[i]) = spsugar[i];
7708: #endif
7709: /* GCFREE(spmat[i]); */
7710:
7711: }
7712: #if 0
7713: qsort(w,rank,sizeof(NDV),
7714: (int (*)(const void *,const void *))ndv_compare);
7715: #endif
7716: r0 = 0;
7717: for ( i = 0; i < rank; i++ ) {
7718: NEXTNODE(r0,r); BDY(r) = w[i];
7719: }
7720: if ( r0 ) NEXT(r) = 0;
7721:
7722: /* for ( ; i < sprow; i++ ) GCFREE(spmat[i]); */
7723: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
7724: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
7725: if ( DP_Print ) {
7726: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
7727: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
7728: nsp,nred,sprow,spcol,rank);
7729: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
7730: }
7731: return r0;
7732: }
1.129 noro 7733: #else
7734: void printm(Q **mat,int row,int col)
7735: {
1.157 noro 7736: int i,j;
7737: printf("[");
7738: for ( i = 0; i < row; i++ ) {
7739: for ( j = 0; j < col; j++ ) {
7740: printexpr(CO,mat[i][j]); printf(" ");
7741: }
7742: printf("]\n");
7743: }
1.129 noro 7744: }
7745:
7746: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vect,int col,
7747: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
7748: {
1.157 noro 7749: int row,a;
7750: int i,j,rank;
7751: NODE r0,r;
7752: ND_pairs sp;
7753: ND spol;
7754: Q **mat;
7755: int *colstat;
7756: int *sugar;
7757:
7758: row = nsp+nred;
7759: /* make the matrix */
1.235 noro 7760: mat = (Q **)MALLOC(row*sizeof(Q *));
7761: sugar = (int *)MALLOC(row*sizeof(int));
1.157 noro 7762: for ( row = a = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
7763: nd_sp(0,0,sp,&spol);
7764: if ( !spol ) continue;
7765: mat[row] = (Q *)MALLOC(col*sizeof(Q));
7766: nd_to_vect_q(s0vect,col,spol,mat[row]);
7767: sugar[row] = SG(spol);
7768: row++;
7769: }
7770: for ( i = 0; i < nred; i++, row++ ) {
7771: mat[row] = nm_ind_pair_to_vect(0,s0vect,col,rvect[i]);
7772: sugar[row] = rvect[i]->sugar;
7773: }
7774: /* elimination */
1.235 noro 7775: colstat = (int *)MALLOC(col*sizeof(int));
1.157 noro 7776: rank = nd_gauss_elim_q(mat,sugar,row,col,colstat);
7777: r0 = 0;
7778: for ( i = 0; i < rank; i++ ) {
7779: for ( j = 0; j < col; j++ ) if ( mat[i][j] ) break;
7780: if ( j == col ) error("nd_f4_red_q_main : cannot happen");
7781: if ( rhead[j] ) continue;
7782: NEXTNODE(r0,r); BDY(r) =
7783: (pointer)plain_vect_to_ndv_q(mat[i],col,s0vect);
7784: SG((NDV)BDY(r)) = sugar[i];
7785: }
7786: if ( r0 ) NEXT(r) = 0;
7787: printf("\n");
7788: return r0;
1.129 noro 7789: }
7790: #endif
1.107 noro 7791:
1.74 noro 7792: FILE *nd_write,*nd_read;
7793:
7794: void nd_send_int(int a) {
1.157 noro 7795: write_int(nd_write,&a);
1.74 noro 7796: }
7797:
7798: void nd_send_intarray(int *p,int len) {
1.157 noro 7799: write_intarray(nd_write,p,len);
1.74 noro 7800: }
7801:
7802: int nd_recv_int() {
1.157 noro 7803: int a;
1.74 noro 7804:
1.157 noro 7805: read_int(nd_read,&a);
7806: return a;
1.74 noro 7807: }
7808:
7809: void nd_recv_intarray(int *p,int len) {
1.157 noro 7810: read_intarray(nd_read,p,len);
1.74 noro 7811: }
7812:
7813: void nd_send_ndv(NDV p) {
1.157 noro 7814: int len,i;
7815: NMV m;
1.74 noro 7816:
1.157 noro 7817: if ( !p ) nd_send_int(0);
7818: else {
7819: len = LEN(p);
7820: nd_send_int(len);
7821: m = BDY(p);
7822: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
7823: nd_send_int(CM(m));
7824: nd_send_intarray(DL(m),nd_wpd);
7825: }
7826: }
1.74 noro 7827: }
7828:
7829: void nd_send_nd(ND p) {
1.157 noro 7830: int len,i;
7831: NM m;
1.74 noro 7832:
1.157 noro 7833: if ( !p ) nd_send_int(0);
7834: else {
7835: len = LEN(p);
7836: nd_send_int(len);
7837: m = BDY(p);
7838: for ( i = 0; i < len; i++, m = NEXT(m) ) {
7839: nd_send_int(CM(m));
7840: nd_send_intarray(DL(m),nd_wpd);
7841: }
7842: }
1.74 noro 7843: }
1.65 noro 7844:
1.74 noro 7845: NDV nd_recv_ndv()
7846: {
1.157 noro 7847: int len,i;
7848: NMV m,m0;
7849: NDV r;
7850:
7851: len = nd_recv_int();
7852: if ( !len ) return 0;
7853: else {
1.200 noro 7854: m0 = m = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len);
1.103 noro 7855: #if 0
1.157 noro 7856: ndv_alloc += len*nmv_adv;
1.103 noro 7857: #endif
1.157 noro 7858: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
7859: CM(m) = nd_recv_int();
7860: nd_recv_intarray(DL(m),nd_wpd);
7861: }
7862: MKNDV(nd_nvar,m0,len,r);
7863: return r;
7864: }
1.74 noro 7865: }
1.65 noro 7866:
1.113 noro 7867: int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int col,int *colstat)
1.107 noro 7868: {
1.176 noro 7869: int i,j,t,c,rank,inv;
1.157 noro 7870: int *ci,*ri;
7871: Q dn;
7872: MAT m,nm;
7873:
7874: NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0;
7875: rank = generic_gauss_elim(m,&nm,&dn,&ri,&ci);
7876: for ( i = 0; i < row; i++ )
7877: for ( j = 0; j < col; j++ )
7878: mat0[i][j] = 0;
7879: c = col-rank;
7880: for ( i = 0; i < rank; i++ ) {
7881: mat0[i][ri[i]] = dn;
7882: for ( j = 0; j < c; j++ )
7883: mat0[i][ci[j]] = (Q)BDY(nm)[i][j];
7884: }
7885: return rank;
1.76 noro 7886: }
7887:
1.215 noro 7888: int nd_gauss_elim_gz(GZ **mat0,int *sugar,int row,int col,int *colstat)
7889: {
7890: int i,j,t,c,rank,inv;
7891: int *ci,*ri;
1.216 noro 7892: GZ dn;
1.215 noro 7893: MAT m,nm;
7894:
7895: NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0;
1.216 noro 7896: rank = gz_generic_gauss_elim(m,&nm,&dn,&ri,&ci);
1.215 noro 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++ ) {
1.216 noro 7902: mat0[i][ri[i]] = dn;
1.215 noro 7903: for ( j = 0; j < c; j++ )
7904: mat0[i][ci[j]] = (GZ)BDY(nm)[i][j];
7905: }
7906: return rank;
7907: }
7908:
1.133 noro 7909: int nd_gauss_elim_mod(int **mat0,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat)
1.76 noro 7910: {
1.157 noro 7911: int i,j,k,l,inv,a,rank,s;
7912: unsigned int *t,*pivot,*pk;
7913: unsigned int **mat;
7914: ND_pairs pair;
7915:
7916: mat = (unsigned int **)mat0;
7917: for ( rank = 0, j = 0; j < col; j++ ) {
7918: for ( i = rank; i < row; i++ )
7919: mat[i][j] %= md;
7920: for ( i = rank; i < row; i++ )
7921: if ( mat[i][j] )
7922: break;
7923: if ( i == row ) {
7924: colstat[j] = 0;
7925: continue;
7926: } else
7927: colstat[j] = 1;
7928: if ( i != rank ) {
7929: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
7930: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
7931: if ( spactive ) {
7932: pair = spactive[i]; spactive[i] = spactive[rank];
7933: spactive[rank] = pair;
7934: }
7935: }
7936: pivot = mat[rank];
7937: s = sugar[rank];
7938: inv = invm(pivot[j],md);
7939: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
7940: if ( *pk ) {
7941: if ( *pk >= (unsigned int)md )
7942: *pk %= md;
7943: DMAR(*pk,inv,0,md,*pk)
7944: }
7945: for ( i = rank+1; i < row; i++ ) {
7946: t = mat[i];
7947: if ( a = t[j] ) {
7948: sugar[i] = MAX(sugar[i],s);
7949: red_by_vect(md,t+j,pivot+j,md-a,col-j);
7950: }
7951: }
7952: rank++;
7953: }
7954: for ( j = col-1, l = rank-1; j >= 0; j-- )
7955: if ( colstat[j] ) {
7956: pivot = mat[l];
7957: s = sugar[l];
7958: for ( i = 0; i < l; i++ ) {
7959: t = mat[i];
7960: t[j] %= md;
7961: if ( a = t[j] ) {
7962: sugar[i] = MAX(sugar[i],s);
7963: red_by_vect(md,t+j,pivot+j,md-a,col-j);
7964: }
7965: }
7966: l--;
7967: }
7968: for ( j = 0, l = 0; l < rank; j++ )
7969: if ( colstat[j] ) {
7970: t = mat[l];
7971: for ( k = j; k < col; k++ )
7972: if ( t[k] >= (unsigned int)md )
7973: t[k] %= md;
7974: l++;
7975: }
7976: return rank;
1.76 noro 7977: }
7978:
1.239 ! noro 7979: #if defined(__GNUC__)
! 7980: int nd_gauss_elim_mod128(U128 **mat,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat)
! 7981: {
! 7982: int i,j,k,l,rank,s;
! 7983: U64 inv;
! 7984: U128 a;
! 7985: U128 *t,*pivot,*pk;
! 7986: ND_pairs pair;
! 7987:
! 7988: for ( rank = 0, j = 0; j < col; j++ ) {
! 7989: for ( i = rank; i < row; i++ )
! 7990: mat[i][j] %= md;
! 7991: for ( i = rank; i < row; i++ )
! 7992: if ( mat[i][j] )
! 7993: break;
! 7994: if ( i == row ) {
! 7995: colstat[j] = 0;
! 7996: continue;
! 7997: } else
! 7998: colstat[j] = 1;
! 7999: if ( i != rank ) {
! 8000: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
! 8001: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
! 8002: if ( spactive ) {
! 8003: pair = spactive[i]; spactive[i] = spactive[rank];
! 8004: spactive[rank] = pair;
! 8005: }
! 8006: }
! 8007: pivot = mat[rank];
! 8008: s = sugar[rank];
! 8009: inv = invm((UINT)pivot[j],md);
! 8010: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
! 8011: if ( a = *pk ) {
! 8012: if ( a >= md ) a %= md;
! 8013: *pk = ((U64)a*inv)%md;
! 8014: }
! 8015: for ( i = rank+1; i < row; i++ ) {
! 8016: t = mat[i];
! 8017: if ( a = (t[j]%md) ) {
! 8018: sugar[i] = MAX(sugar[i],s);
! 8019: red_by_vect128(md,t+j,pivot+j,(int)(md-a),col-j);
! 8020: }
! 8021: }
! 8022: rank++;
! 8023: }
! 8024: for ( j = col-1, l = rank-1; j >= 0; j-- )
! 8025: if ( colstat[j] ) {
! 8026: pivot = mat[l];
! 8027: for ( k = j; k < col; k++ )
! 8028: if ( pivot[k] >= md ) pivot[k] %= md;
! 8029: s = sugar[l];
! 8030: for ( i = 0; i < l; i++ ) {
! 8031: t = mat[i];
! 8032: t[j] %= md;
! 8033: if ( a = (t[j]%md) ) {
! 8034: sugar[i] = MAX(sugar[i],s);
! 8035: red_by_vect128(md,t+j,pivot+j,(int)(md-a),col-j);
! 8036: }
! 8037: }
! 8038: l--;
! 8039: }
! 8040: return rank;
! 8041: }
! 8042: #endif
! 8043:
1.76 noro 8044: int nd_gauss_elim_sf(int **mat0,int *sugar,int row,int col,int md,int *colstat)
8045: {
1.157 noro 8046: int i,j,k,l,inv,a,rank,s;
8047: unsigned int *t,*pivot,*pk;
8048: unsigned int **mat;
8049:
8050: mat = (unsigned int **)mat0;
8051: for ( rank = 0, j = 0; j < col; j++ ) {
8052: for ( i = rank; i < row; i++ )
8053: if ( mat[i][j] )
8054: break;
8055: if ( i == row ) {
8056: colstat[j] = 0;
8057: continue;
8058: } else
8059: colstat[j] = 1;
8060: if ( i != rank ) {
8061: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
8062: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
8063: }
8064: pivot = mat[rank];
8065: s = sugar[rank];
8066: inv = _invsf(pivot[j]);
8067: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
8068: if ( *pk )
8069: *pk = _mulsf(*pk,inv);
8070: for ( i = rank+1; i < row; i++ ) {
8071: t = mat[i];
8072: if ( a = t[j] ) {
8073: sugar[i] = MAX(sugar[i],s);
8074: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
8075: }
8076: }
8077: rank++;
8078: }
8079: for ( j = col-1, l = rank-1; j >= 0; j-- )
8080: if ( colstat[j] ) {
8081: pivot = mat[l];
8082: s = sugar[l];
8083: for ( i = 0; i < l; i++ ) {
8084: t = mat[i];
8085: if ( a = t[j] ) {
8086: sugar[i] = MAX(sugar[i],s);
8087: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
8088: }
8089: }
8090: l--;
8091: }
8092: return rank;
1.77 noro 8093: }
8094:
8095: int ndv_ishomo(NDV p)
8096: {
1.157 noro 8097: NMV m;
8098: int len,h;
1.77 noro 8099:
1.157 noro 8100: if ( !p ) return 1;
8101: len = LEN(p);
8102: m = BDY(p);
8103: h = TD(DL(m));
8104: NMV_ADV(m);
8105: for ( len--; len; len--, NMV_ADV(m) )
8106: if ( TD(DL(m)) != h ) return 0;
8107: return 1;
1.77 noro 8108: }
8109:
8110: void ndv_save(NDV p,int index)
8111: {
1.157 noro 8112: FILE *s;
8113: char name[BUFSIZ];
8114: short id;
8115: int nv,sugar,len,n,i,td,e,j;
8116: NMV m;
8117: unsigned int *dl;
8118: int mpos;
8119:
8120: sprintf(name,"%s/%d",Demand,index);
8121: s = fopen(name,"w");
8122: savevl(s,0);
8123: if ( !p ) {
8124: saveobj(s,0);
8125: return;
8126: }
8127: id = O_DP;
8128: nv = NV(p);
8129: sugar = SG(p);
8130: len = LEN(p);
8131: write_short(s,&id); write_int(s,&nv); write_int(s,&sugar);
8132: write_int(s,&len);
8133:
8134: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
8135: saveobj(s,(Obj)CQ(m));
8136: dl = DL(m);
8137: td = TD(dl);
8138: write_int(s,&td);
8139: for ( j = 0; j < nv; j++ ) {
8140: e = GET_EXP(dl,j);
8141: write_int(s,&e);
8142: }
8143: if ( nd_module ) {
8144: mpos = MPOS(dl); write_int(s,&mpos);
8145: }
8146: }
8147: fclose(s);
1.77 noro 8148: }
8149:
1.206 noro 8150: void nd_save_mod(ND p,int index)
8151: {
8152: FILE *s;
8153: char name[BUFSIZ];
8154: int nv,sugar,len,c;
8155: NM m;
8156:
8157: sprintf(name,"%s/%d",Demand,index);
8158: s = fopen(name,"w");
8159: if ( !p ) {
8160: len = 0;
8161: write_int(s,&len);
8162: fclose(s);
8163: return;
8164: }
8165: nv = NV(p);
8166: sugar = SG(p);
8167: len = LEN(p);
8168: write_int(s,&nv); write_int(s,&sugar); write_int(s,&len);
8169: for ( m = BDY(p); m; m = NEXT(m) ) {
8170: c = CM(m); write_int(s,&c);
8171: write_intarray(s,DL(m),nd_wpd);
8172: }
8173: fclose(s);
8174: }
8175:
1.77 noro 8176: NDV ndv_load(int index)
8177: {
1.157 noro 8178: FILE *s;
8179: char name[BUFSIZ];
8180: short id;
8181: int nv,sugar,len,n,i,td,e,j;
8182: NDV d;
8183: NMV m0,m;
8184: unsigned int *dl;
8185: Obj obj;
8186: int mpos;
8187:
8188: sprintf(name,"%s/%d",Demand,index);
8189: s = fopen(name,"r");
8190: if ( !s ) return 0;
8191:
8192: skipvl(s);
8193: read_short(s,&id);
8194: if ( !id ) return 0;
8195: read_int(s,&nv);
8196: read_int(s,&sugar);
8197: read_int(s,&len);
8198:
8199: m0 = m = MALLOC(len*nmv_adv);
8200: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
8201: loadobj(s,&obj); CQ(m) = (Q)obj;
8202: dl = DL(m);
8203: ndl_zero(dl);
8204: read_int(s,&td); TD(dl) = td;
8205: for ( j = 0; j < nv; j++ ) {
8206: read_int(s,&e);
8207: PUT_EXP(dl,j,e);
8208: }
8209: if ( nd_module ) {
8210: read_int(s,&mpos); MPOS(dl) = mpos;
8211: }
8212: if ( nd_blockmask ) ndl_weight_mask(dl);
8213: }
8214: fclose(s);
8215: MKNDV(nv,m0,len,d);
8216: SG(d) = sugar;
8217: return d;
1.99 noro 8218: }
8219:
1.206 noro 8220: ND nd_load_mod(int index)
8221: {
8222: FILE *s;
8223: char name[BUFSIZ];
8224: int nv,sugar,len,i,c;
8225: ND d;
8226: NM m0,m;
8227:
8228: sprintf(name,"%s/%d",Demand,index);
8229: s = fopen(name,"r");
8230: /* if the file does not exist, it means p[index]=0 */
8231: if ( !s ) return 0;
8232:
8233: read_int(s,&nv);
8234: if ( !nv ) { fclose(s); return 0; }
8235:
8236: read_int(s,&sugar);
8237: read_int(s,&len);
8238: for ( m0 = 0, i = 0; i < len; i++ ) {
8239: NEXTNM(m0,m);
8240: read_int(s,&c); CM(m) = c;
8241: read_intarray(s,DL(m),nd_wpd);
8242: }
8243: NEXT(m) = 0;
8244: MKND(nv,m0,len,d);
8245: SG(d) = sugar;
8246: fclose(s);
8247: return d;
8248: }
8249:
1.102 noro 8250: void nd_det(int mod,MAT f,P *rp)
1.99 noro 8251: {
1.157 noro 8252: VL fv,tv;
8253: int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a;
8254: pointer **m;
8255: Q mone;
8256: P **w;
8257: P mp,r;
8258: NDV **dm;
8259: NDV *t,*mi,*mj;
8260: NDV d,s,mij,mjj;
8261: ND u;
8262: NMV nmv;
8263: UINT *bound;
8264: PGeoBucket bucket;
8265: struct order_spec *ord;
8266: Q dq,dt,ds;
8267: N gn,qn,dn0,nm,dn;
8268:
8269: create_order_spec(0,0,&ord);
8270: nd_init_ord(ord);
8271: get_vars((Obj)f,&fv);
8272: if ( f->row != f->col )
8273: error("nd_det : non-square matrix");
8274: n = f->row;
8275: m = f->body;
8276: for ( nvar = 0, tv = fv; tv; tv = NEXT(tv), nvar++ );
8277:
8278: if ( !nvar ) {
8279: if ( !mod )
8280: detp(CO,(P **)m,n,rp);
8281: else {
8282: w = (P **)almat_pointer(n,n);
8283: for ( i = 0; i < n; i++ )
8284: for ( j = 0; j < n; j++ )
8285: ptomp(mod,(P)m[i][j],&w[i][j]);
8286: detmp(CO,mod,w,n,&mp);
8287: mptop(mp,rp);
8288: }
8289: return;
8290: }
8291:
8292: if ( !mod ) {
8293: w = (P **)almat_pointer(n,n);
8294: dq = ONE;
8295: for ( i = 0; i < n; i++ ) {
8296: dn0 = ONEN;
8297: for ( j = 0; j < n; j++ ) {
8298: if ( !m[i][j] ) continue;
8299: lgp(m[i][j],&nm,&dn);
8300: gcdn(dn0,dn,&gn); divsn(dn0,gn,&qn); muln(qn,dn,&dn0);
8301: }
8302: if ( !UNIN(dn0) ) {
8303: NTOQ(dn0,1,ds);
8304: for ( j = 0; j < n; j++ )
8305: mulp(CO,(P)m[i][j],(P)ds,&w[i][j]);
8306: mulq(dq,ds,&dt); dq = dt;
8307: } else
8308: for ( j = 0; j < n; j++ )
8309: w[i][j] = (P)m[i][j];
8310: }
8311: m = (pointer **)w;
8312: }
8313:
1.178 noro 8314: for ( i = 0, max = 1; i < n; i++ )
1.157 noro 8315: for ( j = 0; j < n; j++ )
8316: for ( tv = fv; tv; tv = NEXT(tv) ) {
8317: e = getdeg(tv->v,(P)m[i][j]);
8318: max = MAX(e,max);
8319: }
8320: nd_setup_parameters(nvar,max);
8321: dm = (NDV **)almat_pointer(n,n);
1.178 noro 8322: for ( i = 0, max = 1; i < n; i++ )
1.157 noro 8323: for ( j = 0; j < n; j++ ) {
8324: dm[i][j] = ptondv(CO,fv,m[i][j]);
8325: if ( mod ) ndv_mod(mod,dm[i][j]);
8326: if ( dm[i][j] && !LEN(dm[i][j]) ) dm[i][j] = 0;
8327: }
8328: d = ptondv(CO,fv,(P)ONE);
8329: if ( mod ) ndv_mod(mod,d);
8330: chsgnq(ONE,&mone);
8331: for ( j = 0, sgn = 1; j < n; j++ ) {
1.222 fujimoto 8332: if ( DP_Print ) {
8333: fprintf(stderr,".",j);
8334: }
1.157 noro 8335: for ( i = j; i < n && !dm[i][j]; i++ );
8336: if ( i == n ) {
8337: *rp = 0;
8338: return;
8339: }
8340: k0 = i; l0 = j; len0 = LEN(dm[k0][l0]);
8341: for ( k = j; k < n; k++ )
8342: for ( l = j; l < n; l++ )
8343: if ( dm[k][l] && LEN(dm[k][l]) < len0 ) {
8344: k0 = k; l0 = l; len0 = LEN(dm[k][l]);
8345: }
8346: if ( k0 != j ) {
8347: t = dm[j]; dm[j] = dm[k0]; dm[k0] = t;
8348: sgn = -sgn;
8349: }
8350: if ( l0 != j ) {
8351: for ( k = j; k < n; k++ ) {
8352: s = dm[k][j]; dm[k][j] = dm[k][l0]; dm[k][l0] = s;
8353: }
8354: sgn = -sgn;
8355: }
8356: bound = nd_det_compute_bound(dm,n,j);
8357: for ( k = 0; k < nd_nvar; k++ )
8358: if ( bound[k]*2 > nd_mask0 ) break;
8359: if ( k < nd_nvar )
8360: nd_det_reconstruct(dm,n,j,d);
8361:
8362: for ( i = j+1, mj = dm[j], mjj = mj[j]; i < n; i++ ) {
8363: /* if ( DP_Print ) fprintf(stderr," i=%d\n ",i); */
8364: mi = dm[i]; mij = mi[j];
8365: if ( mod )
8366: ndv_mul_c(mod,mij,mod-1);
8367: else
8368: ndv_mul_c_q(mij,mone);
8369: for ( k = j+1; k < n; k++ ) {
8370: /* if ( DP_Print ) fprintf(stderr,"k=%d ",k); */
8371: bucket = create_pbucket();
8372: if ( mi[k] ) {
8373: nmv = BDY(mjj); len = LEN(mjj);
8374: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
8375: u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d)));
8376: add_pbucket(mod,bucket,u);
8377: }
8378: }
8379: if ( mj[k] && mij ) {
8380: nmv = BDY(mij); len = LEN(mij);
8381: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
8382: u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d)));
8383: add_pbucket(mod,bucket,u);
8384: }
8385: }
8386: u = nd_quo(mod,bucket,d);
8387: mi[k] = ndtondv(mod,u);
8388: }
8389: /* if ( DP_Print ) fprintf(stderr,"\n",k); */
8390: }
8391: d = mjj;
8392: }
1.222 fujimoto 8393: if ( DP_Print ) {
8394: fprintf(stderr,"\n",k);
8395: }
1.157 noro 8396: if ( sgn < 0 )
8397: if ( mod )
8398: ndv_mul_c(mod,d,mod-1);
8399: else
8400: ndv_mul_c_q(d,mone);
8401: r = ndvtop(mod,CO,fv,d);
8402: if ( !mod && !UNIQ(dq) )
8403: divsp(CO,r,(P)dq,rp);
8404: else
8405: *rp = r;
1.99 noro 8406: }
8407:
1.102 noro 8408: ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d)
1.99 noro 8409: {
1.157 noro 8410: NM mr,mr0;
8411: NM tnm;
8412: NMV m;
8413: UINT *d0,*dt,*dm;
8414: int c,n,td,i,c1,c2,len;
8415: Q q;
8416: ND r;
8417:
8418: if ( !p ) return 0;
8419: else {
8420: n = NV(p); m = BDY(p); len = LEN(p);
8421: d0 = DL(m0);
8422: td = TD(d);
8423: mr0 = 0;
8424: NEWNM(tnm);
8425: if ( mod ) {
8426: c = CM(m0);
8427: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
8428: ndl_add(DL(m),d0,DL(tnm));
8429: if ( ndl_reducible(DL(tnm),d) ) {
8430: NEXTNM(mr0,mr);
8431: c1 = CM(m); DMAR(c1,c,0,mod,c2); CM(mr) = c2;
8432: ndl_copy(DL(tnm),DL(mr));
8433: }
8434: }
8435: } else {
8436: q = CQ(m0);
8437: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
8438: ndl_add(DL(m),d0,DL(tnm));
8439: if ( ndl_reducible(DL(tnm),d) ) {
8440: NEXTNM(mr0,mr);
8441: mulq(CQ(m),q,&CQ(mr));
8442: ndl_copy(DL(tnm),DL(mr));
8443: }
8444: }
8445: }
8446: if ( !mr0 )
8447: return 0;
8448: else {
8449: NEXT(mr) = 0;
8450: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
8451: MKND(NV(p),mr0,len,r);
8452: SG(r) = SG(p) + TD(d0);
8453: return r;
8454: }
8455: }
1.114 noro 8456: }
8457:
8458: void nd_det_reconstruct(NDV **dm,int n,int j,NDV d)
8459: {
1.157 noro 8460: int i,obpe,oadv,h,k,l;
8461: static NM prev_nm_free_list;
8462: EPOS oepos;
8463:
8464: obpe = nd_bpe;
8465: oadv = nmv_adv;
8466: oepos = nd_epos;
8467: if ( obpe < 2 ) nd_bpe = 2;
8468: else if ( obpe < 3 ) nd_bpe = 3;
8469: else if ( obpe < 4 ) nd_bpe = 4;
8470: else if ( obpe < 5 ) nd_bpe = 5;
8471: else if ( obpe < 6 ) nd_bpe = 6;
8472: else if ( obpe < 8 ) nd_bpe = 8;
8473: else if ( obpe < 10 ) nd_bpe = 10;
8474: else if ( obpe < 16 ) nd_bpe = 16;
8475: else if ( obpe < 32 ) nd_bpe = 32;
8476: else error("nd_det_reconstruct : exponent too large");
8477:
8478: nd_setup_parameters(nd_nvar,0);
8479: prev_nm_free_list = _nm_free_list;
8480: _nm_free_list = 0;
8481: for ( k = j; k < n; k++ )
8482: for (l = j; l < n; l++ )
8483: ndv_realloc(dm[k][l],obpe,oadv,oepos);
8484: ndv_realloc(d,obpe,oadv,oepos);
8485: prev_nm_free_list = 0;
1.114 noro 8486: #if 0
1.157 noro 8487: GC_gcollect();
1.114 noro 8488: #endif
8489: }
8490:
1.153 noro 8491: /* returns a UINT array containing degree bounds */
8492:
1.114 noro 8493: UINT *nd_det_compute_bound(NDV **dm,int n,int j)
8494: {
1.157 noro 8495: UINT *d0,*d1,*d,*t,*r;
8496: int k,l,i;
1.114 noro 8497:
1.157 noro 8498: d0 = (UINT *)MALLOC(nd_nvar*sizeof(UINT));
8499: for ( k = 0; k < nd_nvar; k++ ) d0[k] = 0;
8500: for ( k = j; k < n; k++ )
8501: for ( l = j; l < n; l++ )
8502: if ( dm[k][l] ) {
8503: d = ndv_compute_bound(dm[k][l]);
8504: for ( i = 0; i < nd_nvar; i++ )
8505: d0[i] = MAX(d0[i],d[i]);
8506: }
8507: return d0;
1.117 noro 8508: }
8509:
8510: DL nd_separate_d(UINT *d,UINT *trans)
8511: {
1.157 noro 8512: int n,td,i,e,j;
8513: DL a;
1.117 noro 8514:
1.157 noro 8515: ndl_zero(trans);
8516: td = 0;
8517: for ( i = 0; i < nd_ntrans; i++ ) {
8518: e = GET_EXP(d,i);
8519: PUT_EXP(trans,i,e);
8520: td += MUL_WEIGHT(e,i);
8521: }
8522: if ( nd_ntrans+nd_nalg < nd_nvar ) {
8523: /* homogenized */
8524: i = nd_nvar-1;
8525: e = GET_EXP(d,i);
8526: PUT_EXP(trans,i,e);
8527: td += MUL_WEIGHT(e,i);
8528: }
8529: TD(trans) = td;
8530: if ( nd_blockmask) ndl_weight_mask(trans);
8531: NEWDL(a,nd_nalg);
8532: td = 0;
8533: for ( i = 0; i < nd_nalg; i++ ) {
8534: j = nd_ntrans+i;
8535: e = GET_EXP(d,j);
8536: a->d[i] = e;
8537: td += e;
8538: }
8539: a->td = td;
8540: return a;
1.117 noro 8541: }
8542:
1.118 noro 8543: int nd_monic(int mod,ND *p)
1.117 noro 8544: {
1.157 noro 8545: UINT *trans,*t;
8546: DL alg;
8547: MP mp0,mp;
8548: NM m,m0,m1,ma0,ma,mb,mr0,mr;
8549: ND r;
8550: DL dl;
8551: DP nm;
8552: NDV ndv;
8553: DAlg inv,cd;
8554: ND s,c;
8555: Q l,mul;
8556: N ln;
8557: int n,ntrans,i,e,td,is_lc,len;
8558: NumberField nf;
8559: struct oEGT eg0,eg1;
8560:
8561: if ( !(nf = get_numberfield()) )
8562: error("nd_monic : current_numberfield is not set");
8563:
8564: /* Q coef -> DAlg coef */
8565: NEWNM(ma0); ma = ma0;
8566: m = BDY(*p);
8567: is_lc = 1;
8568: while ( 1 ) {
8569: NEWMP(mp0); mp = mp0;
1.238 noro 8570: mp->c = (Obj)CQ(m);
1.157 noro 8571: mp->dl = nd_separate_d(DL(m),DL(ma));
8572: NEWNM(mb);
8573: for ( m = NEXT(m); m; m = NEXT(m) ) {
8574: alg = nd_separate_d(DL(m),DL(mb));
8575: if ( !ndl_equal(DL(ma),DL(mb)) )
8576: break;
1.238 noro 8577: NEXTMP(mp0,mp); mp->c = (Obj)CQ(m); mp->dl = alg;
1.157 noro 8578: }
8579: NEXT(mp) = 0;
8580: MKDP(nd_nalg,mp0,nm);
8581: MKDAlg(nm,ONE,cd);
8582: if ( is_lc == 1 ) {
8583: /* if the lc is a rational number, we have nothing to do */
8584: if ( !mp0->dl->td )
8585: return 1;
8586:
8587: get_eg(&eg0);
8588: invdalg(cd,&inv);
8589: get_eg(&eg1); add_eg(&eg_invdalg,&eg0,&eg1);
8590: /* check the validity of inv */
8591: if ( mod && !rem(NM(inv->dn),mod) )
8592: return 0;
8593: CA(ma) = nf->one;
8594: is_lc = 0;
8595: ln = ONEN;
8596: } else {
8597: muldalg(cd,inv,&CA(ma));
8598: lcmn(ln,NM(CA(ma)->dn),&ln);
8599: }
8600: if ( m ) {
8601: NEXT(ma) = mb; ma = mb;
8602: } else {
8603: NEXT(ma) = 0;
8604: break;
8605: }
8606: }
8607: /* l = lcm(denoms) */
8608: NTOQ(ln,1,l);
8609: for ( mr0 = 0, m = ma0; m; m = NEXT(m) ) {
8610: divq(l,CA(m)->dn,&mul);
8611: for ( mp = BDY(CA(m)->nm); mp; mp = NEXT(mp) ) {
8612: NEXTNM(mr0,mr);
8613: mulq((Q)mp->c,mul,&CQ(mr));
8614: dl = mp->dl;
8615: td = TD(DL(m));
8616: ndl_copy(DL(m),DL(mr));
8617: for ( i = 0; i < nd_nalg; i++ ) {
8618: e = dl->d[i];
8619: PUT_EXP(DL(mr),i+nd_ntrans,e);
8620: td += MUL_WEIGHT(e,i+nd_ntrans);
8621: }
1.163 noro 8622: if ( nd_module ) MPOS(DL(mr)) = MPOS(DL(m));
1.157 noro 8623: TD(DL(mr)) = td;
8624: if ( nd_blockmask) ndl_weight_mask(DL(mr));
8625: }
8626: }
8627: NEXT(mr) = 0;
8628: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
8629: MKND(NV(*p),mr0,len,r);
8630: /* XXX */
8631: SG(r) = SG(*p);
8632: nd_free(*p);
8633: *p = r;
8634: return 1;
1.59 noro 8635: }
1.167 noro 8636:
8637: NODE reverse_node(NODE n)
8638: {
8639: NODE t,t1;
8640:
8641: for ( t = 0; n; n = NEXT(n) ) {
8642: MKNODE(t1,BDY(n),t); t = t1;
8643: }
8644: return t;
8645: }
8646:
8647: P ndc_div(int mod,union oNDC a,union oNDC b)
8648: {
8649: union oNDC c;
8650: int inv,t;
8651:
8652: if ( mod == -1 ) c.m = _mulsf(a.m,_invsf(b.m));
1.232 noro 8653: else if ( mod == -2 ) divlf(a.z,b.z,&c.z);
1.167 noro 8654: else if ( mod ) {
8655: inv = invm(b.m,mod);
8656: DMAR(a.m,inv,0,mod,t); c.m = t;
8657: } else if ( nd_vc )
8658: divsp(nd_vc,a.p,b.p,&c.p);
8659: else
8660: divq(a.z,b.z,&c.z);
8661: return ndctop(mod,c);
8662: }
8663:
8664: P ndctop(int mod,union oNDC c)
8665: {
8666: Q q;
8667: int e;
8668: GFS gfs;
8669:
8670: if ( mod == -1 ) {
8671: e = IFTOF(c.m); MKGFS(e,gfs); return (P)gfs;
1.232 noro 8672: } else if ( mod > 0 ) {
1.167 noro 8673: STOQ(c.m,q); return (P)q;
8674: } else
8675: return (P)c.p;
8676: }
8677:
8678: /* [0,0,0,cont] = p -> p/cont */
8679:
8680: void finalize_tracelist(int i,P cont)
8681: {
8682: LIST l;
8683: NODE node;
8684: Q iq;
8685:
8686: if ( !UNIQ(cont) ) {
1.196 noro 8687: node = mknode(4,NULLP,NULLP,NULLP,cont);
1.167 noro 8688: MKLIST(l,node); MKNODE(node,l,nd_tracelist);
8689: nd_tracelist = node;
8690: }
8691: STOQ(i,iq);
8692: nd_tracelist = reverse_node(nd_tracelist);
8693: MKLIST(l,nd_tracelist);
8694: node = mknode(2,iq,l); MKLIST(l,node);
8695: MKNODE(node,l,nd_alltracelist); MKLIST(l,node);
8696: nd_alltracelist = node; nd_tracelist = 0;
8697: }
8698:
8699: void conv_ilist(int demand,int trace,NODE g,int **indp)
8700: {
8701: int n,i,j;
8702: int *ind;
8703: NODE t;
8704:
8705: n = length(g);
8706: ind = (int *)MALLOC(n*sizeof(int));
8707: for ( i = 0, t = g; i < n; i++, t = NEXT(t) ) {
8708: j = (long)BDY(t); ind[i] = j;
8709: BDY(t) = (pointer)(demand?ndv_load(j):(trace?nd_ps_trace[j]:nd_ps[j]));
8710: }
8711: if ( indp ) *indp = ind;
8712: }
1.172 noro 8713:
8714: void parse_nd_option(NODE opt)
8715: {
1.187 noro 8716: NODE t,p,u;
1.231 noro 8717: int i,s,n;
1.172 noro 8718: char *key;
8719: Obj value;
8720:
1.187 noro 8721: nd_gentrace = 0; nd_gensyz = 0; nd_nora = 0; nd_gbblock = 0;
1.208 noro 8722: nd_newelim = 0; nd_intersect = 0; nd_nzlist = 0;
1.209 noro 8723: nd_splist = 0; nd_check_splist = 0;
1.231 noro 8724: nd_sugarweight = 0;
1.234 noro 8725: nd_f4red =0;
8726: nd_rank0 = 0;
1.172 noro 8727: for ( t = opt; t; t = NEXT(t) ) {
8728: p = BDY((LIST)BDY(t));
8729: key = BDY((STRING)BDY(p));
8730: value = (Obj)BDY(NEXT(p));
8731: if ( !strcmp(key,"gentrace") )
8732: nd_gentrace = value?1:0;
8733: else if ( !strcmp(key,"gensyz") )
8734: nd_gensyz = value?1:0;
1.173 noro 8735: else if ( !strcmp(key,"nora") )
8736: nd_nora = value?1:0;
1.187 noro 8737: else if ( !strcmp(key,"gbblock") ) {
1.233 noro 8738: if ( value && OID(value) == O_LIST ) {
8739: u = BDY((LIST)value);
8740: nd_gbblock = MALLOC((2*length(u)+1)*sizeof(int));
8741: for ( i = 0; u; u = NEXT(u) ) {
8742: p = BDY((LIST)BDY(u));
8743: s = nd_gbblock[i++] = QTOS((Q)BDY(p));
8744: nd_gbblock[i++] = s+QTOS((Q)BDY(NEXT(p)))-1;
8745: }
8746: nd_gbblock[i] = -1;
8747: } else
8748: nd_gbblock = 0;
1.192 noro 8749: } else if ( !strcmp(key,"newelim") )
8750: nd_newelim = value?1:0;
1.195 noro 8751: else if ( !strcmp(key,"intersect") )
8752: nd_intersect = value?1:0;
1.234 noro 8753: else if ( !strcmp(key,"lf") )
8754: nd_lf = value?1:0;
1.208 noro 8755: else if ( !strcmp(key,"trace") ) {
8756: u = BDY((LIST)value);
8757: nd_nzlist = BDY((LIST)ARG2(u));
8758: nd_bpe = QTOS((Q)ARG3(u));
1.234 noro 8759: } else if ( !strcmp(key,"f4red") ) {
8760: nd_f4red = QTOS((Q)value);
8761: } else if ( !strcmp(key,"rank0") ) {
8762: nd_rank0 = value?1:0;
8763: } else if ( !strcmp(key,"splist") ) {
1.209 noro 8764: nd_splist = value?1:0;
1.234 noro 8765: } else if ( !strcmp(key,"check_splist") ) {
1.209 noro 8766: nd_check_splist = BDY((LIST)value);
1.231 noro 8767: } else if ( !strcmp(key,"sugarweight") ) {
8768: u = BDY((LIST)value);
8769: n = length(u);
8770: nd_sugarweight = MALLOC(n*sizeof(int));
8771: for ( i = 0; i < n; i++, u = NEXT(u) )
8772: nd_sugarweight[i] = QTOS((Q)BDY(u));
1.208 noro 8773: }
1.172 noro 8774: }
8775: }
1.204 noro 8776:
8777: ND mdptond(DP d);
8778: ND nd_mul_nm(int mod,NM m0,ND p);
1.207 noro 8779: ND *btog(NODE ti,ND **p,int nb,int mod);
8780: ND btog_one(NODE ti,ND *p,int nb,int mod);
1.204 noro 8781: MAT nd_btog(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,MAT *rp);
1.205 noro 8782: VECT nd_btog_one(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,int pos,MAT *rp);
1.204 noro 8783:
8784: /* d:monomial */
8785: ND mdptond(DP d)
8786: {
8787: NM m;
8788: ND r;
8789:
8790: if ( OID(d) == 1 )
8791: r = ptond(CO,CO,(P)d);
8792: else {
8793: NEWNM(m);
8794: dltondl(NV(d),BDY(d)->dl,DL(m));
8795: CQ(m) = (Q)BDY(d)->c;
8796: NEXT(m) = 0;
8797: MKND(NV(d),m,1,r);
8798: }
8799: return r;
8800: }
8801:
8802: ND nd_mul_nm(int mod,NM m0,ND p)
8803: {
8804: UINT *d0;
8805: int c0,c1,c;
8806: NM tm,mr,mr0;
8807: ND r;
8808:
8809: if ( !p ) return 0;
8810: d0 = DL(m0);
8811: c0 = CM(m0);
8812: mr0 = 0;
8813: for ( tm = BDY(p); tm; tm = NEXT(tm) ) {
8814: NEXTNM(mr0,mr);
8815: c = CM(tm); DMAR(c0,c,0,mod,c1); CM(mr) = c1;
8816: ndl_add(d0,DL(tm),DL(mr));
8817: }
8818: NEXT(mr) = 0;
8819: MKND(NV(p),mr0,LEN(p),r);
8820: return r;
8821: }
8822:
1.207 noro 8823: ND *btog(NODE ti,ND **p,int nb,int mod)
1.204 noro 8824: {
8825: PGeoBucket *r;
8826: int i,ci;
8827: NODE t,s;
8828: ND m,tp;
8829: ND *pi,*rd;
8830: P c;
8831:
8832: r = (PGeoBucket *)MALLOC(nb*sizeof(PGeoBucket));
8833: for ( i = 0; i < nb; i++ )
8834: r[i] = create_pbucket();
8835: for ( t = ti; t; t = NEXT(t) ) {
8836: s = BDY((LIST)BDY(t));
8837: if ( ARG0(s) ) {
8838: m = mdptond((DP)ARG2(s));
8839: ptomp(mod,(P)HCQ(m),&c);
8840: if ( ci = ((MQ)c)->cont ) {
8841: HCM(m) = ci;
8842: pi = p[QTOS((Q)ARG1(s))];
8843: for ( i = 0; i < nb; i++ ) {
8844: tp = nd_mul_nm(mod,BDY(m),pi[i]);
8845: add_pbucket(mod,r[i],tp);
8846: }
8847: }
8848: ci = 1;
8849: } else {
8850: ptomp(mod,(P)ARG3(s),&c); ci = ((MQ)c)->cont;
8851: ci = invm(ci,mod);
8852: }
8853: }
8854: rd = (ND *)MALLOC(nb*sizeof(ND));
8855: for ( i = 0; i < nb; i++ )
8856: rd[i] = normalize_pbucket(mod,r[i]);
8857: if ( ci != 1 )
8858: for ( i = 0; i < nb; i++ ) nd_mul_c(mod,rd[i],ci);
8859: return rd;
8860: }
8861:
1.207 noro 8862: ND btog_one(NODE ti,ND *p,int nb,int mod)
1.205 noro 8863: {
8864: PGeoBucket r;
1.206 noro 8865: int i,ci,j;
1.205 noro 8866: NODE t,s;
8867: ND m,tp;
8868: ND pi,rd;
8869: P c;
8870:
8871: r = create_pbucket();
8872: for ( t = ti; t; t = NEXT(t) ) {
8873: s = BDY((LIST)BDY(t));
8874: if ( ARG0(s) ) {
8875: m = mdptond((DP)ARG2(s));
8876: ptomp(mod,(P)HCQ(m),&c);
8877: if ( ci = ((MQ)c)->cont ) {
8878: HCM(m) = ci;
1.206 noro 8879: pi = p[j=QTOS((Q)ARG1(s))];
8880: if ( !pi ) {
8881: pi = nd_load_mod(j);
8882: tp = nd_mul_nm(mod,BDY(m),pi);
8883: nd_free(pi);
8884: add_pbucket(mod,r,tp);
8885: } else {
8886: tp = nd_mul_nm(mod,BDY(m),pi);
8887: add_pbucket(mod,r,tp);
8888: }
1.205 noro 8889: }
8890: ci = 1;
8891: } else {
8892: ptomp(mod,(P)ARG3(s),&c); ci = ((MQ)c)->cont;
8893: ci = invm(ci,mod);
8894: }
8895: }
8896: rd = normalize_pbucket(mod,r);
1.206 noro 8897: free_pbucket(r);
1.205 noro 8898: if ( ci != 1 ) nd_mul_c(mod,rd,ci);
8899: return rd;
8900: }
1.204 noro 8901:
8902: MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *ord,LIST tlist,MAT *rp)
8903: {
8904: int i,j,n,m,nb,pi0,pi1,nvar;
8905: VL fv,tv,vv;
8906: NODE permtrace,perm,trace,intred,ind,t,pi,ti;
8907: ND **p;
8908: ND *c;
8909: ND u;
8910: P inv;
8911: MAT mat;
8912:
8913: parse_nd_option(current_option);
8914: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
8915: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
8916: switch ( ord->id ) {
8917: case 1:
8918: if ( ord->nv != nvar )
8919: error("nd_check : invalid order specification");
8920: break;
8921: default:
8922: break;
8923: }
8924: nd_init_ord(ord);
8925: #if 0
8926: nd_bpe = QTOS((Q)ARG7(BDY(tlist)));
8927: #else
8928: nd_bpe = 32;
8929: #endif
8930: nd_setup_parameters(nvar,0);
8931: permtrace = BDY((LIST)ARG2(BDY(tlist)));
8932: intred = BDY((LIST)ARG3(BDY(tlist)));
8933: ind = BDY((LIST)ARG4(BDY(tlist)));
8934: perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace);
8935: for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) {
8936: j = QTOS((Q)BDY(BDY((LIST)BDY(t))));
8937: if ( j > i ) i = j;
8938: }
8939: n = i+1;
8940: nb = length(BDY(f));
8941: p = (ND **)MALLOC(n*sizeof(ND *));
8942: for ( t = perm, i = 0; t; t = NEXT(t), i++ ) {
8943: pi = BDY((LIST)BDY(t));
8944: pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi));
8945: p[pi0] = c = (ND *)MALLOC(nb*sizeof(ND));
8946: ptomp(mod,(P)ARG2(pi),&inv);
1.218 noro 8947: ((MQ)inv)->cont = invm(((MQ)inv)->cont,mod);
1.204 noro 8948: u = ptond(CO,vv,(P)ONE);
8949: HCM(u) = ((MQ)inv)->cont;
8950: c[pi1] = u;
8951: }
8952: for ( t = trace,i=0; t; t = NEXT(t), i++ ) {
8953: printf("%d ",i); fflush(stdout);
8954: ti = BDY((LIST)BDY(t));
1.207 noro 8955: p[j=QTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod);
1.204 noro 8956: }
8957: for ( t = intred, i=0; t; t = NEXT(t), i++ ) {
8958: printf("%d ",i); fflush(stdout);
8959: ti = BDY((LIST)BDY(t));
1.207 noro 8960: p[j=QTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod);
1.204 noro 8961: }
8962: m = length(ind);
8963: MKMAT(mat,nb,m);
8964: for ( j = 0, t = ind; j < m; j++, t = NEXT(t) )
8965: for ( i = 0, c = p[QTOS((Q)BDY(t))]; i < nb; i++ )
8966: BDY(mat)[i][j] = ndtodp(mod,c[i]);
8967: return mat;
8968: }
8969:
1.205 noro 8970: VECT nd_btog_one(LIST f,LIST v,int mod,struct order_spec *ord,
8971: LIST tlist,int pos,MAT *rp)
8972: {
8973: int i,j,n,m,nb,pi0,pi1,nvar;
8974: VL fv,tv,vv;
8975: NODE permtrace,perm,trace,intred,ind,t,pi,ti;
8976: ND *p;
8977: ND *c;
8978: ND u;
8979: P inv;
8980: VECT vect;
8981:
8982: parse_nd_option(current_option);
8983: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
8984: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
8985: switch ( ord->id ) {
8986: case 1:
8987: if ( ord->nv != nvar )
8988: error("nd_check : invalid order specification");
8989: break;
8990: default:
8991: break;
8992: }
8993: nd_init_ord(ord);
8994: #if 0
8995: nd_bpe = QTOS((Q)ARG7(BDY(tlist)));
8996: #else
8997: nd_bpe = 32;
8998: #endif
8999: nd_setup_parameters(nvar,0);
9000: permtrace = BDY((LIST)ARG2(BDY(tlist)));
9001: intred = BDY((LIST)ARG3(BDY(tlist)));
9002: ind = BDY((LIST)ARG4(BDY(tlist)));
9003: perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace);
9004: for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) {
9005: j = QTOS((Q)BDY(BDY((LIST)BDY(t))));
9006: if ( j > i ) i = j;
9007: }
9008: n = i+1;
9009: nb = length(BDY(f));
9010: p = (ND *)MALLOC(n*sizeof(ND *));
9011: for ( t = perm, i = 0; t; t = NEXT(t), i++ ) {
9012: pi = BDY((LIST)BDY(t));
9013: pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi));
9014: if ( pi1 == pos ) {
1.218 noro 9015: ptomp(mod,(P)ARG2(pi),&inv);
9016: ((MQ)inv)->cont = invm(((MQ)inv)->cont,mod);
1.205 noro 9017: u = ptond(CO,vv,(P)ONE);
9018: HCM(u) = ((MQ)inv)->cont;
9019: p[pi0] = u;
9020: }
9021: }
9022: for ( t = trace,i=0; t; t = NEXT(t), i++ ) {
9023: printf("%d ",i); fflush(stdout);
9024: ti = BDY((LIST)BDY(t));
1.207 noro 9025: p[j=QTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod);
1.206 noro 9026: if ( Demand ) {
9027: nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0;
9028: }
1.205 noro 9029: }
9030: for ( t = intred, i=0; t; t = NEXT(t), i++ ) {
9031: printf("%d ",i); fflush(stdout);
9032: ti = BDY((LIST)BDY(t));
1.207 noro 9033: p[j=QTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod);
1.206 noro 9034: if ( Demand ) {
9035: nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0;
9036: }
1.205 noro 9037: }
9038: m = length(ind);
9039: MKVECT(vect,m);
1.206 noro 9040: for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) {
9041: u = p[QTOS((Q)BDY(t))];
9042: if ( !u ) {
9043: u = nd_load_mod(QTOS((Q)BDY(t)));
9044: BDY(vect)[j] = ndtodp(mod,u);
9045: nd_free(u);
9046: } else
9047: BDY(vect)[j] = ndtodp(mod,u);
9048: }
1.205 noro 9049: return vect;
9050: }
1.232 noro 9051:
9052: void ndv_print_lf(NDV p)
9053: {
9054: NMV m;
9055: int i,len;
9056:
9057: if ( !p ) printf("0\n");
9058: else {
9059: len = LEN(p);
9060: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
9061: printf("+");
9062: mpz_out_str(asir_out,10,BDY(CZ(m)));
9063: printf("*");
9064: ndl_print(DL(m));
9065: }
9066: printf("\n");
9067: }
9068: }
1.234 noro 9069:
9070: void nd_f4_lf_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp)
9071: {
9072: VL tv,fv,vv,vc,av;
9073: NODE fd,fd0,in0,in,r,r0,t,s,cand,alist;
9074: int m,nocheck,nvar,mindex,e,max;
9075: NDV c;
9076: NMV a;
9077: P p,zp;
9078: Q dmy;
9079: EPOS oepos;
9080: int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg,mrank,trank,ompos;
9081: Alg alpha,dp;
9082: P poly;
9083: LIST f1,f2,zpl;
9084: Obj obj;
9085: NumberField nf;
9086: struct order_spec *ord1;
9087: struct oEGT eg_check,eg0,eg1;
9088: NODE tr,tl1,tl2,tl3,tl4;
9089: LIST l1,l2,l3,l4,l5;
9090: int *perm;
9091: int j,ret;
9092: Q jq,bpe;
9093:
9094: nd_module = 0;
9095: parse_nd_option(current_option);
9096: get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc);
9097: if ( nd_vc )
9098: error("nd_f4_lf_trace : computation over a rational function field is not implemented");
9099: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
9100: switch ( ord->id ) {
9101: case 1:
9102: if ( ord->nv != nvar )
9103: error("nd_f4_lf_trace : invalid order specification");
9104: break;
9105: default:
9106: break;
9107: }
9108:
9109: nd_ntrans = nvar;
9110: nd_nalg = 0;
9111:
9112: nocheck = 0;
9113: mindex = 0;
9114:
1.235 noro 9115: /* do not use on-demand load/save */
9116: nd_demand = 0;
1.234 noro 9117: m = trace > 1 ? trace : get_lprime(mindex);
9118: nd_init_ord(ord);
9119: mrank = 0;
9120: for ( t = BDY(f), max = 1; t; t = NEXT(t) )
9121: for ( tv = vv; tv; tv = NEXT(tv) ) {
9122: if ( nd_module ) {
9123: s = BDY((LIST)BDY(t));
9124: trank = length(s);
9125: mrank = MAX(mrank,trank);
9126: for ( ; s; s = NEXT(s) ) {
9127: e = getdeg(tv->v,(P)BDY(s));
9128: max = MAX(e,max);
9129: }
9130: } else {
9131: e = getdeg(tv->v,(P)BDY(t));
9132: max = MAX(e,max);
9133: }
9134: }
9135: nd_setup_parameters(nvar,max);
9136: obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; ompos = nd_mpos;
9137: ishomo = 1;
9138: /* XXX */
9139: for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
9140: if ( nd_module ) {
9141: c = (pointer)pltondv(CO,vv,(LIST)BDY(t));
9142: } else {
9143: c = (pointer)ptondv(CO,vv,(P)BDY(t));
9144: }
9145: if ( ishomo )
9146: ishomo = ishomo && ndv_ishomo(c);
9147: if ( c ) {
9148: NEXTNODE(in0,in); BDY(in) = (pointer)c;
9149: NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c);
9150: }
9151: }
9152: if ( in0 ) NEXT(in) = 0;
9153: if ( fd0 ) NEXT(fd) = 0;
9154: if ( !ishomo && homo ) {
9155: for ( t = in0, wmax = max; t; t = NEXT(t) ) {
9156: c = (NDV)BDY(t); len = LEN(c);
9157: for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) )
9158: wmax = MAX(TD(DL(a)),wmax);
9159: }
9160: homogenize_order(ord,nvar,&ord1);
9161: nd_init_ord(ord1);
9162: nd_setup_parameters(nvar+1,wmax);
9163: for ( t = fd0; t; t = NEXT(t) )
9164: ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos);
9165: }
9166: if ( MaxDeg > 0 ) nocheck = 1;
1.235 noro 9167: ret = ndv_setup(-2,m,fd0,nd_gbblock?1:0,0);
9168: if ( ret )
9169: cand = nd_f4_lf_trace_main(m,&perm);
9170: if ( !ret || !cand ) {
9171: *rp = 0; return;
9172: }
9173: if ( !ishomo && homo ) {
9174: /* dehomogenization */
9175: for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord);
9176: nd_init_ord(ord);
9177: nd_setup_parameters(nvar,0);
1.234 noro 9178: }
1.235 noro 9179: cand = ndv_reducebase(cand,perm);
9180: cand = ndv_reduceall(-2,cand);
9181: cbpe = nd_bpe;
9182: get_eg(&eg0);
9183: if ( ret = ndv_check_membership(-2,in0,obpe,oadv,oepos,cand) ) {
9184: /* gbcheck : cand is a GB of Id(cand) ? */
9185: ret = nd_f4(-2,0,0);
9186: }
9187: if ( !ret ) {
9188: /* failure */
9189: *rp = 0; return;
9190: }
1.234 noro 9191: get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1);
9192: if ( DP_Print )
9193: fprintf(asir_out,"check=%fsec\n",eg_check.exectime+eg_check.gctime);
9194: /* dp->p */
9195: nd_bpe = cbpe;
9196: nd_setup_parameters(nd_nvar,0);
9197: for ( r = cand; r; r = NEXT(r) ) {
9198: if ( nd_module ) BDY(r) = ndvtopl(-2,CO,vv,BDY(r),mrank);
9199: else BDY(r) = (pointer)ndvtop(-2,CO,vv,BDY(r));
9200: }
9201: MKLIST(*rp,cand);
9202: }
9203:
9204: NODE nd_f4_lf_trace_main(int m,int **indp)
9205: {
9206: int i,nh,stat,index;
9207: NODE r,rm,g;
9208: ND_pairs d,l,l0,t;
9209: ND spol,red;
9210: NDV nf,redv,nfqv,nfv;
9211: NM s0,s;
9212: NODE rp0,srp0,nflist,nflist_lf;
9213: int nsp,nred,col,rank,len,k,j,a;
9214: UINT c;
9215: UINT **spmat;
9216: UINT *s0vect,*svect,*p,*v;
9217: int *colstat;
9218: IndArray *imat;
9219: int *rhead;
9220: int spcol,sprow;
9221: int sugar;
9222: PGeoBucket bucket;
9223: struct oEGT eg0,eg1,eg_f4;
9224:
9225: g = 0; d = 0;
9226: for ( i = 0; i < nd_psn; i++ ) {
9227: d = update_pairs(d,g,i,0);
9228: g = update_base(g,i);
9229: }
9230: while ( d ) {
9231: get_eg(&eg0);
9232: l = nd_minsugarp(d,&d);
9233: sugar = SG(l);
9234: if ( MaxDeg > 0 && sugar > MaxDeg ) break;
9235: bucket = create_pbucket();
9236: stat = nd_sp_f4(m,0,l,bucket);
9237: if ( !stat ) {
9238: for ( t = l; NEXT(t); t = NEXT(t) );
9239: NEXT(t) = d; d = l;
9240: d = nd_reconstruct(1,d);
9241: continue;
9242: }
9243: if ( bucket->m < 0 ) continue;
9244: col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0);
9245: if ( !col ) {
9246: for ( t = l; NEXT(t); t = NEXT(t) );
9247: NEXT(t) = d; d = l;
9248: d = nd_reconstruct(1,d);
9249: continue;
9250: }
9251: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
9252: if ( DP_Print )
9253: fprintf(asir_out,"sugar=%d,symb=%fsec,",
9254: sugar,eg_f4.exectime+eg_f4.gctime);
9255: nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0);
9256: if ( !l0 ) continue;
9257: l = l0;
9258:
9259: /* over LF */
9260: bucket = create_pbucket();
9261: stat = nd_sp_f4(-2,1,l,bucket);
9262: if ( !stat ) {
9263: for ( t = l; NEXT(t); t = NEXT(t) );
9264: NEXT(t) = d; d = l;
9265: d = nd_reconstruct(1,d);
9266: continue;
9267: }
9268: if ( bucket->m < 0 ) continue;
9269: col = nd_symbolic_preproc(bucket,1,&s0vect,&rp0);
9270: if ( !col ) {
9271: for ( t = l; NEXT(t); t = NEXT(t) );
9272: NEXT(t) = d; d = l;
9273: d = nd_reconstruct(1,d);
9274: continue;
9275: }
9276: nflist_lf = nd_f4_red(-2,l,1,s0vect,col,rp0,0);
9277: /* adding new bases */
9278: for ( rm = nflist, r = nflist_lf; r && rm; rm = NEXT(rm), r = NEXT(r) ) {
9279: nfv = (NDV)BDY(rm);
9280: nfqv = (NDV)BDY(r);
9281: if ( DL_COMPARE(HDL(nfv),HDL(nfqv)) ) return 0;
9282: ndv_removecont(m,nfv);
9283: ndv_removecont(-2,nfqv);
9284: nh = ndv_newps(-2,nfv,nfqv,1);
9285: d = update_pairs(d,g,nh,0);
9286: g = update_base(g,nh);
9287: }
9288: if ( r || rm ) return 0;
9289: }
9290: conv_ilist(nd_demand,1,g,indp);
9291: return g;
9292: }
9293:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to nd.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / engine