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