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