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