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