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