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