![[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|
Return to nd.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / engine |
1.123 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.122 2004/12/09 13:20:33 noro Exp $ */
1.2 noro 2:
1.94 noro 3: #include "nd.h"
1.63 noro 4:
1.61 noro 5: int (*ndl_compare_function)(UINT *a1,UINT *a2);
1.94 noro 6: int nd_dcomp;
7: NM _nm_free_list;
8: ND _nd_free_list;
9: ND_pairs _ndp_free_list;
1.32 noro 10:
1.121 noro 11: static int nd_ntrans;
1.117 noro 12: static int nd_nalg;
1.103 noro 13: #if 0
1.74 noro 14: static int ndv_alloc;
1.103 noro 15: #endif
1.87 noro 16: #if 1
1.69 noro 17: static int nd_f4_nsp=0x7fffffff;
1.87 noro 18: #else
19: static int nd_f4_nsp=50;
20: #endif
1.42 noro 21: static double nd_scale=2;
1.61 noro 22: static UINT **nd_bound;
1.42 noro 23: static struct order_spec *nd_ord;
24: static EPOS nd_epos;
1.43 noro 25: static BlockMask nd_blockmask;
1.42 noro 26: static int nd_nvar;
27: static int nd_isrlex;
28: static int nd_epw,nd_bpe,nd_wpd,nd_exporigin;
1.61 noro 29: static UINT nd_mask[32];
30: static UINT nd_mask0,nd_mask1;
1.42 noro 31:
1.20 noro 32: static NDV *nd_ps;
1.53 noro 33: static NDV *nd_ps_trace;
1.42 noro 34: static RHist *nd_psh;
35: static int nd_psn,nd_pslen;
36: static RHist *nd_red;
1.96 noro 37: static int *nd_work_vector;
38: static int **nd_matrix;
39: static int nd_matrix_len;
1.97 noro 40: static struct weight_or_block *nd_worb;
41: static int nd_worb_len;
1.42 noro 42: static int nd_found,nd_create,nd_notfirst;
43: static int nmv_adv;
1.77 noro 44: static int nd_demand;
1.1 noro 45:
1.119 noro 46: NumberField get_numberfield();
1.114 noro 47: UINT *nd_det_compute_bound(NDV **dm,int n,int j);
48: void nd_det_reconstruct(NDV **dm,int n,int j,NDV d);
1.118 noro 49: int nd_monic(int m,ND *p);
1.114 noro 50:
1.1 noro 51: void nd_free_private_storage()
52: {
53: _nm_free_list = 0;
1.5 noro 54: _ndp_free_list = 0;
1.71 noro 55: #if 0
1.1 noro 56: GC_gcollect();
1.71 noro 57: #endif
1.1 noro 58: }
59:
60: void _NM_alloc()
61: {
62: NM p;
63: int i;
64:
1.11 noro 65: for ( i = 0; i < 1024; i++ ) {
1.61 noro 66: p = (NM)GC_malloc(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
1.1 noro 67: p->next = _nm_free_list; _nm_free_list = p;
68: }
69: }
70:
71: void _ND_alloc()
72: {
73: ND p;
74: int i;
75:
76: for ( i = 0; i < 1024; i++ ) {
77: p = (ND)GC_malloc(sizeof(struct oND));
78: p->body = (NM)_nd_free_list; _nd_free_list = p;
79: }
80: }
81:
82: void _NDP_alloc()
83: {
84: ND_pairs p;
85: int i;
86:
1.11 noro 87: for ( i = 0; i < 1024; i++ ) {
1.1 noro 88: p = (ND_pairs)GC_malloc(sizeof(struct oND_pairs)
1.61 noro 89: +(nd_wpd-1)*sizeof(UINT));
1.1 noro 90: p->next = _ndp_free_list; _ndp_free_list = p;
91: }
92: }
93:
1.30 noro 94: INLINE int nd_length(ND p)
1.1 noro 95: {
96: NM m;
97: int i;
98:
99: if ( !p )
100: return 0;
101: else {
102: for ( i = 0, m = BDY(p); m; m = NEXT(m), i++ );
103: return i;
104: }
105: }
106:
1.61 noro 107: INLINE int ndl_reducible(UINT *d1,UINT *d2)
1.1 noro 108: {
1.61 noro 109: UINT u1,u2;
1.1 noro 110: int i,j;
111:
1.34 noro 112: if ( TD(d1) < TD(d2) ) return 0;
1.65 noro 113: #if USE_UNROLL
1.1 noro 114: switch ( nd_bpe ) {
1.62 noro 115: case 3:
116: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
117: u1 = d1[i]; u2 = d2[i];
118: if ( (u1&0x38000000) < (u2&0x38000000) ) return 0;
119: if ( (u1& 0x7000000) < (u2& 0x7000000) ) return 0;
120: if ( (u1& 0xe00000) < (u2& 0xe00000) ) return 0;
121: if ( (u1& 0x1c0000) < (u2& 0x1c0000) ) return 0;
122: if ( (u1& 0x38000) < (u2& 0x38000) ) return 0;
123: if ( (u1& 0x7000) < (u2& 0x7000) ) return 0;
124: if ( (u1& 0xe00) < (u2& 0xe00) ) return 0;
125: if ( (u1& 0x1c0) < (u2& 0x1c0) ) return 0;
126: if ( (u1& 0x38) < (u2& 0x38) ) return 0;
127: if ( (u1& 0x7) < (u2& 0x7) ) return 0;
128: }
129: return 1;
130: break;
1.1 noro 131: case 4:
1.41 noro 132: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 133: u1 = d1[i]; u2 = d2[i];
134: if ( (u1&0xf0000000) < (u2&0xf0000000) ) return 0;
1.62 noro 135: if ( (u1& 0xf000000) < (u2& 0xf000000) ) return 0;
136: if ( (u1& 0xf00000) < (u2& 0xf00000) ) return 0;
137: if ( (u1& 0xf0000) < (u2& 0xf0000) ) return 0;
138: if ( (u1& 0xf000) < (u2& 0xf000) ) return 0;
139: if ( (u1& 0xf00) < (u2& 0xf00) ) return 0;
140: if ( (u1& 0xf0) < (u2& 0xf0) ) return 0;
141: if ( (u1& 0xf) < (u2& 0xf) ) return 0;
1.1 noro 142: }
143: return 1;
144: break;
145: case 6:
1.41 noro 146: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 147: u1 = d1[i]; u2 = d2[i];
148: if ( (u1&0x3f000000) < (u2&0x3f000000) ) return 0;
1.62 noro 149: if ( (u1& 0xfc0000) < (u2& 0xfc0000) ) return 0;
150: if ( (u1& 0x3f000) < (u2& 0x3f000) ) return 0;
151: if ( (u1& 0xfc0) < (u2& 0xfc0) ) return 0;
152: if ( (u1& 0x3f) < (u2& 0x3f) ) return 0;
1.1 noro 153: }
154: return 1;
155: break;
156: case 8:
1.41 noro 157: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 158: u1 = d1[i]; u2 = d2[i];
159: if ( (u1&0xff000000) < (u2&0xff000000) ) return 0;
1.62 noro 160: if ( (u1& 0xff0000) < (u2& 0xff0000) ) return 0;
161: if ( (u1& 0xff00) < (u2& 0xff00) ) return 0;
162: if ( (u1& 0xff) < (u2& 0xff) ) return 0;
1.1 noro 163: }
164: return 1;
165: break;
166: case 16:
1.41 noro 167: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 168: u1 = d1[i]; u2 = d2[i];
169: if ( (u1&0xffff0000) < (u2&0xffff0000) ) return 0;
1.62 noro 170: if ( (u1& 0xffff) < (u2& 0xffff) ) return 0;
1.1 noro 171: }
172: return 1;
173: break;
174: case 32:
1.41 noro 175: for ( i = nd_exporigin; i < nd_wpd; i++ )
1.1 noro 176: if ( d1[i] < d2[i] ) return 0;
177: return 1;
178: break;
179: default:
1.41 noro 180: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 181: u1 = d1[i]; u2 = d2[i];
182: for ( j = 0; j < nd_epw; j++ )
183: if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0;
184: }
185: return 1;
186: }
1.65 noro 187: #else
188: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
189: u1 = d1[i]; u2 = d2[i];
190: for ( j = 0; j < nd_epw; j++ )
191: if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0;
192: }
193: return 1;
194: #endif
1.1 noro 195: }
196:
1.61 noro 197: /*
198: * If the current order is a block order,
199: * then the last block is length 1 and contains
200: * the homo variable. Otherwise, the original
201: * order is either 0 or 2.
202: */
203:
204: void ndl_homogenize(UINT *d,UINT *r,int obpe,EPOS oepos,int weight)
1.23 noro 205: {
1.61 noro 206: int w,i,e,n,omask0;
207:
208: omask0 = (1<<obpe)-1;
209: n = nd_nvar-1;
210: ndl_zero(r);
211: for ( i = 0; i < n; i++ ) {
212: e = GET_EXP_OLD(d,i);
213: PUT_EXP(r,i,e);
214: }
215: w = TD(d);
216: PUT_EXP(r,nd_nvar-1,weight-w);
217: TD(r) = weight;
218: if ( nd_blockmask ) ndl_weight_mask(r);
219: }
220:
221: void ndl_dehomogenize(UINT *d)
222: {
223: UINT mask;
224: UINT h;
1.31 noro 225: int i,bits;
1.23 noro 226:
1.44 noro 227: if ( nd_blockmask ) {
228: h = GET_EXP(d,nd_nvar-1);
1.45 noro 229: XOR_EXP(d,nd_nvar-1,h);
1.44 noro 230: TD(d) -= h;
231: d[nd_exporigin-1] -= h;
232: } else {
233: if ( nd_isrlex ) {
234: if ( nd_bpe == 32 ) {
235: h = d[nd_exporigin];
236: for ( i = nd_exporigin+1; i < nd_wpd; i++ )
237: d[i-1] = d[i];
238: d[i-1] = 0;
239: TD(d) -= h;
240: } else {
241: bits = nd_epw*nd_bpe;
242: mask = bits==32?0xffffffff:((1<<(nd_epw*nd_bpe))-1);
243: h = (d[nd_exporigin]>>((nd_epw-1)*nd_bpe))&nd_mask0;
244: for ( i = nd_exporigin; i < nd_wpd; i++ )
245: d[i] = ((d[i]<<nd_bpe)&mask)
246: |(i+1<nd_wpd?((d[i+1]>>((nd_epw-1)*nd_bpe))&nd_mask0):0);
247: TD(d) -= h;
248: }
1.45 noro 249: } else {
250: h = GET_EXP(d,nd_nvar-1);
251: XOR_EXP(d,nd_nvar-1,h);
252: TD(d) -= h;
253: }
1.44 noro 254: }
1.23 noro 255: }
256:
1.61 noro 257: void ndl_lcm(UINT *d1,unsigned *d2,UINT *d)
1.1 noro 258: {
1.61 noro 259: UINT t1,t2,u,u1,u2;
1.43 noro 260: int i,j,l;
1.1 noro 261:
1.65 noro 262: #if USE_UNROLL
1.1 noro 263: switch ( nd_bpe ) {
1.62 noro 264: case 3:
265: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
266: u1 = d1[i]; u2 = d2[i];
267: t1 = (u1&0x38000000); t2 = (u2&0x38000000); u = t1>t2?t1:t2;
268: t1 = (u1& 0x7000000); t2 = (u2& 0x7000000); u |= t1>t2?t1:t2;
269: t1 = (u1& 0xe00000); t2 = (u2& 0xe00000); u |= t1>t2?t1:t2;
270: t1 = (u1& 0x1c0000); t2 = (u2& 0x1c0000); u |= t1>t2?t1:t2;
271: t1 = (u1& 0x38000); t2 = (u2& 0x38000); u |= t1>t2?t1:t2;
272: t1 = (u1& 0x7000); t2 = (u2& 0x7000); u |= t1>t2?t1:t2;
273: t1 = (u1& 0xe00); t2 = (u2& 0xe00); u |= t1>t2?t1:t2;
274: t1 = (u1& 0x1c0); t2 = (u2& 0x1c0); u |= t1>t2?t1:t2;
275: t1 = (u1& 0x38); t2 = (u2& 0x38); u |= t1>t2?t1:t2;
276: t1 = (u1& 0x7); t2 = (u2& 0x7); u |= t1>t2?t1:t2;
277: d[i] = u;
278: }
279: break;
1.1 noro 280: case 4:
1.41 noro 281: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 282: u1 = d1[i]; u2 = d2[i];
283: t1 = (u1&0xf0000000); t2 = (u2&0xf0000000); u = t1>t2?t1:t2;
1.62 noro 284: t1 = (u1& 0xf000000); t2 = (u2& 0xf000000); u |= t1>t2?t1:t2;
285: t1 = (u1& 0xf00000); t2 = (u2& 0xf00000); u |= t1>t2?t1:t2;
286: t1 = (u1& 0xf0000); t2 = (u2& 0xf0000); u |= t1>t2?t1:t2;
287: t1 = (u1& 0xf000); t2 = (u2& 0xf000); u |= t1>t2?t1:t2;
288: t1 = (u1& 0xf00); t2 = (u2& 0xf00); u |= t1>t2?t1:t2;
289: t1 = (u1& 0xf0); t2 = (u2& 0xf0); u |= t1>t2?t1:t2;
290: t1 = (u1& 0xf); t2 = (u2& 0xf); u |= t1>t2?t1:t2;
1.1 noro 291: d[i] = u;
292: }
293: break;
294: case 6:
1.41 noro 295: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 296: u1 = d1[i]; u2 = d2[i];
297: t1 = (u1&0x3f000000); t2 = (u2&0x3f000000); u = t1>t2?t1:t2;
1.62 noro 298: t1 = (u1& 0xfc0000); t2 = (u2& 0xfc0000); u |= t1>t2?t1:t2;
299: t1 = (u1& 0x3f000); t2 = (u2& 0x3f000); u |= t1>t2?t1:t2;
300: t1 = (u1& 0xfc0); t2 = (u2& 0xfc0); u |= t1>t2?t1:t2;
301: t1 = (u1& 0x3f); t2 = (u2& 0x3f); u |= t1>t2?t1:t2;
1.1 noro 302: d[i] = u;
303: }
304: break;
305: case 8:
1.41 noro 306: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 307: u1 = d1[i]; u2 = d2[i];
308: t1 = (u1&0xff000000); t2 = (u2&0xff000000); u = t1>t2?t1:t2;
1.62 noro 309: t1 = (u1& 0xff0000); t2 = (u2& 0xff0000); u |= t1>t2?t1:t2;
310: t1 = (u1& 0xff00); t2 = (u2& 0xff00); u |= t1>t2?t1:t2;
311: t1 = (u1& 0xff); t2 = (u2& 0xff); u |= t1>t2?t1:t2;
1.1 noro 312: d[i] = u;
313: }
314: break;
315: case 16:
1.41 noro 316: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 317: u1 = d1[i]; u2 = d2[i];
318: t1 = (u1&0xffff0000); t2 = (u2&0xffff0000); u = t1>t2?t1:t2;
1.62 noro 319: t1 = (u1& 0xffff); t2 = (u2& 0xffff); u |= t1>t2?t1:t2;
1.1 noro 320: d[i] = u;
321: }
322: break;
323: case 32:
1.41 noro 324: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 325: u1 = d1[i]; u2 = d2[i];
326: d[i] = u1>u2?u1:u2;
327: }
328: break;
329: default:
1.41 noro 330: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 331: u1 = d1[i]; u2 = d2[i];
332: for ( j = 0, u = 0; j < nd_epw; j++ ) {
333: t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;
334: }
335: d[i] = u;
336: }
337: break;
338: }
1.65 noro 339: #else
340: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
341: u1 = d1[i]; u2 = d2[i];
342: for ( j = 0, u = 0; j < nd_epw; j++ ) {
343: t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;
344: }
345: d[i] = u;
346: }
347: #endif
1.39 noro 348: TD(d) = ndl_weight(d);
1.61 noro 349: if ( nd_blockmask ) ndl_weight_mask(d);
1.57 noro 350: }
351:
1.61 noro 352: int ndl_weight(UINT *d)
1.1 noro 353: {
1.61 noro 354: UINT t,u;
1.1 noro 355: int i,j;
356:
1.60 noro 357: if ( current_dl_weight_vector )
358: for ( i = 0, t = 0; i < nd_nvar; i++ ) {
359: u = GET_EXP(d,i);
360: t += MUL_WEIGHT(u,i);
361: }
362: else
363: for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) {
364: u = d[i];
365: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
366: t += (u&nd_mask0);
367: }
1.1 noro 368: return t;
369: }
370:
1.61 noro 371: void ndl_weight_mask(UINT *d)
1.43 noro 372: {
1.61 noro 373: UINT t,u;
374: UINT *mask;
375: int i,j,k,l;
1.43 noro 376:
1.61 noro 377: l = nd_blockmask->n;
378: for ( k = 0; k < l; k++ ) {
379: mask = nd_blockmask->mask[k];
380: if ( current_dl_weight_vector )
381: for ( i = 0, t = 0; i < nd_nvar; i++ ) {
382: u = GET_EXP_MASK(d,i,mask);
383: t += MUL_WEIGHT(u,i);
384: }
385: else
386: for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) {
387: u = d[i]&mask[i];
388: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
389: t += (u&nd_mask0);
390: }
391: d[k+1] = t;
392: }
1.43 noro 393: }
394:
1.61 noro 395: int ndl_lex_compare(UINT *d1,UINT *d2)
1.1 noro 396: {
397: int i;
398:
1.41 noro 399: d1 += nd_exporigin;
400: d2 += nd_exporigin;
401: for ( i = nd_exporigin; i < nd_wpd; i++, d1++, d2++ )
1.1 noro 402: if ( *d1 > *d2 )
1.32 noro 403: return nd_isrlex ? -1 : 1;
1.1 noro 404: else if ( *d1 < *d2 )
1.32 noro 405: return nd_isrlex ? 1 : -1;
1.1 noro 406: return 0;
407: }
408:
1.61 noro 409: int ndl_block_compare(UINT *d1,UINT *d2)
1.43 noro 410: {
411: int i,l,j,ord_o,ord_l;
412: struct order_pair *op;
1.61 noro 413: UINT t1,t2,m;
414: UINT *mask;
1.43 noro 415:
416: l = nd_blockmask->n;
417: op = nd_blockmask->order_pair;
418: for ( j = 0; j < l; j++ ) {
419: mask = nd_blockmask->mask[j];
420: ord_o = op[j].order;
421: if ( ord_o < 2 )
1.44 noro 422: if ( (t1=d1[j+1]) > (t2=d2[j+1]) ) return 1;
423: else if ( t1 < t2 ) return -1;
1.43 noro 424: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.44 noro 425: m = mask[i];
426: t1 = d1[i]&m;
427: t2 = d2[i]&m;
1.43 noro 428: if ( t1 > t2 )
429: return !ord_o ? -1 : 1;
430: else if ( t1 < t2 )
431: return !ord_o ? 1 : -1;
432: }
433: }
434: return 0;
435: }
436:
1.96 noro 437: int ndl_matrix_compare(UINT *d1,UINT *d2)
438: {
439: int i,j,s;
440: int *v;
441:
442: for ( j = 0; j < nd_nvar; j++ )
443: nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j);
444: for ( i = 0; i < nd_matrix_len; i++ ) {
445: v = nd_matrix[i];
446: for ( j = 0, s = 0; j < nd_nvar; j++ )
447: s += v[j]*nd_work_vector[j];
448: if ( s > 0 ) return 1;
449: else if ( s < 0 ) return -1;
450: }
451: return 0;
452: }
453:
1.97 noro 454: int ndl_composite_compare(UINT *d1,UINT *d2)
455: {
456: int i,j,s,start,end,len,o;
457: int *v;
458: struct sparse_weight *sw;
459:
460: for ( j = 0; j < nd_nvar; j++ )
461: nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j);
462: for ( i = 0; i < nd_worb_len; i++ ) {
463: len = nd_worb[i].length;
464: switch ( nd_worb[i].type ) {
465: case IS_DENSE_WEIGHT:
466: v = nd_worb[i].body.dense_weight;
467: for ( j = 0, s = 0; j < len; j++ )
468: s += v[j]*nd_work_vector[j];
469: if ( s > 0 ) return 1;
470: else if ( s < 0 ) return -1;
471: break;
472: case IS_SPARSE_WEIGHT:
473: sw = nd_worb[i].body.sparse_weight;
474: for ( j = 0, s = 0; j < len; j++ )
475: s += sw[j].value*nd_work_vector[sw[j].pos];
476: if ( s > 0 ) return 1;
477: else if ( s < 0 ) return -1;
478: break;
479: case IS_BLOCK:
480: o = nd_worb[i].body.block.order;
481: start = nd_worb[i].body.block.start;
482: switch ( o ) {
483: case 0:
484: end = start+len;
485: for ( j = start, s = 0; j < end; j++ )
486: s += MUL_WEIGHT(nd_work_vector[j],j);
487: if ( s > 0 ) return 1;
488: else if ( s < 0 ) return -1;
489: for ( j = end-1; j >= start; j-- )
490: if ( nd_work_vector[j] < 0 ) return 1;
491: else if ( nd_work_vector[j] > 0 ) return -1;
492: break;
493: case 1:
494: end = start+len;
495: for ( j = start, s = 0; j < end; j++ )
496: s += MUL_WEIGHT(nd_work_vector[j],j);
497: if ( s > 0 ) return 1;
498: else if ( s < 0 ) return -1;
499: for ( j = start; j < end; j++ )
500: if ( nd_work_vector[j] > 0 ) return 1;
501: else if ( nd_work_vector[j] < 0 ) return -1;
502: break;
503: case 2:
504: for ( j = start; j < end; j++ )
505: if ( nd_work_vector[j] > 0 ) return 1;
506: else if ( nd_work_vector[j] < 0 ) return -1;
507: break;
508: }
509: break;
510: }
511: }
512: return 0;
513: }
514:
1.58 noro 515: /* TDH -> WW -> TD-> RL */
516:
1.61 noro 517: int ndl_ww_lex_compare(UINT *d1,UINT *d2)
1.58 noro 518: {
519: int i,m,e1,e2;
520:
521: if ( TD(d1) > TD(d2) ) return 1;
522: else if ( TD(d1) < TD(d2) ) return -1;
523: m = nd_nvar>>1;
524: for ( i = 0, e1 = e2 = 0; i < m; i++ ) {
525: e1 += current_weyl_weight_vector[i]*(GET_EXP(d1,m+i)-GET_EXP(d1,i));
526: e2 += current_weyl_weight_vector[i]*(GET_EXP(d2,m+i)-GET_EXP(d2,i));
527: }
528: if ( e1 > e2 ) return 1;
529: else if ( e1 < e2 ) return -1;
530: return ndl_lex_compare(d1,d2);
531: }
532:
1.61 noro 533: INLINE int ndl_equal(UINT *d1,UINT *d2)
1.1 noro 534: {
535: int i;
536:
1.81 noro 537: switch ( nd_wpd ) {
538: case 2:
539: if ( TD(d2) != TD(d1) ) return 0;
540: if ( d2[1] != d1[1] ) return 0;
541: return 1;
542: break;
543: case 3:
544: if ( TD(d2) != TD(d1) ) return 0;
545: if ( d2[1] != d1[1] ) return 0;
546: if ( d2[2] != d1[2] ) return 0;
547: return 1;
548: break;
549: default:
550: for ( i = 0; i < nd_wpd; i++ )
551: if ( *d1++ != *d2++ ) return 0;
552: return 1;
553: break;
554: }
1.1 noro 555: }
556:
1.61 noro 557: INLINE void ndl_copy(UINT *d1,UINT *d2)
1.6 noro 558: {
559: int i;
560:
561: switch ( nd_wpd ) {
1.41 noro 562: case 2:
1.34 noro 563: TD(d2) = TD(d1);
564: d2[1] = d1[1];
1.6 noro 565: break;
1.41 noro 566: case 3:
1.34 noro 567: TD(d2) = TD(d1);
1.6 noro 568: d2[1] = d1[1];
1.34 noro 569: d2[2] = d1[2];
1.6 noro 570: break;
571: default:
1.41 noro 572: for ( i = 0; i < nd_wpd; i++ )
1.6 noro 573: d2[i] = d1[i];
574: break;
575: }
576: }
577:
1.61 noro 578: INLINE void ndl_zero(UINT *d)
579: {
580: int i;
581: for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;
582: }
583:
584: INLINE void ndl_add(UINT *d1,UINT *d2,UINT *d)
1.1 noro 585: {
586: int i;
587:
1.43 noro 588: #if 1
1.6 noro 589: switch ( nd_wpd ) {
1.41 noro 590: case 2:
591: TD(d) = TD(d1)+TD(d2);
1.34 noro 592: d[1] = d1[1]+d2[1];
1.6 noro 593: break;
1.41 noro 594: case 3:
595: TD(d) = TD(d1)+TD(d2);
1.6 noro 596: d[1] = d1[1]+d2[1];
1.34 noro 597: d[2] = d1[2]+d2[2];
1.6 noro 598: break;
599: default:
1.43 noro 600: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i];
1.6 noro 601: break;
602: }
1.43 noro 603: #else
604: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i];
605: #endif
1.6 noro 606: }
607:
1.55 noro 608: /* d1 += d2 */
1.61 noro 609: INLINE void ndl_addto(UINT *d1,UINT *d2)
1.55 noro 610: {
611: int i;
612:
613: #if 1
614: switch ( nd_wpd ) {
615: case 2:
616: TD(d1) += TD(d2);
617: d1[1] += d2[1];
618: break;
619: case 3:
620: TD(d1) += TD(d2);
621: d1[1] += d2[1];
622: d1[2] += d2[2];
623: break;
624: default:
625: for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i];
626: break;
627: }
628: #else
629: for ( i = 0; i < nd_wpd; i++ ) d1[i] += d2[i];
630: #endif
631: }
632:
1.61 noro 633: INLINE void ndl_sub(UINT *d1,UINT *d2,UINT *d)
1.6 noro 634: {
635: int i;
636:
1.43 noro 637: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]-d2[i];
1.1 noro 638: }
639:
1.61 noro 640: int ndl_disjoint(UINT *d1,UINT *d2)
1.1 noro 641: {
1.61 noro 642: UINT t1,t2,u,u1,u2;
1.1 noro 643: int i,j;
644:
1.65 noro 645: #if USE_UNROLL
1.1 noro 646: switch ( nd_bpe ) {
1.62 noro 647: case 3:
648: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
649: u1 = d1[i]; u2 = d2[i];
650: t1 = u1&0x38000000; t2 = u2&0x38000000; if ( t1&&t2 ) return 0;
651: t1 = u1& 0x7000000; t2 = u2& 0x7000000; if ( t1&&t2 ) return 0;
652: t1 = u1& 0xe00000; t2 = u2& 0xe00000; if ( t1&&t2 ) return 0;
653: t1 = u1& 0x1c0000; t2 = u2& 0x1c0000; if ( t1&&t2 ) return 0;
654: t1 = u1& 0x38000; t2 = u2& 0x38000; if ( t1&&t2 ) return 0;
655: t1 = u1& 0x7000; t2 = u2& 0x7000; if ( t1&&t2 ) return 0;
656: t1 = u1& 0xe00; t2 = u2& 0xe00; if ( t1&&t2 ) return 0;
657: t1 = u1& 0x1c0; t2 = u2& 0x1c0; if ( t1&&t2 ) return 0;
658: t1 = u1& 0x38; t2 = u2& 0x38; if ( t1&&t2 ) return 0;
659: t1 = u1& 0x7; t2 = u2& 0x7; if ( t1&&t2 ) return 0;
660: }
661: return 1;
662: break;
1.1 noro 663: case 4:
1.41 noro 664: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 665: u1 = d1[i]; u2 = d2[i];
666: t1 = u1&0xf0000000; t2 = u2&0xf0000000; if ( t1&&t2 ) return 0;
1.62 noro 667: t1 = u1& 0xf000000; t2 = u2& 0xf000000; if ( t1&&t2 ) return 0;
668: t1 = u1& 0xf00000; t2 = u2& 0xf00000; if ( t1&&t2 ) return 0;
669: t1 = u1& 0xf0000; t2 = u2& 0xf0000; if ( t1&&t2 ) return 0;
670: t1 = u1& 0xf000; t2 = u2& 0xf000; if ( t1&&t2 ) return 0;
671: t1 = u1& 0xf00; t2 = u2& 0xf00; if ( t1&&t2 ) return 0;
672: t1 = u1& 0xf0; t2 = u2& 0xf0; if ( t1&&t2 ) return 0;
673: t1 = u1& 0xf; t2 = u2& 0xf; if ( t1&&t2 ) return 0;
1.1 noro 674: }
675: return 1;
676: break;
677: case 6:
1.41 noro 678: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 679: u1 = d1[i]; u2 = d2[i];
680: t1 = u1&0x3f000000; t2 = u2&0x3f000000; if ( t1&&t2 ) return 0;
1.62 noro 681: t1 = u1& 0xfc0000; t2 = u2& 0xfc0000; if ( t1&&t2 ) return 0;
682: t1 = u1& 0x3f000; t2 = u2& 0x3f000; if ( t1&&t2 ) return 0;
683: t1 = u1& 0xfc0; t2 = u2& 0xfc0; if ( t1&&t2 ) return 0;
684: t1 = u1& 0x3f; t2 = u2& 0x3f; if ( t1&&t2 ) return 0;
1.1 noro 685: }
686: return 1;
687: break;
688: case 8:
1.41 noro 689: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 690: u1 = d1[i]; u2 = d2[i];
691: t1 = u1&0xff000000; t2 = u2&0xff000000; if ( t1&&t2 ) return 0;
1.62 noro 692: t1 = u1& 0xff0000; t2 = u2& 0xff0000; if ( t1&&t2 ) return 0;
693: t1 = u1& 0xff00; t2 = u2& 0xff00; if ( t1&&t2 ) return 0;
694: t1 = u1& 0xff; t2 = u2& 0xff; if ( t1&&t2 ) return 0;
1.1 noro 695: }
696: return 1;
697: break;
698: case 16:
1.41 noro 699: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 700: u1 = d1[i]; u2 = d2[i];
701: t1 = u1&0xffff0000; t2 = u2&0xffff0000; if ( t1&&t2 ) return 0;
1.62 noro 702: t1 = u1& 0xffff; t2 = u2& 0xffff; if ( t1&&t2 ) return 0;
1.1 noro 703: }
704: return 1;
705: break;
706: case 32:
1.41 noro 707: for ( i = nd_exporigin; i < nd_wpd; i++ )
1.1 noro 708: if ( d1[i] && d2[i] ) return 0;
709: return 1;
710: break;
711: default:
1.41 noro 712: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 713: u1 = d1[i]; u2 = d2[i];
714: for ( j = 0; j < nd_epw; j++ ) {
715: if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0;
716: u1 >>= nd_bpe; u2 >>= nd_bpe;
717: }
718: }
719: return 1;
720: break;
721: }
1.65 noro 722: #else
723: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
724: u1 = d1[i]; u2 = d2[i];
725: for ( j = 0; j < nd_epw; j++ ) {
726: if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0;
727: u1 >>= nd_bpe; u2 >>= nd_bpe;
728: }
729: }
730: return 1;
731: #endif
1.1 noro 732: }
733:
1.114 noro 734: int ndl_check_bound(UINT *d1,UINT *d2)
1.1 noro 735: {
1.61 noro 736: UINT u2;
1.5 noro 737: int i,j,ind,k;
1.1 noro 738:
1.5 noro 739: ind = 0;
1.65 noro 740: #if USE_UNROLL
1.5 noro 741: switch ( nd_bpe ) {
1.62 noro 742: case 3:
743: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
744: u2 = d2[i];
745: if ( d1[ind++]+((u2>>27)&0x7) >= 0x8 ) return 1;
746: if ( d1[ind++]+((u2>>24)&0x7) >= 0x8 ) return 1;
747: if ( d1[ind++]+((u2>>21)&0x7) >= 0x8 ) return 1;
748: if ( d1[ind++]+((u2>>18)&0x7) >= 0x8 ) return 1;
749: if ( d1[ind++]+((u2>>15)&0x7) >= 0x8 ) return 1;
750: if ( d1[ind++]+((u2>>12)&0x7) >= 0x8 ) return 1;
751: if ( d1[ind++]+((u2>>9)&0x7) >= 0x8 ) return 1;
752: if ( d1[ind++]+((u2>>6)&0x7) >= 0x8 ) return 1;
753: if ( d1[ind++]+((u2>>3)&0x7) >= 0x8 ) return 1;
754: if ( d1[ind++]+(u2&0x7) >= 0x8 ) return 1;
755: }
756: return 0;
757: break;
1.5 noro 758: case 4:
1.41 noro 759: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 760: u2 = d2[i];
761: if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1;
762: if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1;
763: if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1;
764: if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1;
765: if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1;
766: if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1;
767: if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1;
768: if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1;
769: }
770: return 0;
771: break;
772: case 6:
1.41 noro 773: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 774: u2 = d2[i];
775: if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1;
776: if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1;
777: if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1;
778: if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1;
779: if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1;
780: }
781: return 0;
782: break;
783: case 8:
1.41 noro 784: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 785: u2 = d2[i];
786: if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1;
787: if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1;
788: if ( d1[ind++]+((u2>>8)&0xff) >= 0x100 ) return 1;
789: if ( d1[ind++]+(u2&0xff) >= 0x100 ) return 1;
790: }
791: return 0;
792: break;
793: case 16:
1.41 noro 794: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 795: u2 = d2[i];
796: if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1;
797: if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1;
798: }
799: return 0;
800: break;
801: case 32:
1.41 noro 802: for ( i = nd_exporigin; i < nd_wpd; i++ )
1.5 noro 803: if ( d1[i]+d2[i]<d1[i] ) return 1;
804: return 0;
805: break;
806: default:
1.41 noro 807: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 808: u2 = d2[i];
809: k = (nd_epw-1)*nd_bpe;
810: for ( j = 0; j < nd_epw; j++, k -= nd_bpe )
811: if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1;
812: }
813: return 0;
814: break;
815: }
1.65 noro 816: #else
817: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
818: u2 = d2[i];
819: k = (nd_epw-1)*nd_bpe;
820: for ( j = 0; j < nd_epw; j++, k -= nd_bpe )
821: if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1;
822: }
823: return 0;
824: #endif
1.1 noro 825: }
826:
1.114 noro 827: int ndl_check_bound2(int index,UINT *d2)
828: {
829: return ndl_check_bound(nd_bound[index],d2);
830: }
831:
1.61 noro 832: INLINE int ndl_hash_value(UINT *d)
1.1 noro 833: {
834: int i;
835: int r;
836:
1.34 noro 837: r = 0;
1.41 noro 838: for ( i = 0; i < nd_wpd; i++ )
1.1 noro 839: r = ((r<<16)+d[i])%REDTAB_LEN;
840: return r;
841: }
842:
1.63 noro 843: INLINE int ndl_find_reducer(UINT *dg)
1.1 noro 844: {
1.13 noro 845: RHist r;
1.6 noro 846: int d,k,i;
1.1 noro 847:
1.63 noro 848: d = ndl_hash_value(dg);
1.13 noro 849: for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) {
1.34 noro 850: if ( ndl_equal(dg,DL(r)) ) {
1.1 noro 851: if ( k > 0 ) nd_notfirst++;
852: nd_found++;
1.13 noro 853: return r->index;
1.1 noro 854: }
855: }
1.13 noro 856: if ( Reverse )
857: for ( i = nd_psn-1; i >= 0; i-- ) {
858: r = nd_psh[i];
1.34 noro 859: if ( ndl_reducible(dg,DL(r)) ) {
1.13 noro 860: nd_create++;
1.34 noro 861: nd_append_red(dg,i);
1.13 noro 862: return i;
863: }
864: }
865: else
866: for ( i = 0; i < nd_psn; i++ ) {
867: r = nd_psh[i];
1.34 noro 868: if ( ndl_reducible(dg,DL(r)) ) {
1.13 noro 869: nd_create++;
1.34 noro 870: nd_append_red(dg,i);
1.13 noro 871: return i;
872: }
1.1 noro 873: }
1.6 noro 874: return -1;
1.1 noro 875: }
876:
1.63 noro 877: ND nd_merge(ND p1,ND p2)
878: {
879: int n,c;
880: int t,can,td1,td2;
881: ND r;
882: NM m1,m2,mr0,mr,s;
883:
884: if ( !p1 ) return p2;
885: else if ( !p2 ) return p1;
886: else {
887: can = 0;
888: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
889: c = DL_COMPARE(DL(m1),DL(m2));
890: switch ( c ) {
891: case 0:
892: s = m1; m1 = NEXT(m1);
893: can++; NEXTNM2(mr0,mr,s);
894: s = m2; m2 = NEXT(m2); FREENM(s);
895: break;
896: case 1:
897: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
898: break;
899: case -1:
900: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
901: break;
902: }
903: }
904: if ( !mr0 )
905: if ( m1 ) mr0 = m1;
906: else if ( m2 ) mr0 = m2;
907: else return 0;
908: else if ( m1 ) NEXT(mr) = m1;
909: else if ( m2 ) NEXT(mr) = m2;
910: else NEXT(mr) = 0;
911: BDY(p1) = mr0;
912: SG(p1) = MAX(SG(p1),SG(p2));
913: LEN(p1) = LEN(p1)+LEN(p2)-can;
914: FREEND(p2);
915: return p1;
916: }
917: }
918:
1.31 noro 919: ND nd_add(int mod,ND p1,ND p2)
1.1 noro 920: {
921: int n,c;
1.34 noro 922: int t,can,td1,td2;
1.1 noro 923: ND r;
924: NM m1,m2,mr0,mr,s;
925:
1.34 noro 926: if ( !p1 ) return p2;
927: else if ( !p2 ) return p1;
1.71 noro 928: else if ( mod == -1 ) return nd_add_sf(p1,p2);
1.113 noro 929: else if ( !mod ) return nd_add_q(p1,p2);
1.1 noro 930: else {
1.30 noro 931: can = 0;
1.1 noro 932: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1.34 noro 933: c = DL_COMPARE(DL(m1),DL(m2));
1.1 noro 934: switch ( c ) {
935: case 0:
1.19 noro 936: t = ((CM(m1))+(CM(m2))) - mod;
1.34 noro 937: if ( t < 0 ) t += mod;
1.1 noro 938: s = m1; m1 = NEXT(m1);
939: if ( t ) {
1.34 noro 940: can++; NEXTNM2(mr0,mr,s); CM(mr) = (t);
1.17 noro 941: } else {
1.34 noro 942: can += 2; FREENM(s);
1.17 noro 943: }
944: s = m2; m2 = NEXT(m2); FREENM(s);
1.95 noro 945: break;
946: case 1:
947: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
948: break;
949: case -1:
950: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
951: break;
952: }
953: }
954: if ( !mr0 )
955: if ( m1 ) mr0 = m1;
956: else if ( m2 ) mr0 = m2;
957: else return 0;
958: else if ( m1 ) NEXT(mr) = m1;
959: else if ( m2 ) NEXT(mr) = m2;
960: else NEXT(mr) = 0;
961: BDY(p1) = mr0;
962: SG(p1) = MAX(SG(p1),SG(p2));
963: LEN(p1) = LEN(p1)+LEN(p2)-can;
964: FREEND(p2);
965: return p1;
966: }
967: }
968:
969: /* XXX on opteron, the inlined manipulation of destructive additon of
970: * two NM seems to make gcc optimizer get confused, so the part is
971: * done in a function.
972: */
973:
1.113 noro 974: int nm_destructive_add_q(NM *m1,NM *m2,NM *mr0,NM *mr)
1.95 noro 975: {
976: NM s;
1.113 noro 977: Q t;
1.95 noro 978: int can;
979:
1.113 noro 980: addq(CQ(*m1),CQ(*m2),&t);
1.95 noro 981: s = *m1; *m1 = NEXT(*m1);
982: if ( t ) {
1.113 noro 983: can = 1; NEXTNM2(*mr0,*mr,s); CQ(*mr) = (t);
1.95 noro 984: } else {
985: can = 2; FREENM(s);
986: }
987: s = *m2; *m2 = NEXT(*m2); FREENM(s);
988: return can;
989: }
990:
1.113 noro 991: ND nd_add_q(ND p1,ND p2)
1.95 noro 992: {
993: int n,c,can;
994: ND r;
995: NM m1,m2,mr0,mr,s;
1.113 noro 996: Q t;
1.95 noro 997:
998: if ( !p1 ) return p2;
999: else if ( !p2 ) return p1;
1000: else {
1001: can = 0;
1002: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1003: c = DL_COMPARE(DL(m1),DL(m2));
1004: switch ( c ) {
1005: case 0:
1006: #if defined(__x86_64__)
1.113 noro 1007: can += nm_destructive_add_q(&m1,&m2,&mr0,&mr);
1.95 noro 1008: #else
1.113 noro 1009: addq(CQ(m1),CQ(m2),&t);
1.95 noro 1010: s = m1; m1 = NEXT(m1);
1011: if ( t ) {
1.113 noro 1012: can++; NEXTNM2(mr0,mr,s); CQ(mr) = (t);
1.95 noro 1013: } else {
1014: can += 2; FREENM(s);
1015: }
1016: s = m2; m2 = NEXT(m2); FREENM(s);
1017: #endif
1.17 noro 1018: break;
1019: case 1:
1020: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
1021: break;
1022: case -1:
1023: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
1024: break;
1025: }
1026: }
1027: if ( !mr0 )
1.34 noro 1028: if ( m1 ) mr0 = m1;
1029: else if ( m2 ) mr0 = m2;
1030: else return 0;
1031: else if ( m1 ) NEXT(mr) = m1;
1032: else if ( m2 ) NEXT(mr) = m2;
1033: else NEXT(mr) = 0;
1.17 noro 1034: BDY(p1) = mr0;
1035: SG(p1) = MAX(SG(p1),SG(p2));
1.31 noro 1036: LEN(p1) = LEN(p1)+LEN(p2)-can;
1.17 noro 1037: FREEND(p2);
1038: return p1;
1039: }
1040: }
1041:
1.71 noro 1042: ND nd_add_sf(ND p1,ND p2)
1043: {
1044: int n,c,can;
1045: ND r;
1046: NM m1,m2,mr0,mr,s;
1047: int t;
1048:
1049: if ( !p1 ) return p2;
1050: else if ( !p2 ) return p1;
1051: else {
1052: can = 0;
1053: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1054: c = DL_COMPARE(DL(m1),DL(m2));
1055: switch ( c ) {
1056: case 0:
1057: t = _addsf(CM(m1),CM(m2));
1058: s = m1; m1 = NEXT(m1);
1059: if ( t ) {
1060: can++; NEXTNM2(mr0,mr,s); CM(mr) = (t);
1061: } else {
1062: can += 2; FREENM(s);
1063: }
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: }
1087: }
1088:
1.1 noro 1089: /* ret=1 : success, ret=0 : overflow */
1.113 noro 1090: int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp)
1.1 noro 1091: {
1.11 noro 1092: ND d;
1.1 noro 1093: NM m,mrd,tail;
1.7 noro 1094: NM mul;
1.10 noro 1095: int n,sugar,psugar,sugar0,stat,index;
1.30 noro 1096: int c,c1,c2,dummy;
1.17 noro 1097: RHist h;
1.11 noro 1098: NDV p,red;
1.113 noro 1099: Q cg,cred,gcd,tq,qq;
1.21 noro 1100: double hmag;
1.1 noro 1101:
1.113 noro 1102: if ( dn ) {
1103: if ( mod )
1104: dn->m = 1;
1105: else
1106: dn->z = ONE;
1107: }
1.1 noro 1108: if ( !g ) {
1109: *rp = 0;
1110: return 1;
1111: }
1.113 noro 1112: if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1.21 noro 1113:
1.14 noro 1114: sugar0 = sugar = SG(g);
1.1 noro 1115: n = NV(g);
1.61 noro 1116: mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
1.1 noro 1117: for ( d = 0; g; ) {
1.63 noro 1118: index = ndl_find_reducer(HDL(g));
1.6 noro 1119: if ( index >= 0 ) {
1.17 noro 1120: h = nd_psh[index];
1121: ndl_sub(HDL(g),DL(h),DL(mul));
1.14 noro 1122: if ( ndl_check_bound2(index,DL(mul)) ) {
1.6 noro 1123: nd_free(g); nd_free(d);
1124: return 0;
1125: }
1.77 noro 1126: if ( nd_demand )
1127: p = ndv_load(index);
1128: else
1129: p = ps[index];
1.71 noro 1130: if ( mod == -1 )
1131: CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g)));
1132: else if ( mod ) {
1.19 noro 1133: c1 = invm(HCM(p),mod); c2 = mod-HCM(g);
1134: DMAR(c1,c2,0,mod,c); CM(mul) = c;
1.16 noro 1135: } else {
1.113 noro 1136: igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);
1137: chsgnq(cg,&CQ(mul));
1138: nd_mul_c_q(d,cred); nd_mul_c_q(g,cred);
1.69 noro 1139: if ( dn ) {
1.113 noro 1140: mulq(dn->z,cred,&tq); dn->z = tq;
1.69 noro 1141: }
1.16 noro 1142: }
1.55 noro 1143: g = nd_add(mod,g,ndv_mul_nm(mod,mul,p));
1.34 noro 1144: sugar = MAX(sugar,SG(p)+TD(DL(mul)));
1.113 noro 1145: if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) {
1146: tq = HCQ(g);
1.21 noro 1147: nd_removecont2(d,g);
1.69 noro 1148: if ( dn ) {
1.113 noro 1149: divq(tq,HCQ(g),&qq); divq(dn->z,qq,&tq); dn->z = tq;
1.69 noro 1150: }
1.113 noro 1151: hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1.21 noro 1152: }
1.1 noro 1153: } else if ( !full ) {
1154: *rp = g;
1155: return 1;
1156: } else {
1157: m = BDY(g);
1158: if ( NEXT(m) ) {
1.34 noro 1159: BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--;
1.1 noro 1160: } else {
1161: FREEND(g); g = 0;
1162: }
1163: if ( d ) {
1.34 noro 1164: NEXT(tail)=m; tail=m; LEN(d)++;
1.1 noro 1165: } else {
1.34 noro 1166: MKND(n,m,1,d); tail = BDY(d);
1.1 noro 1167: }
1168: }
1169: }
1.34 noro 1170: if ( d ) SG(d) = sugar;
1.1 noro 1171: *rp = d;
1172: return 1;
1173: }
1.28 noro 1174:
1.53 noro 1175: int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp)
1.25 noro 1176: {
1177: int hindex,index;
1178: NDV p;
1179: ND u,d,red;
1180: NODE l;
1.31 noro 1181: NM mul,m,mrd,tail;
1.25 noro 1182: int sugar,psugar,n,h_reducible;
1183: PGeoBucket bucket;
1184: int c,c1,c2;
1.113 noro 1185: Q cg,cred,gcd,zzz;
1.25 noro 1186: RHist h;
1.28 noro 1187: double hmag,gmag;
1.77 noro 1188: int count = 0;
1189: int hcount = 0;
1.25 noro 1190:
1191: if ( !g ) {
1192: *rp = 0;
1193: return 1;
1194: }
1195: sugar = SG(g);
1196: n = NV(g);
1.113 noro 1197: if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1.25 noro 1198: bucket = create_pbucket();
1.31 noro 1199: add_pbucket(mod,bucket,g);
1.25 noro 1200: d = 0;
1.61 noro 1201: mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
1.25 noro 1202: while ( 1 ) {
1.113 noro 1203: hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket);
1.25 noro 1204: if ( hindex < 0 ) {
1.77 noro 1205: if ( DP_Print > 3 ) printf("(%d %d)",count,hcount);
1.34 noro 1206: if ( d ) SG(d) = sugar;
1.25 noro 1207: *rp = d;
1208: return 1;
1209: }
1210: g = bucket->body[hindex];
1.63 noro 1211: index = ndl_find_reducer(HDL(g));
1.25 noro 1212: if ( index >= 0 ) {
1.77 noro 1213: count++;
1214: if ( !d ) hcount++;
1.25 noro 1215: h = nd_psh[index];
1216: ndl_sub(HDL(g),DL(h),DL(mul));
1217: if ( ndl_check_bound2(index,DL(mul)) ) {
1.26 noro 1218: nd_free(d);
1.25 noro 1219: free_pbucket(bucket);
1220: *rp = 0;
1221: return 0;
1222: }
1.53 noro 1223: p = ps[index];
1.71 noro 1224: if ( mod == -1 )
1225: CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g)));
1226: else if ( mod ) {
1.25 noro 1227: c1 = invm(HCM(p),mod); c2 = mod-HCM(g);
1228: DMAR(c1,c2,0,mod,c); CM(mul) = c;
1229: } else {
1.113 noro 1230: igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);
1231: chsgnq(cg,&CQ(mul));
1232: nd_mul_c_q(d,cred);
1233: mulq_pbucket(bucket,cred);
1.26 noro 1234: g = bucket->body[hindex];
1.113 noro 1235: gmag = (double)p_mag((P)HCQ(g));
1.25 noro 1236: }
1.55 noro 1237: red = ndv_mul_nm(mod,mul,p);
1.25 noro 1238: bucket->body[hindex] = nd_remove_head(g);
1239: red = nd_remove_head(red);
1.31 noro 1240: add_pbucket(mod,bucket,red);
1.34 noro 1241: psugar = SG(p)+TD(DL(mul));
1242: sugar = MAX(sugar,psugar);
1.28 noro 1243: if ( !mod && hmag && (gmag > hmag) ) {
1244: g = normalize_pbucket(mod,bucket);
1245: if ( !g ) {
1.34 noro 1246: if ( d ) SG(d) = sugar;
1.28 noro 1247: *rp = d;
1248: return 1;
1249: }
1250: nd_removecont2(d,g);
1.113 noro 1251: hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1.31 noro 1252: add_pbucket(mod,bucket,g);
1.28 noro 1253: }
1.25 noro 1254: } else if ( !full ) {
1255: g = normalize_pbucket(mod,bucket);
1.34 noro 1256: if ( g ) SG(g) = sugar;
1.25 noro 1257: *rp = g;
1258: return 1;
1259: } else {
1260: m = BDY(g);
1261: if ( NEXT(m) ) {
1.34 noro 1262: BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--;
1.25 noro 1263: } else {
1264: FREEND(g); g = 0;
1265: }
1266: bucket->body[hindex] = g;
1267: NEXT(m) = 0;
1268: if ( d ) {
1.34 noro 1269: NEXT(tail)=m; tail=m; LEN(d)++;
1.25 noro 1270: } else {
1.34 noro 1271: MKND(n,m,1,d); tail = BDY(d);
1.25 noro 1272: }
1273: }
1274: }
1275: }
1.27 noro 1276:
1.61 noro 1277: /* input : list of NDV, cand : list of NDV */
1.28 noro 1278:
1.61 noro 1279: int ndv_check_candidate(NODE input,int obpe,int oadv,EPOS oepos,NODE cand)
1.28 noro 1280: {
1281: int n,i,stat;
1282: ND nf,d;
1.61 noro 1283: NDV r;
1.45 noro 1284: NODE t,s;
1.113 noro 1285: union oNDC dn;
1.45 noro 1286:
1.61 noro 1287: ndv_setup(0,0,cand);
1.31 noro 1288: n = length(cand);
1.28 noro 1289:
1290: /* membercheck : list is a subset of Id(cand) ? */
1291: for ( t = input; t; t = NEXT(t) ) {
1.45 noro 1292: again:
1.61 noro 1293: if ( nd_bpe > obpe )
1294: r = ndv_dup_realloc((NDV)BDY(t),obpe,oadv,oepos);
1295: else
1296: r = (NDV)BDY(t);
1297: d = ndvtond(0,r);
1.69 noro 1298: stat = nd_nf(0,d,nd_ps,0,0,&nf);
1.45 noro 1299: if ( !stat ) {
1.103 noro 1300: nd_reconstruct(0,0);
1.45 noro 1301: goto again;
1302: } else if ( nf ) return 0;
1.71 noro 1303: if ( DP_Print ) { printf("."); fflush(stdout); }
1.28 noro 1304: }
1.71 noro 1305: if ( DP_Print ) { printf("\n"); }
1.28 noro 1306: /* gbcheck : cand is a GB of Id(cand) ? */
1.77 noro 1307: if ( !nd_gb(0,0,1) ) return 0;
1.28 noro 1308: /* XXX */
1.23 noro 1309: return 1;
1310: }
1.1 noro 1311:
1312: ND nd_remove_head(ND p)
1313: {
1314: NM m;
1315:
1316: m = BDY(p);
1317: if ( !NEXT(m) ) {
1.34 noro 1318: FREEND(p); p = 0;
1.31 noro 1319: } else {
1.34 noro 1320: BDY(p) = NEXT(m); LEN(p)--;
1.31 noro 1321: }
1.1 noro 1322: FREENM(m);
1323: return p;
1324: }
1325:
1.69 noro 1326: ND nd_separate_head(ND p,ND *head)
1327: {
1328: NM m,m0;
1329: ND r;
1330:
1331: m = BDY(p);
1332: if ( !NEXT(m) ) {
1333: *head = p; p = 0;
1334: } else {
1335: m0 = m;
1336: BDY(p) = NEXT(m); LEN(p)--;
1337: NEXT(m0) = 0;
1338: MKND(NV(p),m0,1,r);
1339: *head = r;
1340: }
1341: return p;
1342: }
1343:
1.1 noro 1344: PGeoBucket create_pbucket()
1345: {
1346: PGeoBucket g;
1347:
1348: g = CALLOC(1,sizeof(struct oPGeoBucket));
1349: g->m = -1;
1350: return g;
1351: }
1352:
1.25 noro 1353: void free_pbucket(PGeoBucket b) {
1354: int i;
1355:
1.26 noro 1356: for ( i = 0; i <= b->m; i++ )
1.25 noro 1357: if ( b->body[i] ) {
1358: nd_free(b->body[i]);
1359: b->body[i] = 0;
1360: }
1361: GC_free(b);
1362: }
1363:
1.63 noro 1364: void add_pbucket_symbolic(PGeoBucket g,ND d)
1365: {
1366: int l,i,k,m;
1367:
1368: if ( !d )
1369: return;
1370: l = LEN(d);
1371: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
1372: /* 2^(k-1) < l <= 2^k (=m) */
1373: d = nd_merge(g->body[k],d);
1374: for ( ; d && LEN(d) > m; k++, m <<= 1 ) {
1375: g->body[k] = 0;
1376: d = nd_merge(g->body[k+1],d);
1377: }
1378: g->body[k] = d;
1379: g->m = MAX(g->m,k);
1380: }
1381:
1.31 noro 1382: void add_pbucket(int mod,PGeoBucket g,ND d)
1.1 noro 1383: {
1.31 noro 1384: int l,i,k,m;
1.1 noro 1385:
1.31 noro 1386: if ( !d )
1387: return;
1388: l = LEN(d);
1.29 noro 1389: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
1390: /* 2^(k-1) < l <= 2^k (=m) */
1.31 noro 1391: d = nd_add(mod,g->body[k],d);
1392: for ( ; d && LEN(d) > m; k++, m <<= 1 ) {
1.1 noro 1393: g->body[k] = 0;
1.31 noro 1394: d = nd_add(mod,g->body[k+1],d);
1.1 noro 1395: }
1396: g->body[k] = d;
1397: g->m = MAX(g->m,k);
1398: }
1399:
1.113 noro 1400: void mulq_pbucket(PGeoBucket g,Q c)
1.26 noro 1401: {
1402: int k;
1403:
1404: for ( k = 0; k <= g->m; k++ )
1.113 noro 1405: nd_mul_c_q(g->body[k],c);
1.26 noro 1406: }
1407:
1.63 noro 1408: NM remove_head_pbucket_symbolic(PGeoBucket g)
1409: {
1410: int j,i,k,c;
1411: NM head;
1412:
1413: k = g->m;
1414: j = -1;
1415: for ( i = 0; i <= k; i++ ) {
1416: if ( !g->body[i] ) continue;
1417: if ( j < 0 ) j = i;
1418: else {
1419: c = DL_COMPARE(HDL(g->body[i]),HDL(g->body[j]));
1420: if ( c > 0 )
1421: j = i;
1422: else if ( c == 0 )
1423: g->body[i] = nd_remove_head(g->body[i]);
1424: }
1425: }
1426: if ( j < 0 ) return 0;
1427: else {
1428: head = BDY(g->body[j]);
1429: if ( !NEXT(head) ) {
1430: FREEND(g->body[j]);
1431: g->body[j] = 0;
1432: } else {
1433: BDY(g->body[j]) = NEXT(head);
1434: LEN(g->body[j])--;
1435: }
1436: return head;
1437: }
1438: }
1439:
1.19 noro 1440: int head_pbucket(int mod,PGeoBucket g)
1.1 noro 1441: {
1442: int j,i,c,k,nv,sum;
1.61 noro 1443: UINT *di,*dj;
1.1 noro 1444: ND gi,gj;
1445:
1446: k = g->m;
1447: while ( 1 ) {
1448: j = -1;
1449: for ( i = 0; i <= k; i++ ) {
1450: if ( !(gi = g->body[i]) )
1451: continue;
1452: if ( j < 0 ) {
1453: j = i;
1454: gj = g->body[j];
1455: dj = HDL(gj);
1.14 noro 1456: sum = HCM(gj);
1.1 noro 1457: } else {
1.34 noro 1458: c = DL_COMPARE(HDL(gi),dj);
1.1 noro 1459: if ( c > 0 ) {
1.34 noro 1460: if ( sum ) HCM(gj) = sum;
1461: else g->body[j] = nd_remove_head(gj);
1.1 noro 1462: j = i;
1463: gj = g->body[j];
1464: dj = HDL(gj);
1.14 noro 1465: sum = HCM(gj);
1.1 noro 1466: } else if ( c == 0 ) {
1.71 noro 1467: if ( mod == -1 )
1468: sum = _addsf(sum,HCM(gi));
1469: else {
1470: sum = sum+HCM(gi)-mod;
1471: if ( sum < 0 ) sum += mod;
1472: }
1.1 noro 1473: g->body[i] = nd_remove_head(gi);
1474: }
1475: }
1476: }
1.34 noro 1477: if ( j < 0 ) return -1;
1.1 noro 1478: else if ( sum ) {
1.14 noro 1479: HCM(gj) = sum;
1.26 noro 1480: return j;
1.31 noro 1481: } else
1.26 noro 1482: g->body[j] = nd_remove_head(gj);
1483: }
1484: }
1485:
1.113 noro 1486: int head_pbucket_q(PGeoBucket g)
1.26 noro 1487: {
1488: int j,i,c,k,nv;
1.113 noro 1489: Q sum,t;
1.26 noro 1490: ND gi,gj;
1491:
1492: k = g->m;
1493: while ( 1 ) {
1494: j = -1;
1495: for ( i = 0; i <= k; i++ ) {
1.34 noro 1496: if ( !(gi = g->body[i]) ) continue;
1.26 noro 1497: if ( j < 0 ) {
1498: j = i;
1499: gj = g->body[j];
1.113 noro 1500: sum = HCQ(gj);
1.26 noro 1501: } else {
1502: nv = NV(gi);
1.34 noro 1503: c = DL_COMPARE(HDL(gi),HDL(gj));
1.26 noro 1504: if ( c > 0 ) {
1.113 noro 1505: if ( sum ) HCQ(gj) = sum;
1.34 noro 1506: else g->body[j] = nd_remove_head(gj);
1.26 noro 1507: j = i;
1508: gj = g->body[j];
1.113 noro 1509: sum = HCQ(gj);
1.26 noro 1510: } else if ( c == 0 ) {
1.113 noro 1511: addq(sum,HCQ(gi),&t);
1512: sum = t;
1.26 noro 1513: g->body[i] = nd_remove_head(gi);
1514: }
1515: }
1516: }
1.34 noro 1517: if ( j < 0 ) return -1;
1.26 noro 1518: else if ( sum ) {
1.113 noro 1519: HCQ(gj) = sum;
1.1 noro 1520: return j;
1.31 noro 1521: } else
1.1 noro 1522: g->body[j] = nd_remove_head(gj);
1523: }
1524: }
1525:
1.25 noro 1526: ND normalize_pbucket(int mod,PGeoBucket g)
1.1 noro 1527: {
1.31 noro 1528: int i;
1.1 noro 1529: ND r,t;
1530:
1531: r = 0;
1.28 noro 1532: for ( i = 0; i <= g->m; i++ ) {
1.31 noro 1533: r = nd_add(mod,r,g->body[i]);
1.28 noro 1534: g->body[i] = 0;
1535: }
1536: g->m = -1;
1.1 noro 1537: return r;
1538: }
1539:
1.122 noro 1540: int do_diagonalize(int sugar,int m)
1.92 noro 1541: {
1542: int i,nh,stat;
1543: NODE r,g,t;
1544: ND h,nf,s,head;
1545: NDV nfv;
1.113 noro 1546: Q q,num,den;
1547: union oNDC dn;
1.92 noro 1548:
1549: for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) {
1550: if ( nd_demand )
1551: nfv = ndv_load(i);
1552: else
1553: nfv = nd_ps[i];
1554: s = ndvtond(m,nfv);
1555: s = nd_separate_head(s,&head);
1.122 noro 1556: stat = nd_nf(m,s,nd_ps,1,&dn,&nf);
1557: if ( !stat ) return 0;
1.92 noro 1558: if ( !m ) {
1.113 noro 1559: NTOQ(NM(dn.z),SGN(dn.z),num);
1560: mulq(HCQ(head),num,&q); HCQ(head) = q;
1561: if ( DN(dn.z) ) {
1562: NTOQ(DN(dn.z),1,den);
1563: nd_mul_c_q(nf,den);
1564: }
1.92 noro 1565: }
1566: nf = nd_add(m,head,nf);
1567: ndv_free(nfv);
1568: nd_removecont(m,nf);
1569: nfv = ndtondv(m,nf);
1570: nd_free(nf);
1571: nd_bound[i] = ndv_compute_bound(nfv);
1572: if ( nd_demand ) {
1573: ndv_save(nfv,i);
1574: ndv_free(nfv);
1575: } else
1576: nd_ps[i] = nfv;
1577: }
1.122 noro 1578: return 1;
1.92 noro 1579: }
1580:
1.27 noro 1581: /* return value = 0 => input is not a GB */
1582:
1.77 noro 1583: NODE nd_gb(int m,int ishomo,int checkonly)
1.1 noro 1584: {
1585: int i,nh,sugar,stat;
1.23 noro 1586: NODE r,g,t;
1.1 noro 1587: ND_pairs d;
1588: ND_pairs l;
1.117 noro 1589: ND h,nf,s,head,nf1;
1.63 noro 1590: NDV nfv;
1.113 noro 1591: Q q,num,den;
1592: union oNDC dn;
1.1 noro 1593:
1.23 noro 1594: g = 0; d = 0;
1595: for ( i = 0; i < nd_psn; i++ ) {
1.1 noro 1596: d = update_pairs(d,g,i);
1597: g = update_base(g,i);
1598: }
1599: sugar = 0;
1600: while ( d ) {
1601: again:
1602: l = nd_minp(d,&d);
1.14 noro 1603: if ( SG(l) != sugar ) {
1.122 noro 1604: if ( ishomo ) {
1605: stat = do_diagonalize(sugar,m);
1606: if ( !stat ) {
1607: NEXT(l) = d; d = l;
1608: d = nd_reconstruct(0,d);
1609: goto again;
1610: }
1611: }
1.14 noro 1612: sugar = SG(l);
1.71 noro 1613: if ( DP_Print ) fprintf(asir_out,"%d",sugar);
1.1 noro 1614: }
1.53 noro 1615: stat = nd_sp(m,0,l,&h);
1.1 noro 1616: if ( !stat ) {
1617: NEXT(l) = d; d = l;
1.103 noro 1618: d = nd_reconstruct(0,d);
1.1 noro 1619: goto again;
1620: }
1.41 noro 1621: #if USE_GEOBUCKET
1.69 noro 1622: stat = m?nd_nf_pbucket(m,h,nd_ps,!Top,&nf):nd_nf(m,h,nd_ps,!Top,0,&nf);
1.41 noro 1623: #else
1.69 noro 1624: stat = nd_nf(m,h,nd_ps,!Top,0,&nf);
1.41 noro 1625: #endif
1.1 noro 1626: if ( !stat ) {
1627: NEXT(l) = d; d = l;
1.103 noro 1628: d = nd_reconstruct(0,d);
1.1 noro 1629: goto again;
1630: } else if ( nf ) {
1.27 noro 1631: if ( checkonly ) return 0;
1.71 noro 1632: if ( DP_Print ) { printf("+"); fflush(stdout); }
1.63 noro 1633: nd_removecont(m,nf);
1.118 noro 1634: if ( !m && nd_nalg ) {
1635: nd_monic(0,&nf);
1636: nd_removecont(m,nf);
1.117 noro 1637: }
1.63 noro 1638: nfv = ndtondv(m,nf); nd_free(nf);
1.77 noro 1639: nh = ndv_newps(m,nfv,0);
1.1 noro 1640: d = update_pairs(d,g,nh);
1641: g = update_base(g,nh);
1642: FREENDP(l);
1643: } else {
1.71 noro 1644: if ( DP_Print ) { printf("."); fflush(stdout); }
1.1 noro 1645: FREENDP(l);
1646: }
1647: }
1.77 noro 1648: if ( nd_demand )
1649: for ( t = g; t; t = NEXT(t) )
1650: BDY(t) = (pointer)ndv_load((int)BDY(t));
1651: else
1652: for ( t = g; t; t = NEXT(t) )
1653: BDY(t) = (pointer)nd_ps[(int)BDY(t)];
1.1 noro 1654: return g;
1655: }
1656:
1.122 noro 1657: int do_diagonalize_trace(int sugar,int m)
1.91 noro 1658: {
1659: int i,nh,stat;
1660: NODE r,g,t;
1661: ND h,nf,nfq,s,head;
1662: NDV nfv,nfqv;
1.113 noro 1663: Q q,den,num;
1664: union oNDC dn;
1.91 noro 1665:
1666: for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) {
1667: /* for nd_ps */
1668: s = ndvtond(m,nd_ps[i]);
1669: s = nd_separate_head(s,&head);
1.122 noro 1670: stat = nd_nf_pbucket(m,s,nd_ps,1,&nf);
1671: if ( !stat ) return 0;
1.91 noro 1672: nf = nd_add(m,head,nf);
1673: ndv_free(nd_ps[i]);
1674: nd_ps[i] = ndtondv(m,nf);
1675: nd_free(nf);
1676:
1677: /* for nd_ps_trace */
1678: if ( nd_demand )
1679: nfv = ndv_load(i);
1680: else
1681: nfv = nd_ps_trace[i];
1682: s = ndvtond(0,nfv);
1683: s = nd_separate_head(s,&head);
1.122 noro 1684: stat = nd_nf(0,s,nd_ps_trace,1,&dn,&nf);
1685: if ( !stat ) return 0;
1.113 noro 1686: NTOQ(NM(dn.z),SGN(dn.z),num);
1687: mulq(HCQ(head),num,&q); HCQ(head) = q;
1688: if ( DN(dn.z) ) {
1689: NTOQ(DN(dn.z),1,den);
1690: nd_mul_c_q(nf,den);
1691: }
1.91 noro 1692: nf = nd_add(0,head,nf);
1693: ndv_free(nfv);
1694: nd_removecont(0,nf);
1695: nfv = ndtondv(0,nf);
1696: nd_free(nf);
1697: nd_bound[i] = ndv_compute_bound(nfv);
1698: if ( nd_demand ) {
1699: ndv_save(nfv,i);
1700: ndv_free(nfv);
1701: } else
1702: nd_ps_trace[i] = nfv;
1703: }
1.122 noro 1704: return 1;
1.91 noro 1705: }
1706:
1.118 noro 1707: static struct oEGT eg_invdalg;
1708: struct oEGT eg_le;
1709:
1.82 noro 1710: NODE nd_gb_trace(int m,int ishomo)
1.20 noro 1711: {
1712: int i,nh,sugar,stat;
1.23 noro 1713: NODE r,g,t;
1.20 noro 1714: ND_pairs d;
1715: ND_pairs l;
1.82 noro 1716: ND h,nf,nfq,s,head;
1.63 noro 1717: NDV nfv,nfqv;
1.113 noro 1718: Q q,den,num;
1719: union oNDC dn;
1.118 noro 1720: struct oEGT eg_monic,egm0,egm1;
1.20 noro 1721:
1.118 noro 1722: init_eg(&eg_monic);
1723: init_eg(&eg_invdalg);
1724: init_eg(&eg_le);
1.23 noro 1725: g = 0; d = 0;
1726: for ( i = 0; i < nd_psn; i++ ) {
1.20 noro 1727: d = update_pairs(d,g,i);
1728: g = update_base(g,i);
1729: }
1730: sugar = 0;
1731: while ( d ) {
1732: again:
1733: l = nd_minp(d,&d);
1734: if ( SG(l) != sugar ) {
1.122 noro 1735: if ( ishomo ) {
1736: stat = do_diagonalize_trace(sugar,m);
1737: if ( !stat ) {
1738: NEXT(l) = d; d = l;
1739: d = nd_reconstruct(1,d);
1740: goto again;
1741: }
1742: }
1.20 noro 1743: sugar = SG(l);
1.71 noro 1744: if ( DP_Print ) fprintf(asir_out,"%d",sugar);
1.20 noro 1745: }
1.53 noro 1746: stat = nd_sp(m,0,l,&h);
1.20 noro 1747: if ( !stat ) {
1748: NEXT(l) = d; d = l;
1.103 noro 1749: d = nd_reconstruct(1,d);
1.20 noro 1750: goto again;
1751: }
1.41 noro 1752: #if USE_GEOBUCKET
1.53 noro 1753: stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf);
1.41 noro 1754: #else
1.69 noro 1755: stat = nd_nf(m,h,nd_ps,!Top,0,&nf);
1.41 noro 1756: #endif
1.20 noro 1757: if ( !stat ) {
1758: NEXT(l) = d; d = l;
1.103 noro 1759: d = nd_reconstruct(1,d);
1.20 noro 1760: goto again;
1761: } else if ( nf ) {
1.77 noro 1762: if ( nd_demand ) {
1763: nfqv = ndv_load(nd_psn);
1764: nfq = ndvtond(0,nfqv);
1765: } else
1766: nfq = 0;
1767: if ( !nfq ) {
1768: if ( !nd_sp(0,1,l,&h) || !nd_nf(0,h,nd_ps_trace,!Top,0,&nfq) ) {
1769: NEXT(l) = d; d = l;
1.103 noro 1770: d = nd_reconstruct(1,d);
1.77 noro 1771: goto again;
1772: }
1.70 noro 1773: }
1.20 noro 1774: if ( nfq ) {
1.70 noro 1775: /* m|HC(nfq) => failure */
1.113 noro 1776: if ( !rem(NM(HCQ(nfq)),m) ) return 0;
1.63 noro 1777:
1.71 noro 1778: if ( DP_Print ) { printf("+"); fflush(stdout); }
1.118 noro 1779: if ( nd_nalg ) {
1780: /* m|DN(HC(nf)^(-1)) => failure */
1781: get_eg(&egm0);
1782: if ( !nd_monic(m,&nfq) ) return 0;
1783: get_eg(&egm1); add_eg(&eg_monic,&egm0,&egm1);
1784: nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq);
1785: nfv = ndv_dup(0,nfqv); ndv_mod(m,nfv); nd_free(nf);
1786: } else {
1787: nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq);
1788: nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf);
1789: }
1.77 noro 1790: nh = ndv_newps(0,nfv,nfqv);
1.20 noro 1791: d = update_pairs(d,g,nh);
1792: g = update_base(g,nh);
1793: } else {
1.71 noro 1794: if ( DP_Print ) { printf("*"); fflush(stdout); }
1.20 noro 1795: }
1796: } else {
1.71 noro 1797: if ( DP_Print ) { printf("."); fflush(stdout); }
1.20 noro 1798: }
1799: FREENDP(l);
1800: }
1.77 noro 1801: if ( nd_demand )
1802: for ( t = g; t; t = NEXT(t) )
1803: BDY(t) = (pointer)ndv_load((int)BDY(t));
1804: else
1805: for ( t = g; t; t = NEXT(t) )
1806: BDY(t) = (pointer)nd_ps_trace[(int)BDY(t)];
1.118 noro 1807: if ( nd_nalg ) {
1808: print_eg("monic",&eg_monic);
1809: print_eg("invdalg",&eg_invdalg);
1810: print_eg("le",&eg_le);
1811: }
1.20 noro 1812: return g;
1813: }
1814:
1.23 noro 1815: int ndv_compare(NDV *p1,NDV *p2)
1816: {
1.34 noro 1817: return DL_COMPARE(HDL(*p1),HDL(*p2));
1.23 noro 1818: }
1819:
1820: int ndv_compare_rev(NDV *p1,NDV *p2)
1821: {
1.34 noro 1822: return -DL_COMPARE(HDL(*p1),HDL(*p2));
1.23 noro 1823: }
1824:
1.61 noro 1825: NODE ndv_reduceall(int m,NODE f)
1.23 noro 1826: {
1.69 noro 1827: int i,n,stat;
1828: ND nf,g,head;
1.23 noro 1829: NODE t,a0,a;
1.113 noro 1830: union oNDC dn;
1.69 noro 1831: NDV *w;
1.113 noro 1832: Q q,num,den;
1.23 noro 1833:
1.69 noro 1834: n = length(f);
1835: #if 0
1836: w = (NDV *)ALLOCA(n*sizeof(NDV));
1837: for ( i = 0, t = f; i < n; i++, t = NEXT(t) ) w[i] = (NDV)BDY(t);
1838: qsort(w,n,sizeof(NDV),
1839: (int (*)(const void *,const void *))ndv_compare);
1840: for ( t = f, i = 0; t; i++, t = NEXT(t) ) BDY(t) = (pointer)w[i];
1841: #endif
1842: ndv_setup(m,0,f);
1843: for ( i = 0; i < n; ) {
1844: g = ndvtond(m,nd_ps[i]);
1845: g = nd_separate_head(g,&head);
1846: stat = nd_nf(m,g,nd_ps,1,&dn,&nf);
1.50 noro 1847: if ( !stat )
1.103 noro 1848: nd_reconstruct(0,0);
1.69 noro 1849: else {
1.71 noro 1850: if ( DP_Print ) { printf("."); fflush(stdout); }
1.85 noro 1851: if ( !m ) {
1.113 noro 1852: NTOQ(NM(dn.z),SGN(dn.z),num);
1853: mulq(HCQ(head),num,&q); HCQ(head) = q;
1854: if ( DN(dn.z) ) {
1855: NTOQ(DN(dn.z),1,den);
1856: nd_mul_c_q(nf,den);
1857: }
1.85 noro 1858: }
1.69 noro 1859: nf = nd_add(m,head,nf);
1860: ndv_free(nd_ps[i]);
1.24 noro 1861: nd_removecont(m,nf);
1.69 noro 1862: nd_ps[i] = ndtondv(m,nf); nd_free(nf);
1863: nd_bound[i] = ndv_compute_bound(nd_ps[i]);
1.50 noro 1864: i++;
1.23 noro 1865: }
1866: }
1.71 noro 1867: if ( DP_Print ) { printf("\n"); }
1.23 noro 1868: for ( a0 = 0, i = 0; i < n; i++ ) {
1869: NEXTNODE(a0,a);
1.69 noro 1870: BDY(a) = (pointer)nd_ps[i];
1.23 noro 1871: }
1872: NEXT(a) = 0;
1873: return a0;
1874: }
1875:
1.1 noro 1876: ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t)
1877: {
1878: ND_pairs d1,nd,cur,head,prev,remove;
1879:
1880: if ( !g ) return d;
1881: d = crit_B(d,t);
1882: d1 = nd_newpairs(g,t);
1883: d1 = crit_M(d1);
1884: d1 = crit_F(d1);
1.55 noro 1885: if ( do_weyl )
1886: head = d1;
1887: else {
1888: prev = 0; cur = head = d1;
1889: while ( cur ) {
1890: if ( crit_2( cur->i1,cur->i2 ) ) {
1891: remove = cur;
1892: if ( !prev ) head = cur = NEXT(cur);
1893: else cur = NEXT(prev) = NEXT(cur);
1894: FREENDP(remove);
1895: } else {
1896: prev = cur; cur = NEXT(cur);
1897: }
1.1 noro 1898: }
1899: }
1900: if ( !d )
1901: return head;
1902: else {
1903: nd = d;
1.34 noro 1904: while ( NEXT(nd) ) nd = NEXT(nd);
1.1 noro 1905: NEXT(nd) = head;
1906: return d;
1907: }
1908: }
1909:
1910: ND_pairs nd_newpairs( NODE g, int t )
1911: {
1912: NODE h;
1.61 noro 1913: UINT *dl;
1.34 noro 1914: int ts,s;
1.1 noro 1915: ND_pairs r,r0;
1916:
1.20 noro 1917: dl = DL(nd_psh[t]);
1.34 noro 1918: ts = SG(nd_psh[t]) - TD(dl);
1.1 noro 1919: for ( r0 = 0, h = g; h; h = NEXT(h) ) {
1920: NEXTND_pairs(r0,r);
1921: r->i1 = (int)BDY(h);
1922: r->i2 = t;
1.20 noro 1923: ndl_lcm(DL(nd_psh[r->i1]),dl,r->lcm);
1.34 noro 1924: s = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1]));
1925: SG(r) = MAX(s,ts) + TD(LCM(r));
1.1 noro 1926: }
1927: NEXT(r) = 0;
1928: return r0;
1929: }
1930:
1931: ND_pairs crit_B( ND_pairs d, int s )
1932: {
1933: ND_pairs cur,head,prev,remove;
1.61 noro 1934: UINT *t,*tl,*lcm;
1.1 noro 1935: int td,tdl;
1936:
1937: if ( !d ) return 0;
1.20 noro 1938: t = DL(nd_psh[s]);
1.1 noro 1939: prev = 0;
1940: head = cur = d;
1.61 noro 1941: lcm = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
1.1 noro 1942: while ( cur ) {
1943: tl = cur->lcm;
1944: if ( ndl_reducible(tl,t)
1.20 noro 1945: && (ndl_lcm(DL(nd_psh[cur->i1]),t,lcm),!ndl_equal(lcm,tl))
1946: && (ndl_lcm(DL(nd_psh[cur->i2]),t,lcm),!ndl_equal(lcm,tl)) ) {
1.1 noro 1947: remove = cur;
1948: if ( !prev ) {
1949: head = cur = NEXT(cur);
1950: } else {
1951: cur = NEXT(prev) = NEXT(cur);
1952: }
1953: FREENDP(remove);
1954: } else {
1.34 noro 1955: prev = cur; cur = NEXT(cur);
1.1 noro 1956: }
1957: }
1958: return head;
1959: }
1960:
1961: ND_pairs crit_M( ND_pairs d1 )
1962: {
1963: ND_pairs e,d2,d3,dd,p;
1.61 noro 1964: UINT *id,*jd;
1.1 noro 1965:
1966: for ( dd = 0, e = d1; e; e = d3 ) {
1967: if ( !(d2 = NEXT(e)) ) {
1968: NEXT(e) = dd;
1969: return e;
1970: }
1.34 noro 1971: id = LCM(e);
1.1 noro 1972: for ( d3 = 0; d2; d2 = p ) {
1.34 noro 1973: p = NEXT(d2);
1974: jd = LCM(d2);
1975: if ( ndl_equal(jd,id) )
1976: ;
1977: else if ( TD(jd) > TD(id) )
1.1 noro 1978: if ( ndl_reducible(jd,id) ) continue;
1979: else ;
1.34 noro 1980: else if ( ndl_reducible(id,jd) ) goto delit;
1.1 noro 1981: NEXT(d2) = d3;
1982: d3 = d2;
1983: }
1984: NEXT(e) = dd;
1985: dd = e;
1986: continue;
1987: /**/
1988: delit: NEXT(d2) = d3;
1989: d3 = d2;
1990: for ( ; p; p = d2 ) {
1991: d2 = NEXT(p);
1992: NEXT(p) = d3;
1993: d3 = p;
1994: }
1995: FREENDP(e);
1996: }
1997: return dd;
1998: }
1999:
2000: ND_pairs crit_F( ND_pairs d1 )
2001: {
2002: ND_pairs rest, head,remove;
2003: ND_pairs last, p, r, w;
2004: int s;
2005:
2006: for ( head = last = 0, p = d1; NEXT(p); ) {
2007: r = w = equivalent_pairs(p,&rest);
1.14 noro 2008: s = SG(r);
1.1 noro 2009: w = NEXT(w);
2010: while ( w ) {
2011: if ( crit_2(w->i1,w->i2) ) {
2012: r = w;
2013: w = NEXT(w);
2014: while ( w ) {
2015: remove = w;
2016: w = NEXT(w);
2017: FREENDP(remove);
2018: }
2019: break;
1.14 noro 2020: } else if ( SG(w) < s ) {
1.1 noro 2021: FREENDP(r);
2022: r = w;
1.14 noro 2023: s = SG(r);
1.1 noro 2024: w = NEXT(w);
2025: } else {
2026: remove = w;
2027: w = NEXT(w);
2028: FREENDP(remove);
2029: }
2030: }
2031: if ( last ) NEXT(last) = r;
2032: else head = r;
2033: NEXT(last = r) = 0;
2034: p = rest;
2035: if ( !p ) return head;
2036: }
2037: if ( !last ) return p;
2038: NEXT(last) = p;
2039: return head;
2040: }
2041:
2042: int crit_2( int dp1, int dp2 )
2043: {
1.20 noro 2044: return ndl_disjoint(DL(nd_psh[dp1]),DL(nd_psh[dp2]));
1.1 noro 2045: }
2046:
1.40 noro 2047: ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest )
1.1 noro 2048: {
2049: ND_pairs w,p,r,s;
1.61 noro 2050: UINT *d;
1.1 noro 2051:
2052: w = d1;
1.34 noro 2053: d = LCM(w);
1.1 noro 2054: s = NEXT(w);
2055: NEXT(w) = 0;
2056: for ( r = 0; s; s = p ) {
2057: p = NEXT(s);
1.34 noro 2058: if ( ndl_equal(d,LCM(s)) ) {
1.39 noro 2059: NEXT(s) = w; w = s;
1.1 noro 2060: } else {
1.39 noro 2061: NEXT(s) = r; r = s;
1.1 noro 2062: }
2063: }
2064: *prest = r;
2065: return w;
2066: }
2067:
2068: NODE update_base(NODE nd,int ndp)
2069: {
1.61 noro 2070: UINT *dl, *dln;
1.1 noro 2071: NODE last, p, head;
2072:
1.20 noro 2073: dl = DL(nd_psh[ndp]);
1.1 noro 2074: for ( head = last = 0, p = nd; p; ) {
1.20 noro 2075: dln = DL(nd_psh[(int)BDY(p)]);
1.34 noro 2076: if ( ndl_reducible( dln, dl ) ) {
1.1 noro 2077: p = NEXT(p);
2078: if ( last ) NEXT(last) = p;
2079: } else {
2080: if ( !last ) head = p;
2081: p = NEXT(last = p);
2082: }
2083: }
2084: head = append_one(head,ndp);
2085: return head;
2086: }
2087:
2088: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest )
2089: {
2090: ND_pairs m,ml,p,l;
1.61 noro 2091: UINT *lcm;
1.33 noro 2092: int s,td,len,tlen,c,c1;
1.1 noro 2093:
2094: if ( !(p = NEXT(m = d)) ) {
2095: *prest = p;
2096: NEXT(m) = 0;
2097: return m;
2098: }
1.14 noro 2099: s = SG(m);
1.77 noro 2100: if ( !NoSugar ) {
2101: for ( ml = 0, l = m; p; p = NEXT(l = p) )
2102: if ( (SG(p) < s)
2103: || ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) {
2104: ml = l; m = p; s = SG(m);
2105: }
2106: } else {
2107: for ( ml = 0, l = m; p; p = NEXT(l = p) )
2108: if ( DL_COMPARE(LCM(p),LCM(m)) < 0 ) {
2109: ml = l; m = p; s = SG(m);
2110: }
2111: }
1.1 noro 2112: if ( !ml ) *prest = NEXT(m);
2113: else {
2114: NEXT(ml) = NEXT(m);
2115: *prest = d;
2116: }
2117: NEXT(m) = 0;
2118: return m;
2119: }
2120:
1.63 noro 2121: ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest )
2122: {
1.69 noro 2123: int msugar,i;
1.63 noro 2124: ND_pairs t,dm0,dm,dr0,dr;
2125:
2126: for ( msugar = SG(d), t = NEXT(d); t; t = NEXT(t) )
2127: if ( SG(t) < msugar ) msugar = SG(t);
2128: dm0 = 0; dr0 = 0;
1.69 noro 2129: for ( i = 0, t = d; t; t = NEXT(t) )
2130: if ( i < nd_f4_nsp && SG(t) == msugar ) {
1.63 noro 2131: if ( dm0 ) NEXT(dm) = t;
2132: else dm0 = t;
2133: dm = t;
1.69 noro 2134: i++;
1.63 noro 2135: } else {
2136: if ( dr0 ) NEXT(dr) = t;
2137: else dr0 = t;
2138: dr = t;
2139: }
2140: NEXT(dm) = 0;
2141: if ( dr0 ) NEXT(dr) = 0;
2142: *prest = dr0;
2143: return dm0;
2144: }
2145:
1.77 noro 2146: int ndv_newps(int m,NDV a,NDV aq)
1.1 noro 2147: {
1.3 noro 2148: int len;
1.13 noro 2149: RHist r;
1.20 noro 2150: NDV b;
1.3 noro 2151:
1.1 noro 2152: if ( nd_psn == nd_pslen ) {
2153: nd_pslen *= 2;
1.11 noro 2154: nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV));
1.53 noro 2155: nd_ps_trace = (NDV *)REALLOC((char *)nd_ps_trace,nd_pslen*sizeof(NDV));
1.13 noro 2156: nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist));
1.61 noro 2157: nd_bound = (UINT **)
2158: REALLOC((char *)nd_bound,nd_pslen*sizeof(UINT *));
1.1 noro 2159: }
1.39 noro 2160: NEWRHist(r); nd_psh[nd_psn] = r;
1.63 noro 2161: nd_ps[nd_psn] = a;
1.39 noro 2162: if ( aq ) {
1.63 noro 2163: nd_ps_trace[nd_psn] = aq;
2164: nd_bound[nd_psn] = ndv_compute_bound(aq);
1.39 noro 2165: SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r));
1.53 noro 2166: } else {
1.63 noro 2167: nd_bound[nd_psn] = ndv_compute_bound(a);
1.53 noro 2168: SG(r) = SG(a); ndl_copy(HDL(a),DL(r));
1.39 noro 2169: }
1.77 noro 2170: if ( nd_demand ) {
2171: if ( aq ) {
2172: ndv_save(nd_ps_trace[nd_psn],nd_psn);
2173: nd_ps_trace[nd_psn] = 0;
2174: } else {
2175: ndv_save(nd_ps[nd_psn],nd_psn);
2176: nd_ps[nd_psn] = 0;
2177: }
2178: }
1.1 noro 2179: return nd_psn++;
2180: }
2181:
1.61 noro 2182: void ndv_setup(int mod,int trace,NODE f)
1.1 noro 2183: {
1.5 noro 2184: int i,j,td,len,max;
1.1 noro 2185: NODE s,s0,f0;
1.61 noro 2186: UINT *d;
1.13 noro 2187: RHist r;
1.69 noro 2188: NDV *w;
1.61 noro 2189: NDV a,am;
1.11 noro 2190:
2191: nd_found = 0; nd_notfirst = 0; nd_create = 0;
1.1 noro 2192:
1.69 noro 2193: for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++;
2194: w = (NDV *)ALLOCA(nd_psn*sizeof(NDV));
2195: for ( i = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) w[i++] = BDY(s);
2196: qsort(w,nd_psn,sizeof(NDV),
2197: (int (*)(const void *,const void *))ndv_compare);
2198: nd_pslen = 2*nd_psn;
1.11 noro 2199: nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.53 noro 2200: nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.13 noro 2201: nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist));
1.61 noro 2202: nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *));
1.57 noro 2203:
1.11 noro 2204: if ( !nd_red )
1.13 noro 2205: nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist));
1.71 noro 2206: for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0;
1.69 noro 2207: for ( i = 0; i < nd_psn; i++ ) {
1.39 noro 2208: if ( trace ) {
1.69 noro 2209: a = nd_ps_trace[i] = ndv_dup(0,w[i]);
1.61 noro 2210: ndv_removecont(0,a);
2211: am = nd_ps[i] = ndv_dup(mod,a);
2212: ndv_mod(mod,am);
2213: ndv_removecont(mod,am);
2214: } else {
1.69 noro 2215: a = nd_ps[i] = ndv_dup(mod,w[i]);
1.61 noro 2216: ndv_removecont(mod,a);
1.39 noro 2217: }
1.61 noro 2218: NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r));
1.57 noro 2219: nd_bound[i] = ndv_compute_bound(a);
1.20 noro 2220: nd_psh[i] = r;
1.77 noro 2221: if ( nd_demand ) {
2222: if ( trace ) {
2223: ndv_save(nd_ps_trace[i],i);
2224: nd_ps_trace[i] = 0;
2225: } else {
2226: ndv_save(nd_ps[i],i);
2227: nd_ps[i] = 0;
2228: }
2229: }
1.20 noro 2230: }
2231: }
2232:
1.119 noro 2233: struct order_spec *append_block(struct order_spec *spec,
2234: int nv,int nalg,int ord);
2235:
1.121 noro 2236: extern VECT current_dl_weight_vector_obj;
2237: static VECT prev_weight_vector_obj;
2238:
1.120 noro 2239: void preprocess_algcoef(VL vv,VL av,struct order_spec *ord,LIST f,
2240: struct order_spec **ord1p,LIST *f1p,NODE *alistp)
2241: {
1.121 noro 2242: NODE alist,t,s,r0,r,arg;
1.120 noro 2243: VL tv;
2244: P poly;
2245: DP d;
2246: Alg alpha,dp;
2247: DAlg inv,da,hc;
2248: MP m;
1.121 noro 2249: int i,nvar,nalg,n;
1.120 noro 2250: NumberField nf;
2251: LIST f1,f2;
2252: struct order_spec *current_spec;
1.121 noro 2253: VECT obj,obj0;
2254: Obj tmp;
1.120 noro 2255:
2256: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++);
2257: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++);
2258:
2259: for ( alist = 0, tv = av; tv; tv = NEXT(tv) ) {
2260: NEXTNODE(alist,t); MKV(tv->v,poly);
2261: MKAlg(poly,alpha); BDY(t) = (pointer)alpha;
2262: tv->v = tv->v->priv;
2263: }
2264: NEXT(t) = 0;
2265:
2266: /* simplification, makeing polynomials monic */
2267: setfield_dalg(alist);
2268: obj_algtodalg(f,&f1);
2269: for ( t = BDY(f); t; t = NEXT(t) ) {
2270: initd(ord); ptod(vv,vv,(P)BDY(t),&d);
2271: hc = (DAlg)BDY(d)->c;
2272: if ( NID(hc) == N_DA ) {
2273: invdalg(hc,&inv);
2274: for ( m = BDY(d); m; m = NEXT(m) ) {
2275: muldalg(inv,(DAlg)m->c,&da); m->c = (P)da;
2276: }
2277: }
2278: initd(ord); dtop(vv,vv,d,&poly); BDY(f) = (pointer)poly;
2279: }
2280: obj_dalgtoalg(f1,&f);
2281:
2282: /* append alg vars to the var list */
2283: for ( tv = vv; NEXT(tv); tv = NEXT(tv) );
2284: NEXT(tv) = av;
2285:
2286: /* append a block to ord */
2287: *ord1p = append_block(ord,nvar,nalg,2);
2288:
2289: /* create generator list */
2290: nf = get_numberfield();
2291: for ( i = nalg-1, t = BDY(f); i >= 0; i-- ) {
2292: MKAlg(nf->defpoly[i],dp);
2293: MKNODE(s,dp,t); t = s;
2294: }
2295: MKLIST(f1,t);
2296: *alistp = alist;
2297: algobjtorat(f1,f1p);
1.121 noro 2298:
2299: /* creating a new weight vector */
2300: prev_weight_vector_obj = obj0 = current_dl_weight_vector_obj;
2301: n = nvar+nalg+1;
2302: MKVECT(obj,n);
2303: if ( obj0 && obj0->len == nvar )
2304: for ( i = 0; i < nvar; i++ ) BDY(obj)[i] = BDY(obj0)[i];
2305: else
2306: for ( i = 0; i < nvar; i++ ) BDY(obj)[i] = (pointer)ONE;
2307: for ( i = 0; i < nalg; i++ ) BDY(obj)[i+nvar] = 0;
2308: BDY(obj)[n-1] = (pointer)ONE;
2309: arg = mknode(1,obj);
2310: Pdp_set_weight(arg,&tmp);
2311: }
2312:
2313: NODE postprocess_algcoef(VL av,NODE alist,NODE r)
2314: {
2315: NODE s,t,u0,u;
2316: P p;
2317: VL tv;
2318: Obj obj,tmp;
2319: NODE arg;
2320:
2321: u0 = 0;
2322: for ( t = r; t; t = NEXT(t) ) {
2323: p = (P)BDY(t);
2324: for ( tv = av, s = alist; tv; tv = NEXT(tv), s = NEXT(s) ) {
2325: substr(CO,0,(Obj)p,tv->v,(Obj)BDY(s),&obj); p = (P)obj;
2326: }
2327: if ( OID(p) == O_P || (OID(p) == O_N && NID((Num)p) != N_A) ) {
2328: NEXTNODE(u0,u);
2329: BDY(u) = (pointer)p;
2330: }
2331: }
2332: arg = mknode(1,prev_weight_vector_obj);
2333: Pdp_set_weight(arg,&tmp);
2334:
2335: return u0;
1.120 noro 2336: }
2337:
1.63 noro 2338: void nd_gr(LIST f,LIST v,int m,int f4,struct order_spec *ord,LIST *rp)
1.1 noro 2339: {
1.119 noro 2340: VL tv,fv,vv,vc,av;
2341: NODE fd,fd0,r,r0,t,x,s,xx,alist;
2342: int e,max,nvar,i;
1.69 noro 2343: NDV b;
1.119 noro 2344: int ishomo,nalg;
2345: Alg alpha,dp;
2346: P p;
2347: LIST f1,f2;
2348: Obj obj;
2349: NumberField nf;
1.120 noro 2350: struct order_spec *ord1;
1.1 noro 2351:
1.78 noro 2352: if ( !m && Demand ) nd_demand = 1;
2353: else nd_demand = 0;
2354:
1.103 noro 2355: #if 0
1.74 noro 2356: ndv_alloc = 0;
1.103 noro 2357: #endif
1.1 noro 2358: get_vars((Obj)f,&fv); pltovl(v,&vv);
1.74 noro 2359: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
1.88 noro 2360: switch ( ord->id ) {
2361: case 1:
2362: if ( ord->nv != nvar )
2363: error("nd_{gr,f4} : invalid order specification");
2364: break;
2365: default:
2366: break;
2367: }
1.119 noro 2368: nd_nalg = 0;
1.123 ! noro 2369: av = 0;
1.119 noro 2370: if ( !m ) {
2371: get_algtree((Obj)f,&av);
2372: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
1.121 noro 2373: nd_ntrans = nvar;
1.119 noro 2374: nd_nalg = nalg;
2375: /* #i -> t#i */
2376: if ( nalg ) {
1.120 noro 2377: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
2378: ord = ord1;
2379: f = f1;
1.119 noro 2380: }
1.120 noro 2381: nvar += nalg;
1.119 noro 2382: }
1.32 noro 2383: nd_init_ord(ord);
1.61 noro 2384: for ( t = BDY(f), max = 0; t; t = NEXT(t) )
2385: for ( tv = vv; tv; tv = NEXT(tv) ) {
2386: e = getdeg(tv->v,(P)BDY(t));
2387: max = MAX(e,max);
2388: }
2389: nd_setup_parameters(nvar,max);
1.77 noro 2390: ishomo = 1;
1.1 noro 2391: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
1.61 noro 2392: b = (pointer)ptondv(CO,vv,(P)BDY(t));
1.77 noro 2393: if ( ishomo )
2394: ishomo = ishomo && ndv_ishomo(b);
1.69 noro 2395: if ( m ) ndv_mod(m,b);
1.61 noro 2396: if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; }
1.1 noro 2397: }
2398: if ( fd0 ) NEXT(fd) = 0;
1.61 noro 2399: ndv_setup(m,0,fd0);
1.77 noro 2400: x = f4?nd_f4(m):nd_gb(m,ishomo,0);
1.82 noro 2401: nd_demand = 0;
1.61 noro 2402: x = ndv_reducebase(x);
2403: x = ndv_reduceall(m,x);
1.23 noro 2404: for ( r0 = 0, t = x; t; t = NEXT(t) ) {
1.1 noro 2405: NEXTNODE(r0,r);
1.61 noro 2406: BDY(r) = ndvtop(m,CO,vv,BDY(t));
1.20 noro 2407: }
2408: if ( r0 ) NEXT(r) = 0;
1.121 noro 2409: if ( nalg )
2410: r0 = postprocess_algcoef(av,alist,r0);
1.20 noro 2411: MKLIST(*rp,r0);
1.103 noro 2412: #if 0
1.74 noro 2413: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.103 noro 2414: #endif
1.20 noro 2415: }
2416:
1.52 noro 2417: void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp)
1.20 noro 2418: {
1.119 noro 2419: VL tv,fv,vv,vc,av;
2420: NODE fd,fd0,in0,in,r,r0,t,s,cand,alist;
1.61 noro 2421: int m,nocheck,nvar,mindex,e,max;
2422: NDV c;
2423: NMV a;
1.27 noro 2424: P p;
1.61 noro 2425: EPOS oepos;
1.119 noro 2426: int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg;
2427: Alg alpha,dp;
2428: P poly;
2429: LIST f1,f2;
2430: Obj obj;
2431: NumberField nf;
1.120 noro 2432: struct order_spec *ord1;
1.20 noro 2433:
2434: get_vars((Obj)f,&fv); pltovl(v,&vv);
1.74 noro 2435: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
1.88 noro 2436: switch ( ord->id ) {
2437: case 1:
2438: if ( ord->nv != nvar )
2439: error("nd_gr_trace : invalid order specification");
2440: break;
2441: default:
2442: break;
2443: }
1.119 noro 2444:
2445: get_algtree((Obj)f,&av);
2446: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
1.121 noro 2447: nd_ntrans = nvar;
1.119 noro 2448: nd_nalg = nalg;
2449: /* #i -> t#i */
2450: if ( nalg ) {
1.120 noro 2451: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
2452: ord = ord1;
2453: f = f1;
1.119 noro 2454: }
1.120 noro 2455: nvar += nalg;
1.119 noro 2456:
1.52 noro 2457: nocheck = 0;
2458: mindex = 0;
2459:
1.78 noro 2460: if ( Demand ) nd_demand = 1;
2461: else nd_demand = 0;
2462:
1.52 noro 2463: /* setup modulus */
2464: if ( trace < 0 ) {
2465: trace = -trace;
2466: nocheck = 1;
2467: }
2468: m = trace > 1 ? trace : get_lprime(mindex);
1.61 noro 2469: for ( t = BDY(f), max = 0; t; t = NEXT(t) )
2470: for ( tv = vv; tv; tv = NEXT(tv) ) {
2471: e = getdeg(tv->v,(P)BDY(t));
2472: max = MAX(e,max);
1.23 noro 2473: }
1.61 noro 2474: nd_init_ord(ord);
2475: nd_setup_parameters(nvar,max);
2476: obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos;
1.82 noro 2477: ishomo = 1;
1.61 noro 2478: for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
2479: c = ptondv(CO,vv,(P)BDY(t));
1.82 noro 2480: if ( ishomo )
2481: ishomo = ishomo && ndv_ishomo(c);
1.61 noro 2482: if ( c ) {
2483: NEXTNODE(in0,in); BDY(in) = (pointer)c;
2484: NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c);
1.23 noro 2485: }
1.61 noro 2486: }
2487: if ( in0 ) NEXT(in) = 0;
2488: if ( fd0 ) NEXT(fd) = 0;
1.82 noro 2489: if ( !ishomo && homo ) {
1.122 noro 2490: for ( t = in0, wmax = max; t; t = NEXT(t) ) {
1.61 noro 2491: c = (NDV)BDY(t); len = LEN(c);
2492: for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) )
2493: wmax = MAX(TD(DL(a)),wmax);
2494: }
2495: homogenize_order(ord,nvar,&ord1);
1.89 noro 2496: nd_init_ord(ord1);
1.61 noro 2497: nd_setup_parameters(nvar+1,wmax);
2498: for ( t = fd0; t; t = NEXT(t) )
2499: ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos);
1.27 noro 2500: }
1.52 noro 2501: while ( 1 ) {
1.77 noro 2502: if ( Demand )
2503: nd_demand = 1;
1.61 noro 2504: ndv_setup(m,1,fd0);
1.82 noro 2505: cand = nd_gb_trace(m,ishomo || homo);
1.52 noro 2506: if ( !cand ) {
2507: /* failure */
1.61 noro 2508: if ( trace > 1 ) { *rp = 0; return; }
2509: else m = get_lprime(++mindex);
1.52 noro 2510: continue;
2511: }
1.82 noro 2512: if ( !ishomo && homo ) {
1.27 noro 2513: /* dehomogenization */
1.61 noro 2514: for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord);
1.45 noro 2515: nd_init_ord(ord);
1.61 noro 2516: nd_setup_parameters(nvar,0);
1.27 noro 2517: }
1.77 noro 2518: nd_demand = 0;
1.61 noro 2519: cand = ndv_reducebase(cand);
2520: cand = ndv_reduceall(0,cand);
1.78 noro 2521: cbpe = nd_bpe;
1.61 noro 2522: if ( nocheck )
2523: break;
2524: if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) )
1.52 noro 2525: /* success */
2526: break;
2527: else if ( trace > 1 ) {
2528: /* failure */
2529: *rp = 0; return;
1.61 noro 2530: } else {
1.52 noro 2531: /* try the next modulus */
2532: m = get_lprime(++mindex);
1.61 noro 2533: /* reset the parameters */
1.82 noro 2534: if ( !ishomo && homo ) {
1.89 noro 2535: nd_init_ord(ord1);
1.61 noro 2536: nd_setup_parameters(nvar+1,wmax);
2537: } else {
2538: nd_init_ord(ord);
2539: nd_setup_parameters(nvar,max);
2540: }
2541: }
1.52 noro 2542: }
1.27 noro 2543: /* dp->p */
1.61 noro 2544: nd_bpe = cbpe;
1.73 noro 2545: nd_setup_parameters(nd_nvar,0);
1.121 noro 2546: for ( r = cand; r; r = NEXT(r) )
1.119 noro 2547: BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r));
1.121 noro 2548: if ( nalg )
2549: cand = postprocess_algcoef(av,alist,cand);
1.27 noro 2550: MKLIST(*rp,cand);
1.1 noro 2551: }
2552:
1.61 noro 2553: void dltondl(int n,DL dl,UINT *r)
1.1 noro 2554: {
1.61 noro 2555: UINT *d;
1.57 noro 2556: int i,j,l,s,ord_l;
1.43 noro 2557: struct order_pair *op;
1.1 noro 2558:
2559: d = dl->d;
1.41 noro 2560: for ( i = 0; i < nd_wpd; i++ ) r[i] = 0;
1.43 noro 2561: if ( nd_blockmask ) {
2562: l = nd_blockmask->n;
2563: op = nd_blockmask->order_pair;
2564: for ( j = 0, s = 0; j < l; j++ ) {
2565: ord_l = op[j].length;
1.57 noro 2566: for ( i = 0; i < ord_l; i++, s++ ) PUT_EXP(r,s,d[s]);
1.43 noro 2567: }
2568: TD(r) = ndl_weight(r);
1.61 noro 2569: ndl_weight_mask(r);
1.43 noro 2570: } else {
1.56 noro 2571: for ( i = 0; i < n; i++ ) PUT_EXP(r,i,d[i]);
1.43 noro 2572: TD(r) = ndl_weight(r);
2573: }
1.1 noro 2574: }
2575:
1.61 noro 2576: DL ndltodl(int n,UINT *ndl)
1.1 noro 2577: {
2578: DL dl;
2579: int *d;
1.57 noro 2580: int i,j,l,s,ord_l;
1.43 noro 2581: struct order_pair *op;
1.1 noro 2582:
2583: NEWDL(dl,n);
1.34 noro 2584: dl->td = TD(ndl);
1.1 noro 2585: d = dl->d;
1.43 noro 2586: if ( nd_blockmask ) {
2587: l = nd_blockmask->n;
2588: op = nd_blockmask->order_pair;
2589: for ( j = 0, s = 0; j < l; j++ ) {
2590: ord_l = op[j].length;
1.57 noro 2591: for ( i = 0; i < ord_l; i++, s++ ) d[s] = GET_EXP(ndl,s);
1.43 noro 2592: }
2593: } else {
1.56 noro 2594: for ( i = 0; i < n; i++ ) d[i] = GET_EXP(ndl,i);
1.43 noro 2595: }
1.1 noro 2596: return dl;
2597: }
2598:
1.61 noro 2599: void ndl_print(UINT *dl)
1.1 noro 2600: {
2601: int n;
1.57 noro 2602: int i,j,l,ord_l,s,s0;
1.43 noro 2603: struct order_pair *op;
1.1 noro 2604:
2605: n = nd_nvar;
2606: printf("<<");
1.43 noro 2607: if ( nd_blockmask ) {
2608: l = nd_blockmask->n;
2609: op = nd_blockmask->order_pair;
2610: for ( j = 0, s = s0 = 0; j < l; j++ ) {
2611: ord_l = op[j].length;
1.57 noro 2612: for ( i = 0; i < ord_l; i++, s++ )
2613: printf(s==n-1?"%d":"%d,",GET_EXP(dl,s));
1.43 noro 2614: }
2615: } else {
1.56 noro 2616: for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,i));
1.43 noro 2617: }
1.1 noro 2618: printf(">>");
2619: }
2620:
2621: void nd_print(ND p)
2622: {
2623: NM m;
2624:
2625: if ( !p )
2626: printf("0\n");
2627: else {
2628: for ( m = BDY(p); m; m = NEXT(m) ) {
1.71 noro 2629: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
2630: else printf("+%d*",CM(m));
1.14 noro 2631: ndl_print(DL(m));
1.1 noro 2632: }
2633: printf("\n");
2634: }
2635: }
2636:
1.113 noro 2637: void nd_print_q(ND p)
1.16 noro 2638: {
2639: NM m;
2640:
2641: if ( !p )
2642: printf("0\n");
2643: else {
2644: for ( m = BDY(p); m; m = NEXT(m) ) {
2645: printf("+");
1.113 noro 2646: printexpr(CO,(Obj)CQ(m));
1.16 noro 2647: printf("*");
2648: ndl_print(DL(m));
2649: }
2650: printf("\n");
2651: }
2652: }
2653:
1.1 noro 2654: void ndp_print(ND_pairs d)
2655: {
2656: ND_pairs t;
2657:
1.34 noro 2658: for ( t = d; t; t = NEXT(t) ) printf("%d,%d ",t->i1,t->i2);
1.1 noro 2659: printf("\n");
2660: }
2661:
1.20 noro 2662: void nd_removecont(int mod,ND p)
1.16 noro 2663: {
2664: int i,n;
1.113 noro 2665: Q *w;
2666: Q dvr,t;
1.16 noro 2667: NM m;
1.21 noro 2668: struct oVECT v;
1.113 noro 2669: N q,r;
1.16 noro 2670:
1.71 noro 2671: if ( mod == -1 ) nd_mul_c(mod,p,_invsf(HCM(p)));
2672: else if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod));
1.20 noro 2673: else {
2674: for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ );
1.113 noro 2675: w = (Q *)ALLOCA(n*sizeof(Q));
1.21 noro 2676: v.len = n;
2677: v.body = (pointer *)w;
1.113 noro 2678: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
1.21 noro 2679: removecont_array(w,n);
1.113 noro 2680: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
1.16 noro 2681: }
2682: }
2683:
1.21 noro 2684: void nd_removecont2(ND p1,ND p2)
2685: {
2686: int i,n1,n2,n;
1.113 noro 2687: Q *w;
2688: Q dvr,t;
1.21 noro 2689: NM m;
2690: struct oVECT v;
1.113 noro 2691: N q,r;
1.21 noro 2692:
2693: if ( !p1 ) {
2694: nd_removecont(0,p2); return;
2695: } else if ( !p2 ) {
2696: nd_removecont(0,p1); return;
2697: }
2698: n1 = nd_length(p1);
2699: n2 = nd_length(p2);
2700: n = n1+n2;
1.113 noro 2701: w = (Q *)ALLOCA(n*sizeof(Q));
1.21 noro 2702: v.len = n;
2703: v.body = (pointer *)w;
1.113 noro 2704: for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) w[i] = CQ(m);
2705: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
1.21 noro 2706: removecont_array(w,n);
1.113 noro 2707: for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) CQ(m) = w[i];
2708: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
1.21 noro 2709: }
2710:
1.20 noro 2711: void ndv_removecont(int mod,NDV p)
1.16 noro 2712: {
2713: int i,len;
1.113 noro 2714: Q *w;
2715: Q dvr,t;
1.16 noro 2716: NMV m;
2717:
1.71 noro 2718: if ( mod == -1 )
2719: ndv_mul_c(mod,p,_invsf(HCM(p)));
2720: else if ( mod )
1.20 noro 2721: ndv_mul_c(mod,p,invm(HCM(p),mod));
2722: else {
2723: len = p->len;
1.113 noro 2724: w = (Q *)ALLOCA(len*sizeof(Q));
2725: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) w[i] = CQ(m);
2726: sortbynm(w,len);
2727: qltozl(w,len,&dvr);
2728: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) {
2729: divq(CQ(m),dvr,&t); CQ(m) = t;
2730: }
1.16 noro 2731: }
1.21 noro 2732: }
2733:
1.61 noro 2734: void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos)
2735: {
2736: int len,i,max;
2737: NMV m,mr0,mr,t;
2738:
2739: len = p->len;
2740: for ( m = BDY(p), i = 0, max = 0; i < len; NMV_OADV(m), i++ )
2741: max = MAX(max,TD(DL(m)));
2742: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
2743: m = (NMV)((char *)mr0+(len-1)*oadv);
2744: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
2745: t = (NMV)ALLOCA(nmv_adv);
2746: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
2747: ndl_homogenize(DL(m),DL(t),obpe,oepos,max);
1.113 noro 2748: CQ(mr) = CQ(m);
1.61 noro 2749: ndl_copy(DL(t),DL(mr));
2750: }
2751: NV(p)++;
2752: BDY(p) = mr0;
2753: }
2754:
1.45 noro 2755: void ndv_dehomogenize(NDV p,struct order_spec *ord)
1.23 noro 2756: {
1.45 noro 2757: int i,j,adj,len,newnvar,newwpd,newadv,newexporigin;
1.113 noro 2758: Q *w;
2759: Q dvr,t;
1.23 noro 2760: NMV m,r;
2761:
2762: len = p->len;
2763: newnvar = nd_nvar-1;
1.48 noro 2764: newexporigin = nd_get_exporigin(ord);
1.45 noro 2765: newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0)+newexporigin;
1.23 noro 2766: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ )
1.34 noro 2767: ndl_dehomogenize(DL(m));
1.23 noro 2768: if ( newwpd != nd_wpd ) {
1.90 noro 2769: newadv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(newwpd-1)*sizeof(UINT));
1.61 noro 2770: for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NDV_NADV(r), i++ ) {
1.113 noro 2771: CQ(r) = CQ(m);
1.45 noro 2772: for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j];
2773: adj = nd_exporigin-newexporigin;
2774: for ( ; j < newwpd; j++ ) DL(r)[j] = DL(m)[j+adj];
1.23 noro 2775: }
2776: }
2777: NV(p)--;
2778: }
2779:
1.113 noro 2780: void removecont_array(Q *c,int n)
1.21 noro 2781: {
2782: struct oVECT v;
1.113 noro 2783: Q d0,d1,a,u,u1,gcd;
1.110 noro 2784: int i,j;
1.113 noro 2785: N qn,rn,gn;
2786: Q *q,*r;
1.21 noro 2787:
1.113 noro 2788: q = (Q *)ALLOCA(n*sizeof(Q));
2789: r = (Q *)ALLOCA(n*sizeof(Q));
1.21 noro 2790: v.id = O_VECT; v.len = n; v.body = (pointer *)c;
1.113 noro 2791: igcdv_estimate(&v,&d0);
2792: for ( i = 0; i < n; i++ ) {
2793: divn(NM(c[i]),NM(d0),&qn,&rn);
2794: NTOQ(qn,SGN(c[i])*SGN(d0),q[i]);
2795: NTOQ(rn,SGN(c[i]),r[i]);
2796: }
1.34 noro 2797: for ( i = 0; i < n; i++ ) if ( r[i] ) break;
1.21 noro 2798: if ( i < n ) {
2799: v.id = O_VECT; v.len = n; v.body = (pointer *)r;
1.113 noro 2800: igcdv(&v,&d1);
2801: gcdn(NM(d0),NM(d1),&gn); NTOQ(gn,1,gcd);
2802: divsn(NM(d0),gn,&qn); NTOQ(qn,1,a);
1.21 noro 2803: for ( i = 0; i < n; i++ ) {
1.113 noro 2804: mulq(a,q[i],&u);
2805: if ( r[i] ) {
2806: divsn(NM(r[i]),gn,&qn); NTOQ(qn,SGN(r[i]),u1);
2807: addq(u,u1,&q[i]);
2808: } else
2809: q[i] = u;
1.21 noro 2810: }
2811: }
1.34 noro 2812: for ( i = 0; i < n; i++ ) c[i] = q[i];
1.16 noro 2813: }
2814:
1.19 noro 2815: void nd_mul_c(int mod,ND p,int mul)
1.1 noro 2816: {
2817: NM m;
2818: int c,c1;
2819:
1.34 noro 2820: if ( !p ) return;
1.115 noro 2821: if ( mul == 1 ) return;
1.71 noro 2822: if ( mod == -1 )
2823: for ( m = BDY(p); m; m = NEXT(m) )
2824: CM(m) = _mulsf(CM(m),mul);
2825: else
2826: for ( m = BDY(p); m; m = NEXT(m) ) {
2827: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
2828: }
1.1 noro 2829: }
2830:
1.113 noro 2831: void nd_mul_c_q(ND p,Q mul)
1.16 noro 2832: {
2833: NM m;
1.113 noro 2834: Q c;
1.16 noro 2835:
1.113 noro 2836: if ( !p ) return;
1.115 noro 2837: if ( UNIQ(mul) ) return;
1.16 noro 2838: for ( m = BDY(p); m; m = NEXT(m) ) {
1.113 noro 2839: mulq(CQ(m),mul,&c); CQ(m) = c;
1.16 noro 2840: }
2841: }
2842:
1.61 noro 2843: void nd_mul_c_p(VL vl,ND p,P mul)
2844: {
2845: NM m;
2846: P c;
2847:
2848: if ( !p ) return;
2849: for ( m = BDY(p); m; m = NEXT(m) ) {
2850: mulp(vl,CP(m),mul,&c); CP(m) = c;
2851: }
2852: }
2853:
1.1 noro 2854: void nd_free(ND p)
2855: {
2856: NM t,s;
2857:
1.34 noro 2858: if ( !p ) return;
1.1 noro 2859: t = BDY(p);
2860: while ( t ) {
2861: s = NEXT(t);
2862: FREENM(t);
2863: t = s;
2864: }
2865: FREEND(p);
2866: }
2867:
1.23 noro 2868: void ndv_free(NDV p)
2869: {
2870: GC_free(BDY(p));
2871: }
2872:
1.61 noro 2873: void nd_append_red(UINT *d,int i)
1.1 noro 2874: {
1.13 noro 2875: RHist m,m0;
1.1 noro 2876: int h;
2877:
1.13 noro 2878: NEWRHist(m);
1.34 noro 2879: h = ndl_hash_value(d);
1.13 noro 2880: m->index = i;
1.14 noro 2881: ndl_copy(d,DL(m));
1.1 noro 2882: NEXT(m) = nd_red[h];
2883: nd_red[h] = m;
2884: }
2885:
1.61 noro 2886: UINT *ndv_compute_bound(NDV p)
1.1 noro 2887: {
1.61 noro 2888: UINT *d1,*d2,*t;
2889: UINT u;
1.57 noro 2890: int i,j,k,l,len,ind;
1.45 noro 2891: NMV m;
1.1 noro 2892:
2893: if ( !p )
2894: return 0;
1.61 noro 2895: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
2896: d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
1.45 noro 2897: len = LEN(p);
2898: m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m);
2899: for ( i = 1; i < len; i++, NMV_ADV(m) ) {
1.14 noro 2900: ndl_lcm(DL(m),d1,d2);
1.1 noro 2901: t = d1; d1 = d2; d2 = t;
2902: }
1.12 noro 2903: l = nd_nvar+31;
1.61 noro 2904: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
1.57 noro 2905: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
2906: u = d1[i];
2907: k = (nd_epw-1)*nd_bpe;
2908: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
2909: t[ind] = (u>>k)&nd_mask0;
2910: }
2911: for ( ; ind < l; ind++ ) t[ind] = 0;
1.1 noro 2912: return t;
2913: }
2914:
1.99 noro 2915: UINT *nd_compute_bound(ND p)
2916: {
2917: UINT *d1,*d2,*t;
2918: UINT u;
2919: int i,j,k,l,len,ind;
2920: NM m;
2921:
2922: if ( !p )
2923: return 0;
2924: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
2925: d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
2926: len = LEN(p);
2927: m = BDY(p); ndl_copy(DL(m),d1); m = NEXT(m);
2928: for ( m = NEXT(m); m; m = NEXT(m) ) {
2929: ndl_lcm(DL(m),d1,d2);
2930: t = d1; d1 = d2; d2 = t;
2931: }
2932: l = nd_nvar+31;
2933: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
2934: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
2935: u = d1[i];
2936: k = (nd_epw-1)*nd_bpe;
2937: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
2938: t[ind] = (u>>k)&nd_mask0;
2939: }
2940: for ( ; ind < l; ind++ ) t[ind] = 0;
2941: return t;
2942: }
2943:
1.48 noro 2944: int nd_get_exporigin(struct order_spec *ord)
2945: {
1.51 noro 2946: switch ( ord->id ) {
1.96 noro 2947: case 0: case 2:
1.48 noro 2948: return 1;
1.41 noro 2949: case 1:
2950: /* block order */
1.43 noro 2951: /* d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */
1.48 noro 2952: return ord->ord.block.length+1;
1.96 noro 2953: case 3:
2954: error("nd_get_exporigin : composite order is not supported yet.");
1.41 noro 2955: }
1.48 noro 2956: }
2957:
1.61 noro 2958: void nd_setup_parameters(int nvar,int max) {
1.79 noro 2959: int i,j,n,elen,ord_o,ord_l,l,s,wpd;
1.57 noro 2960: struct order_pair *op;
1.48 noro 2961:
1.73 noro 2962: nd_nvar = nvar;
1.79 noro 2963: if ( max ) {
1.83 noro 2964: /* XXX */
2965: if ( do_weyl ) nd_bpe = 32;
2966: else if ( max < 2 ) nd_bpe = 1;
1.79 noro 2967: else if ( max < 4 ) nd_bpe = 2;
2968: else if ( max < 8 ) nd_bpe = 3;
2969: else if ( max < 16 ) nd_bpe = 4;
2970: else if ( max < 32 ) nd_bpe = 5;
2971: else if ( max < 64 ) nd_bpe = 6;
2972: else if ( max < 256 ) nd_bpe = 8;
2973: else if ( max < 1024 ) nd_bpe = 10;
2974: else if ( max < 65536 ) nd_bpe = 16;
2975: else nd_bpe = 32;
2976: }
1.61 noro 2977: nd_epw = (sizeof(UINT)*8)/nd_bpe;
1.48 noro 2978: elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);
2979: nd_exporigin = nd_get_exporigin(nd_ord);
1.79 noro 2980: wpd = nd_exporigin+elen;
2981: if ( wpd != nd_wpd ) {
2982: nd_free_private_storage();
2983: nd_wpd = wpd;
2984: }
1.1 noro 2985: if ( nd_bpe < 32 ) {
2986: nd_mask0 = (1<<nd_bpe)-1;
2987: } else {
2988: nd_mask0 = 0xffffffff;
2989: }
2990: bzero(nd_mask,sizeof(nd_mask));
2991: nd_mask1 = 0;
2992: for ( i = 0; i < nd_epw; i++ ) {
2993: nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe));
2994: nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe);
2995: }
1.90 noro 2996: nmv_adv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(nd_wpd-1)*sizeof(UINT));
1.57 noro 2997: nd_epos = nd_create_epos(nd_ord);
1.43 noro 2998: nd_blockmask = nd_create_blockmask(nd_ord);
1.96 noro 2999: nd_work_vector = (int *)REALLOC(nd_work_vector,nd_nvar*sizeof(int));
1.1 noro 3000: }
3001:
1.103 noro 3002: ND_pairs nd_reconstruct(int trace,ND_pairs d)
1.1 noro 3003: {
1.37 noro 3004: int i,obpe,oadv,h;
1.71 noro 3005: static NM prev_nm_free_list;
3006: static ND_pairs prev_ndp_free_list;
1.13 noro 3007: RHist mr0,mr;
3008: RHist r;
1.37 noro 3009: RHist *old_red;
1.71 noro 3010: ND_pairs s0,s,t;
1.43 noro 3011: EPOS oepos;
1.15 noro 3012:
1.1 noro 3013: obpe = nd_bpe;
1.11 noro 3014: oadv = nmv_adv;
1.43 noro 3015: oepos = nd_epos;
1.63 noro 3016: if ( obpe < 2 ) nd_bpe = 2;
3017: else if ( obpe < 3 ) nd_bpe = 3;
1.62 noro 3018: else if ( obpe < 4 ) nd_bpe = 4;
1.63 noro 3019: else if ( obpe < 5 ) nd_bpe = 5;
1.34 noro 3020: else if ( obpe < 6 ) nd_bpe = 6;
3021: else if ( obpe < 8 ) nd_bpe = 8;
1.63 noro 3022: else if ( obpe < 10 ) nd_bpe = 10;
1.34 noro 3023: else if ( obpe < 16 ) nd_bpe = 16;
3024: else if ( obpe < 32 ) nd_bpe = 32;
3025: else error("nd_reconstruct : exponent too large");
1.5 noro 3026:
1.73 noro 3027: nd_setup_parameters(nd_nvar,0);
1.1 noro 3028: prev_nm_free_list = _nm_free_list;
3029: prev_ndp_free_list = _ndp_free_list;
3030: _nm_free_list = 0;
3031: _ndp_free_list = 0;
1.53 noro 3032: for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos);
3033: if ( trace )
3034: for ( i = nd_psn-1; i >= 0; i-- )
3035: ndv_realloc(nd_ps_trace[i],obpe,oadv,oepos);
1.1 noro 3036: s0 = 0;
3037: for ( t = d; t; t = NEXT(t) ) {
3038: NEXTND_pairs(s0,s);
3039: s->i1 = t->i1;
3040: s->i2 = t->i2;
1.14 noro 3041: SG(s) = SG(t);
1.61 noro 3042: ndl_reconstruct(LCM(t),LCM(s),obpe,oepos);
1.1 noro 3043: }
1.37 noro 3044:
3045: old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist));
1.6 noro 3046: for ( i = 0; i < REDTAB_LEN; i++ ) {
1.37 noro 3047: old_red[i] = nd_red[i];
3048: nd_red[i] = 0;
3049: }
3050: for ( i = 0; i < REDTAB_LEN; i++ )
3051: for ( r = old_red[i]; r; r = NEXT(r) ) {
3052: NEWRHist(mr);
1.13 noro 3053: mr->index = r->index;
1.20 noro 3054: SG(mr) = SG(r);
1.61 noro 3055: ndl_reconstruct(DL(r),DL(mr),obpe,oepos);
1.37 noro 3056: h = ndl_hash_value(DL(mr));
3057: NEXT(mr) = nd_red[h];
3058: nd_red[h] = mr;
1.6 noro 3059: }
1.37 noro 3060: for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0;
3061: old_red = 0;
1.11 noro 3062: for ( i = 0; i < nd_psn; i++ ) {
1.20 noro 3063: NEWRHist(r); SG(r) = SG(nd_psh[i]);
1.61 noro 3064: ndl_reconstruct(DL(nd_psh[i]),DL(r),obpe,oepos);
1.13 noro 3065: nd_psh[i] = r;
1.11 noro 3066: }
1.1 noro 3067: if ( s0 ) NEXT(s) = 0;
3068: prev_nm_free_list = 0;
3069: prev_ndp_free_list = 0;
1.71 noro 3070: #if 0
1.1 noro 3071: GC_gcollect();
1.71 noro 3072: #endif
1.1 noro 3073: return s0;
3074: }
3075:
1.61 noro 3076: void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos)
1.1 noro 3077: {
1.57 noro 3078: int n,i,ei,oepw,omask0,j,s,ord_l,l;
1.43 noro 3079: struct order_pair *op;
1.1 noro 3080:
3081: n = nd_nvar;
1.61 noro 3082: oepw = (sizeof(UINT)*8)/obpe;
1.43 noro 3083: omask0 = (1<<obpe)-1;
1.34 noro 3084: TD(r) = TD(d);
1.41 noro 3085: for ( i = nd_exporigin; i < nd_wpd; i++ ) r[i] = 0;
1.43 noro 3086: if ( nd_blockmask ) {
3087: l = nd_blockmask->n;
3088: op = nd_blockmask->order_pair;
3089: for ( i = 1; i < nd_exporigin; i++ )
3090: r[i] = d[i];
3091: for ( j = 0, s = 0; j < l; j++ ) {
3092: ord_l = op[j].length;
1.57 noro 3093: for ( i = 0; i < ord_l; i++, s++ ) {
3094: ei = GET_EXP_OLD(d,s);
3095: PUT_EXP(r,s,ei);
3096: }
1.1 noro 3097: }
1.43 noro 3098: } else {
1.56 noro 3099: for ( i = 0; i < n; i++ ) {
3100: ei = GET_EXP_OLD(d,i);
3101: PUT_EXP(r,i,ei);
3102: }
1.1 noro 3103: }
3104: }
1.3 noro 3105:
1.6 noro 3106: ND nd_copy(ND p)
3107: {
3108: NM m,mr,mr0;
1.41 noro 3109: int c,n;
1.6 noro 3110: ND r;
3111:
3112: if ( !p )
3113: return 0;
3114: else {
3115: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
3116: NEXTNM(mr0,mr);
1.14 noro 3117: CM(mr) = CM(m);
3118: ndl_copy(DL(m),DL(mr));
1.6 noro 3119: }
3120: NEXT(mr) = 0;
1.31 noro 3121: MKND(NV(p),mr0,LEN(p),r);
1.14 noro 3122: SG(r) = SG(p);
1.6 noro 3123: return r;
3124: }
3125: }
3126:
1.53 noro 3127: int nd_sp(int mod,int trace,ND_pairs p,ND *rp)
1.11 noro 3128: {
3129: NM m;
3130: NDV p1,p2;
3131: ND t1,t2;
1.61 noro 3132: UINT *lcm;
1.31 noro 3133: int td;
1.11 noro 3134:
1.77 noro 3135: if ( !mod && nd_demand ) {
3136: p1 = ndv_load(p->i1); p2 = ndv_load(p->i2);
1.53 noro 3137: } else {
1.77 noro 3138: if ( trace ) {
3139: p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2];
3140: } else {
3141: p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2];
3142: }
1.20 noro 3143: }
1.34 noro 3144: lcm = LCM(p);
1.11 noro 3145: NEWNM(m);
1.113 noro 3146: CQ(m) = HCQ(p2);
1.34 noro 3147: ndl_sub(lcm,HDL(p1),DL(m));
1.56 noro 3148: if ( ndl_check_bound2(p->i1,DL(m)) )
3149: return 0;
1.55 noro 3150: t1 = ndv_mul_nm(mod,m,p1);
1.71 noro 3151: if ( mod == -1 ) CM(m) = _chsgnsf(HCM(p1));
3152: else if ( mod ) CM(m) = mod-HCM(p1);
1.113 noro 3153: else chsgnq(HCQ(p1),&CQ(m));
1.34 noro 3154: ndl_sub(lcm,HDL(p2),DL(m));
1.14 noro 3155: if ( ndl_check_bound2(p->i2,DL(m)) ) {
1.11 noro 3156: nd_free(t1);
3157: return 0;
3158: }
1.55 noro 3159: t2 = ndv_mul_nm(mod,m,p2);
1.31 noro 3160: *rp = nd_add(mod,t1,t2);
1.11 noro 3161: FREENM(m);
3162: return 1;
3163: }
3164:
1.19 noro 3165: void ndv_mul_c(int mod,NDV p,int mul)
1.11 noro 3166: {
3167: NMV m;
3168: int c,c1,len,i;
3169:
1.34 noro 3170: if ( !p ) return;
1.14 noro 3171: len = LEN(p);
1.71 noro 3172: if ( mod == -1 )
3173: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) )
3174: CM(m) = _mulsf(CM(m),mul);
3175: else
3176: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
3177: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
3178: }
1.11 noro 3179: }
3180:
1.113 noro 3181: void ndv_mul_c_q(NDV p,Q mul)
1.16 noro 3182: {
3183: NMV m;
1.113 noro 3184: Q c;
1.16 noro 3185: int len,i;
3186:
1.34 noro 3187: if ( !p ) return;
1.16 noro 3188: len = LEN(p);
3189: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
1.113 noro 3190: mulq(CQ(m),mul,&c); CQ(m) = c;
1.16 noro 3191: }
3192: }
3193:
1.55 noro 3194: ND weyl_ndv_mul_nm(int mod,NM m0,NDV p) {
3195: int n2,i,j,l,n,tlen;
1.61 noro 3196: UINT *d0;
1.55 noro 3197: NM *tab,*psum;
3198: ND s,r;
3199: NM t;
3200: NMV m1;
3201:
3202: if ( !p ) return 0;
3203: n = NV(p); n2 = n>>1;
3204: d0 = DL(m0);
3205: l = LEN(p);
3206: for ( i = 0, tlen = 1; i < n2; i++ ) tlen *= (GET_EXP(d0,n2+i)+1);
3207: tab = (NM *)ALLOCA(tlen*sizeof(NM));
3208: psum = (NM *)ALLOCA(tlen*sizeof(NM));
3209: for ( i = 0; i < tlen; i++ ) psum[i] = 0;
1.56 noro 3210: m1 = (NMV)(((char *)BDY(p))+nmv_adv*(l-1));
3211: for ( i = l-1; i >= 0; i--, NMV_PREV(m1) ) {
1.55 noro 3212: /* m0(NM) * m1(NMV) => tab(NM) */
1.56 noro 3213: weyl_mul_nm_nmv(n,mod,m0,m1,tab,tlen);
1.55 noro 3214: for ( j = 0; j < tlen; j++ ) {
3215: if ( tab[j] ) {
3216: NEXT(tab[j]) = psum[j]; psum[j] = tab[j];
3217: }
3218: }
3219: }
3220: for ( i = tlen-1, r = 0; i >= 0; i-- )
3221: if ( psum[i] ) {
3222: for ( j = 0, t = psum[i]; t; t = NEXT(t), j++ );
3223: MKND(n,psum[i],j,s);
3224: r = nd_add(mod,r,s);
3225: }
1.56 noro 3226: if ( r ) SG(r) = SG(p)+TD(d0);
3227: return r;
1.55 noro 3228: }
3229:
1.56 noro 3230: /* product of monomials */
3231: /* XXX block order is not handled correctly */
3232:
1.55 noro 3233: void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen)
3234: {
1.56 noro 3235: int i,n2,j,s,curlen,homo,h,a,b,k,l,u,min;
1.61 noro 3236: UINT *d0,*d1,*d,*dt,*ctab;
1.113 noro 3237: Q *ctab_q;
3238: Q q,q1;
1.61 noro 3239: UINT c0,c1,c;
1.55 noro 3240: NM *p;
3241: NM m,t;
3242:
3243: for ( i = 0; i < tlen; i++ ) tab[i] = 0;
3244: if ( !m0 || !m1 ) return;
3245: d0 = DL(m0); d1 = DL(m1); n2 = n>>1;
3246: NEWNM(m); d = DL(m);
1.56 noro 3247: if ( mod ) {
3248: c0 = CM(m0); c1 = CM(m1); DMAR(c0,c1,0,mod,c); CM(m) = c;
3249: } else
1.113 noro 3250: mulq(CQ(m0),CQ(m1),&CQ(m));
1.55 noro 3251: for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;
3252: homo = n&1 ? 1 : 0;
3253: if ( homo ) {
3254: /* offset of h-degree */
3255: h = GET_EXP(d0,n-1)+GET_EXP(d1,n-1);
3256: PUT_EXP(DL(m),n-1,h);
3257: TD(DL(m)) = h;
1.61 noro 3258: if ( nd_blockmask ) ndl_weight_mask(DL(m));
1.55 noro 3259: }
3260: tab[0] = m;
3261: NEWNM(m); d = DL(m);
1.57 noro 3262: for ( i = 0, curlen = 1; i < n2; i++ ) {
1.55 noro 3263: a = GET_EXP(d0,i); b = GET_EXP(d1,n2+i);
3264: k = GET_EXP(d0,n2+i); l = GET_EXP(d1,i);
3265: /* xi^a*(Di^k*xi^l)*Di^b */
3266: a += l; b += k;
1.56 noro 3267: s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);
1.55 noro 3268: if ( !k || !l ) {
3269: for ( j = 0; j < curlen; j++ )
1.56 noro 3270: if ( t = tab[j] ) {
3271: dt = DL(t);
3272: PUT_EXP(dt,i,a); PUT_EXP(dt,n2+i,b); TD(dt) += s;
1.61 noro 3273: if ( nd_blockmask ) ndl_weight_mask(dt);
1.55 noro 3274: }
3275: curlen *= k+1;
3276: continue;
3277: }
3278: min = MIN(k,l);
1.56 noro 3279: if ( mod ) {
1.61 noro 3280: ctab = (UINT *)ALLOCA((min+1)*sizeof(UINT));
1.56 noro 3281: mkwcm(k,l,mod,ctab);
3282: } else {
1.113 noro 3283: ctab_q = (Q *)ALLOCA((min+1)*sizeof(Q));
3284: mkwc(k,l,ctab_q);
1.56 noro 3285: }
1.57 noro 3286: for ( j = min; j >= 0; j-- ) {
1.56 noro 3287: for ( u = 0; u < nd_wpd; u++ ) d[u] = 0;
1.55 noro 3288: PUT_EXP(d,i,a-j); PUT_EXP(d,n2+i,b-j);
1.56 noro 3289: h = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i);
1.55 noro 3290: if ( homo ) {
3291: TD(d) = s;
1.56 noro 3292: PUT_EXP(d,n-1,s-h);
1.55 noro 3293: } else TD(d) = h;
1.61 noro 3294: if ( nd_blockmask ) ndl_weight_mask(d);
1.56 noro 3295: if ( mod ) c = ctab[j];
1.113 noro 3296: else q = ctab_q[j];
1.57 noro 3297: p = tab+curlen*j;
3298: if ( j == 0 ) {
3299: for ( u = 0; u < curlen; u++, p++ ) {
3300: if ( tab[u] ) {
3301: ndl_addto(DL(tab[u]),d);
3302: if ( mod ) {
3303: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(tab[u]) = c1;
3304: } else {
1.113 noro 3305: mulq(CQ(tab[u]),q,&q1); CQ(tab[u]) = q1;
1.57 noro 3306: }
3307: }
1.56 noro 3308: }
1.57 noro 3309: } else {
3310: for ( u = 0; u < curlen; u++, p++ ) {
3311: if ( tab[u] ) {
3312: NEWNM(t);
3313: ndl_add(DL(tab[u]),d,DL(t));
3314: if ( mod ) {
3315: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(t) = c1;
3316: } else
1.113 noro 3317: mulq(CQ(tab[u]),q,&CQ(t));
1.57 noro 3318: *p = t;
3319: }
1.55 noro 3320: }
3321: }
3322: }
3323: curlen *= k+1;
3324: }
3325: FREENM(m);
3326: }
3327:
1.63 noro 3328: ND ndv_mul_nm_symbolic(NM m0,NDV p)
3329: {
3330: NM mr,mr0;
3331: NMV m;
3332: UINT *d,*dt,*dm;
3333: int c,n,td,i,c1,c2,len;
1.113 noro 3334: Q q;
1.63 noro 3335: ND r;
3336:
3337: if ( !p ) return 0;
3338: else {
3339: n = NV(p); m = BDY(p);
3340: d = DL(m0);
3341: len = LEN(p);
3342: mr0 = 0;
3343: td = TD(d);
3344: c = CM(m0);
3345: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3346: NEXTNM(mr0,mr);
3347: CM(mr) = 1;
3348: ndl_add(DL(m),d,DL(mr));
3349: }
3350: NEXT(mr) = 0;
3351: MKND(NV(p),mr0,len,r);
3352: SG(r) = SG(p) + TD(d);
3353: return r;
3354: }
3355: }
3356:
1.55 noro 3357: ND ndv_mul_nm(int mod,NM m0,NDV p)
1.9 noro 3358: {
3359: NM mr,mr0;
3360: NMV m;
1.61 noro 3361: UINT *d,*dt,*dm;
1.9 noro 3362: int c,n,td,i,c1,c2,len;
1.113 noro 3363: Q q;
1.9 noro 3364: ND r;
3365:
1.34 noro 3366: if ( !p ) return 0;
1.55 noro 3367: else if ( do_weyl )
1.71 noro 3368: if ( mod == -1 )
3369: error("ndv_mul_nm : not implemented (weyl)");
3370: else
3371: return weyl_ndv_mul_nm(mod,m0,p);
1.9 noro 3372: else {
3373: n = NV(p); m = BDY(p);
1.34 noro 3374: d = DL(m0);
1.14 noro 3375: len = LEN(p);
1.9 noro 3376: mr0 = 0;
1.34 noro 3377: td = TD(d);
1.71 noro 3378: if ( mod == -1 ) {
3379: c = CM(m0);
3380: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3381: NEXTNM(mr0,mr);
3382: CM(mr) = _mulsf(CM(m),c);
3383: ndl_add(DL(m),d,DL(mr));
3384: }
3385: } else if ( mod ) {
1.16 noro 3386: c = CM(m0);
3387: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3388: NEXTNM(mr0,mr);
3389: c1 = CM(m);
1.19 noro 3390: DMAR(c1,c,0,mod,c2);
1.16 noro 3391: CM(mr) = c2;
3392: ndl_add(DL(m),d,DL(mr));
3393: }
3394: } else {
1.113 noro 3395: q = CQ(m0);
1.16 noro 3396: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3397: NEXTNM(mr0,mr);
1.113 noro 3398: mulq(CQ(m),q,&CQ(mr));
1.16 noro 3399: ndl_add(DL(m),d,DL(mr));
3400: }
1.4 noro 3401: }
1.9 noro 3402: NEXT(mr) = 0;
1.31 noro 3403: MKND(NV(p),mr0,len,r);
1.34 noro 3404: SG(r) = SG(p) + TD(d);
1.9 noro 3405: return r;
1.4 noro 3406: }
3407: }
3408:
1.104 noro 3409: ND nd_quo(int mod,PGeoBucket bucket,NDV d)
1.99 noro 3410: {
3411: NM mq0,mq;
1.102 noro 3412: NMV tm;
1.113 noro 3413: Q q;
1.104 noro 3414: int i,nv,sg,c,c1,c2,hindex;
3415: ND p,t,r;
3416: N tnm;
3417:
1.99 noro 3418: if ( !p ) return 0;
3419: else {
1.104 noro 3420: nv = NV(d);
1.99 noro 3421: mq0 = 0;
1.102 noro 3422: tm = (NMV)ALLOCA(nmv_adv);
1.104 noro 3423: while ( 1 ) {
1.113 noro 3424: hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket);
1.104 noro 3425: if ( hindex < 0 ) break;
3426: p = bucket->body[hindex];
1.99 noro 3427: NEXTNM(mq0,mq);
3428: ndl_sub(HDL(p),HDL(d),DL(mq));
1.102 noro 3429: ndl_copy(DL(mq),DL(tm));
3430: if ( mod ) {
3431: c1 = invm(HCM(d),mod); c2 = HCM(p);
3432: DMAR(c1,c2,0,mod,c); CM(mq) = c;
3433: CM(tm) = mod-c;
3434: } else {
1.113 noro 3435: divsn(NM(HCQ(p)),NM(HCQ(d)),&tnm);
3436: NTOQ(tnm,SGN(HCQ(p))*SGN(HCQ(d)),CQ(mq));
3437: chsgnq(CQ(mq),&CQ(tm));
1.102 noro 3438: }
3439: t = ndv_mul_nmv_trunc(mod,tm,d,HDL(d));
1.104 noro 3440: bucket->body[hindex] = nd_remove_head(p);
3441: t = nd_remove_head(t);
3442: add_pbucket(mod,bucket,t);
3443: }
3444: if ( !mq0 )
3445: r = 0;
3446: else {
3447: NEXT(mq) = 0;
3448: for ( i = 0, mq = mq0; mq; mq = NEXT(mq), i++ );
3449: MKND(nv,mq0,i,r);
3450: /* XXX */
3451: SG(r) = HTD(r);
1.99 noro 3452: }
3453: return r;
3454: }
3455: }
3456:
1.43 noro 3457: void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos)
1.11 noro 3458: {
1.13 noro 3459: NMV m,mr,mr0,t;
3460: int len,i,k;
1.11 noro 3461:
1.61 noro 3462: if ( !p ) return;
3463: m = BDY(p); len = LEN(p);
3464: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
3465: m = (NMV)((char *)mr0+(len-1)*oadv);
3466: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
3467: t = (NMV)ALLOCA(nmv_adv);
3468: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
1.113 noro 3469: CQ(t) = CQ(m);
1.61 noro 3470: for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0;
3471: ndl_reconstruct(DL(m),DL(t),obpe,oepos);
1.113 noro 3472: CQ(mr) = CQ(t);
1.61 noro 3473: ndl_copy(DL(t),DL(mr));
3474: }
3475: BDY(p) = mr0;
3476: }
3477:
3478: NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos)
3479: {
3480: NMV m,mr,mr0;
3481: int len,i;
3482: NDV r;
1.11 noro 3483:
1.61 noro 3484: if ( !p ) return 0;
3485: m = BDY(p); len = LEN(p);
3486: mr0 = mr = (NMV)MALLOC(len*nmv_adv);
3487: for ( i = 0; i < len; i++, NMV_OADV(m), NMV_ADV(mr) ) {
3488: ndl_zero(DL(mr));
3489: ndl_reconstruct(DL(m),DL(mr),obpe,oepos);
1.113 noro 3490: CQ(mr) = CQ(m);
1.11 noro 3491: }
1.61 noro 3492: MKNDV(NV(p),mr0,len,r);
3493: SG(r) = SG(p);
3494: return r;
1.11 noro 3495: }
3496:
1.61 noro 3497: /* duplicate p */
3498:
3499: NDV ndv_dup(int mod,NDV p)
1.3 noro 3500: {
3501: NDV d;
1.61 noro 3502: NMV t,m,m0;
1.3 noro 3503: int i,len;
3504:
1.34 noro 3505: if ( !p ) return 0;
1.31 noro 3506: len = LEN(p);
1.34 noro 3507: m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv));
1.61 noro 3508: for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) {
1.14 noro 3509: ndl_copy(DL(t),DL(m));
1.113 noro 3510: CQ(m) = CQ(t);
1.3 noro 3511: }
3512: MKNDV(NV(p),m0,len,d);
1.23 noro 3513: SG(d) = SG(p);
3514: return d;
3515: }
3516:
1.63 noro 3517: ND nd_dup(ND p)
3518: {
3519: ND d;
3520: NM t,m,m0;
3521:
3522: if ( !p ) return 0;
3523: for ( m0 = 0, t = BDY(p); t; t = NEXT(t) ) {
3524: NEXTNM(m0,m);
3525: ndl_copy(DL(t),DL(m));
1.113 noro 3526: CQ(m) = CQ(t);
1.63 noro 3527: }
3528: if ( m0 ) NEXT(m) = 0;
3529: MKND(NV(p),m0,LEN(p),d);
3530: SG(d) = SG(p);
3531: return d;
3532: }
3533:
1.61 noro 3534: /* XXX if p->len == 0 then it represents 0 */
3535:
3536: void ndv_mod(int mod,NDV p)
3537: {
3538: NMV t,d;
3539: int r;
3540: int i,len,dlen;
1.71 noro 3541: Obj gfs;
1.61 noro 3542:
3543: if ( !p ) return;
3544: len = LEN(p);
3545: dlen = 0;
1.71 noro 3546: if ( mod == -1 )
3547: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
3548: simp_ff((Obj)CP(t),&gfs);
3549: r = FTOIF(CONT((GFS)gfs));
1.61 noro 3550: CM(d) = r;
3551: ndl_copy(DL(t),DL(d));
3552: NMV_ADV(d);
3553: dlen++;
3554: }
1.71 noro 3555: else
3556: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
1.113 noro 3557: r = rem(NM(CQ(t)),mod);
1.71 noro 3558: if ( r ) {
1.113 noro 3559: if ( SGN(CQ(t)) < 0 )
3560: r = mod-r;
1.71 noro 3561: CM(d) = r;
3562: ndl_copy(DL(t),DL(d));
3563: NMV_ADV(d);
3564: dlen++;
3565: }
3566: }
1.61 noro 3567: LEN(p) = dlen;
3568: }
3569:
3570: NDV ptondv(VL vl,VL dvl,P p)
3571: {
3572: ND nd;
3573:
3574: nd = ptond(vl,dvl,p);
3575: return ndtondv(0,nd);
3576: }
3577:
3578: ND ptond(VL vl,VL dvl,P p)
1.23 noro 3579: {
1.61 noro 3580: int n,i,j,k,e;
3581: VL tvl;
3582: V v;
3583: DCP dc;
3584: DCP *w;
3585: ND r,s,t,u;
3586: P x;
3587: int c;
3588: UINT *d;
1.23 noro 3589: NM m,m0;
1.61 noro 3590:
3591: if ( !p )
3592: return 0;
3593: else if ( NUM(p) ) {
3594: NEWNM(m);
3595: ndl_zero(DL(m));
1.113 noro 3596: CQ(m) = (Q)p;
1.61 noro 3597: NEXT(m) = 0;
3598: MKND(nd_nvar,m,1,r);
3599: SG(r) = 0;
3600: return r;
3601: } else {
3602: for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ );
3603: w = (DCP *)ALLOCA(k*sizeof(DCP));
3604: for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ ) w[j] = dc;
3605: for ( i = 0, tvl = dvl, v = VR(p);
1.98 noro 3606: tvl && tvl->v != v; tvl = NEXT(tvl), i++ );
1.61 noro 3607: if ( !tvl ) {
3608: for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) {
3609: t = ptond(vl,dvl,COEF(w[j]));
3610: pwrp(vl,x,DEG(w[j]),&p);
3611: nd_mul_c_p(CO,t,p); s = nd_add(0,s,t);
3612: }
3613: return s;
3614: } else {
3615: NEWNM(m0); d = DL(m0);
3616: for ( j = k-1, s = 0; j >= 0; j-- ) {
3617: ndl_zero(d); e = QTOS(DEG(w[j])); PUT_EXP(d,i,e);
3618: TD(d) = MUL_WEIGHT(e,i);
3619: if ( nd_blockmask) ndl_weight_mask(d);
3620: t = ptond(vl,dvl,COEF(w[j]));
3621: for ( m = BDY(t); m; m = NEXT(m) )
3622: ndl_addto(DL(m),d);
3623: SG(t) += TD(d);
3624: s = nd_add(0,s,t);
3625: }
3626: FREENM(m0);
3627: return s;
3628: }
3629: }
3630: }
3631:
3632: P ndvtop(int mod,VL vl,VL dvl,NDV p)
3633: {
3634: VL tvl;
3635: int len,n,j,i,e;
3636: NMV m;
3637: Q q;
3638: P c;
3639: UINT *d;
3640: P s,r,u,t,w;
1.71 noro 3641: GFS gfs;
1.23 noro 3642:
1.34 noro 3643: if ( !p ) return 0;
1.61 noro 3644: else {
3645: len = LEN(p);
3646: n = NV(p);
3647: m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1));
3648: for ( j = len-1, s = 0; j >= 0; j--, NMV_PREV(m) ) {
1.71 noro 3649: if ( mod == -1 ) {
3650: e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs;
3651: } else if ( mod ) {
1.61 noro 3652: STOQ(CM(m),q); c = (P)q;
3653: } else
1.113 noro 3654: c = CP(m);
1.61 noro 3655: d = DL(m);
3656: for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) {
3657: MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q);
3658: pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w;
3659: }
3660: addp(vl,s,t,&u); s = u;
3661: }
3662: return s;
1.23 noro 3663: }
1.3 noro 3664: }
3665:
1.61 noro 3666: NDV ndtondv(int mod,ND p)
1.11 noro 3667: {
3668: NDV d;
1.61 noro 3669: NMV m,m0;
3670: NM t;
3671: int i,len;
1.11 noro 3672:
1.34 noro 3673: if ( !p ) return 0;
1.61 noro 3674: len = LEN(p);
1.74 noro 3675: if ( mod )
3676: m0 = m = (NMV)GC_malloc_atomic_ignore_off_page(len*nmv_adv);
3677: else
3678: m0 = m = MALLOC(len*nmv_adv);
1.103 noro 3679: #if 0
1.74 noro 3680: ndv_alloc += nmv_adv*len;
1.103 noro 3681: #endif
1.61 noro 3682: for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) {
3683: ndl_copy(DL(t),DL(m));
1.113 noro 3684: CQ(m) = CQ(t);
1.11 noro 3685: }
1.61 noro 3686: MKNDV(NV(p),m0,len,d);
1.14 noro 3687: SG(d) = SG(p);
1.11 noro 3688: return d;
3689: }
3690:
1.61 noro 3691: ND ndvtond(int mod,NDV p)
1.11 noro 3692: {
1.61 noro 3693: ND d;
3694: NM m,m0;
1.11 noro 3695: NMV t;
1.61 noro 3696: int i,len;
1.11 noro 3697:
1.34 noro 3698: if ( !p ) return 0;
1.11 noro 3699: m0 = 0;
1.61 noro 3700: len = p->len;
3701: for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) {
3702: NEXTNM(m0,m);
3703: ndl_copy(DL(t),DL(m));
1.113 noro 3704: CQ(m) = CQ(t);
1.11 noro 3705: }
3706: NEXT(m) = 0;
1.61 noro 3707: MKND(NV(p),m0,len,d);
1.14 noro 3708: SG(d) = SG(p);
1.11 noro 3709: return d;
3710: }
3711:
1.3 noro 3712: void ndv_print(NDV p)
3713: {
3714: NMV m;
3715: int i,len;
3716:
1.34 noro 3717: if ( !p ) printf("0\n");
1.3 noro 3718: else {
1.14 noro 3719: len = LEN(p);
1.3 noro 3720: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
1.71 noro 3721: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
3722: else printf("+%d*",CM(m));
1.16 noro 3723: ndl_print(DL(m));
3724: }
3725: printf("\n");
3726: }
3727: }
3728:
1.113 noro 3729: void ndv_print_q(NDV p)
1.16 noro 3730: {
3731: NMV m;
3732: int i,len;
3733:
1.34 noro 3734: if ( !p ) printf("0\n");
1.16 noro 3735: else {
3736: len = LEN(p);
3737: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
3738: printf("+");
1.113 noro 3739: printexpr(CO,(Obj)CQ(m));
1.16 noro 3740: printf("*");
1.14 noro 3741: ndl_print(DL(m));
1.3 noro 3742: }
3743: printf("\n");
3744: }
1.25 noro 3745: }
3746:
1.61 noro 3747: NODE ndv_reducebase(NODE x)
1.27 noro 3748: {
3749: int len,i,j;
3750: NDV *w;
3751: NODE t,t0;
3752:
3753: len = length(x);
3754: w = (NDV *)ALLOCA(len*sizeof(NDV));
3755: for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t);
3756: for ( i = 0; i < len; i++ ) {
3757: for ( j = 0; j < i; j++ ) {
3758: if ( w[i] && w[j] )
3759: if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0;
3760: else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0;
3761: }
3762: }
3763: for ( i = len-1, t0 = 0; i >= 0; i-- ) {
3764: if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; }
3765: }
3766: NEXT(t) = 0; x = t0;
3767: return x;
1.11 noro 3768: }
1.32 noro 3769:
1.43 noro 3770: /* XXX incomplete */
3771:
1.32 noro 3772: void nd_init_ord(struct order_spec *ord)
3773: {
1.43 noro 3774: switch ( ord->id ) {
1.32 noro 3775: case 0:
1.43 noro 3776: switch ( ord->ord.simple ) {
3777: case 0:
3778: nd_dcomp = 1;
3779: nd_isrlex = 1;
3780: break;
3781: case 1:
3782: nd_dcomp = 1;
3783: nd_isrlex = 0;
3784: break;
3785: case 2:
3786: nd_dcomp = 0;
3787: nd_isrlex = 0;
1.45 noro 3788: ndl_compare_function = ndl_lex_compare;
1.58 noro 3789: break;
3790: case 11:
3791: /* XXX */
3792: nd_dcomp = 0;
3793: nd_isrlex = 1;
3794: ndl_compare_function = ndl_ww_lex_compare;
1.43 noro 3795: break;
3796: default:
3797: error("nd_gr : unsupported order");
3798: }
1.32 noro 3799: break;
3800: case 1:
1.96 noro 3801: /* block order */
1.43 noro 3802: /* XXX */
3803: nd_dcomp = -1;
1.32 noro 3804: nd_isrlex = 0;
1.45 noro 3805: ndl_compare_function = ndl_block_compare;
1.34 noro 3806: break;
1.43 noro 3807: case 2:
1.96 noro 3808: /* matrix order */
3809: /* XXX */
3810: nd_dcomp = -1;
3811: nd_isrlex = 0;
3812: nd_matrix_len = ord->ord.matrix.row;
3813: nd_matrix = ord->ord.matrix.matrix;
3814: ndl_compare_function = ndl_matrix_compare;
3815: break;
3816: case 3:
1.97 noro 3817: /* composite order */
3818: nd_dcomp = -1;
3819: nd_isrlex = 0;
3820: nd_worb_len = ord->ord.composite.length;
3821: nd_worb = ord->ord.composite.w_or_b;
3822: ndl_compare_function = ndl_composite_compare;
1.32 noro 3823: break;
3824: }
1.41 noro 3825: nd_ord = ord;
1.32 noro 3826: }
3827:
1.43 noro 3828: BlockMask nd_create_blockmask(struct order_spec *ord)
3829: {
3830: int n,i,j,s,l;
1.61 noro 3831: UINT *t;
1.43 noro 3832: BlockMask bm;
3833:
1.96 noro 3834: /* we only create mask table for block order */
3835: if ( ord->id != 1 )
1.43 noro 3836: return 0;
3837: n = ord->ord.block.length;
3838: bm = (BlockMask)MALLOC(sizeof(struct oBlockMask));
3839: bm->n = n;
3840: bm->order_pair = ord->ord.block.order_pair;
1.61 noro 3841: bm->mask = (UINT **)MALLOC(n*sizeof(UINT *));
1.43 noro 3842: for ( i = 0, s = 0; i < n; i++ ) {
1.61 noro 3843: bm->mask[i] = t = (UINT *)MALLOC_ATOMIC(nd_wpd*sizeof(UINT));
1.43 noro 3844: for ( j = 0; j < nd_wpd; j++ ) t[j] = 0;
3845: l = bm->order_pair[i].length;
3846: for ( j = 0; j < l; j++, s++ ) PUT_EXP(t,s,nd_mask0);
3847: }
3848: return bm;
1.57 noro 3849: }
3850:
3851: EPOS nd_create_epos(struct order_spec *ord)
3852: {
3853: int i,j,l,s,ord_l,ord_o;
3854: EPOS epos;
3855: struct order_pair *op;
3856:
3857: epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS));
3858: switch ( ord->id ) {
3859: case 0:
3860: if ( nd_isrlex ) {
3861: for ( i = 0; i < nd_nvar; i++ ) {
3862: epos[i].i = nd_exporigin + (nd_nvar-1-i)/nd_epw;
3863: epos[i].s = (nd_epw-((nd_nvar-1-i)%nd_epw)-1)*nd_bpe;
3864: }
3865: } else {
3866: for ( i = 0; i < nd_nvar; i++ ) {
3867: epos[i].i = nd_exporigin + i/nd_epw;
3868: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
3869: }
3870: }
3871: break;
3872: case 1:
3873: /* block order */
3874: l = ord->ord.block.length;
3875: op = ord->ord.block.order_pair;
3876: for ( j = 0, s = 0; j < l; j++ ) {
3877: ord_o = op[j].order;
3878: ord_l = op[j].length;
3879: if ( !ord_o )
3880: for ( i = 0; i < ord_l; i++ ) {
3881: epos[s+i].i = nd_exporigin + (s+ord_l-i-1)/nd_epw;
3882: epos[s+i].s = (nd_epw-((s+ord_l-i-1)%nd_epw)-1)*nd_bpe;
3883: }
3884: else
3885: for ( i = 0; i < ord_l; i++ ) {
3886: epos[s+i].i = nd_exporigin + (s+i)/nd_epw;
3887: epos[s+i].s = (nd_epw-((s+i)%nd_epw)-1)*nd_bpe;
3888: }
3889: s += ord_l;
3890: }
3891: break;
3892: case 2:
1.96 noro 3893: /* matrix order */
3894: case 3:
3895: /* composite order */
3896: for ( i = 0; i < nd_nvar; i++ ) {
3897: epos[i].i = nd_exporigin + i/nd_epw;
3898: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
3899: }
3900: break;
1.57 noro 3901: }
3902: return epos;
1.43 noro 3903: }
1.59 noro 3904:
3905: /* external interface */
3906:
3907: void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec *ord,P *rp)
3908: {
1.61 noro 3909: NODE t,in0,in;
1.59 noro 3910: ND nd,nf;
1.61 noro 3911: NDV ndv;
3912: VL vv,tv;
3913: int stat,nvar,max,e;
1.113 noro 3914: union oNDC dn;
1.59 noro 3915:
1.116 noro 3916: if ( !f ) {
3917: *rp = 0;
3918: return;
3919: }
1.59 noro 3920: pltovl(v,&vv);
1.74 noro 3921: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
1.61 noro 3922:
3923: /* get the degree bound */
3924: for ( t = BDY(g), max = 0; t; t = NEXT(t) )
3925: for ( tv = vv; tv; tv = NEXT(tv) ) {
3926: e = getdeg(tv->v,(P)BDY(t));
3927: max = MAX(e,max);
3928: }
3929: for ( tv = vv; tv; tv = NEXT(tv) ) {
3930: e = getdeg(tv->v,f);
3931: max = MAX(e,max);
3932: }
3933:
1.59 noro 3934: nd_init_ord(ord);
1.61 noro 3935: nd_setup_parameters(nvar,max);
3936:
3937: /* conversion to ndv */
3938: for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) {
3939: NEXTNODE(in0,in);
3940: BDY(in) = (pointer)ptondv(CO,vv,(P)BDY(t));
1.69 noro 3941: if ( m ) ndv_mod(m,(NDV)BDY(in));
1.61 noro 3942: }
3943: NEXTNODE(in0,in);
3944: BDY(in) = (pointer)ptondv(CO,vv,f);
1.69 noro 3945: if ( m ) ndv_mod(m,(NDV)BDY(in));
1.61 noro 3946: NEXT(in) = 0;
3947:
3948: ndv_setup(m,0,in0);
1.59 noro 3949: nd_psn--;
3950: nd_scale=2;
3951: while ( 1 ) {
3952: nd = (pointer)ndvtond(m,nd_ps[nd_psn]);
1.69 noro 3953: stat = nd_nf(m,nd,nd_ps,1,0,&nf);
1.59 noro 3954: if ( !stat ) {
3955: nd_psn++;
1.103 noro 3956: nd_reconstruct(0,0);
1.59 noro 3957: nd_psn--;
3958: } else
3959: break;
3960: }
1.61 noro 3961: *rp = ndvtop(m,CO,vv,ndtondv(m,nf));
1.63 noro 3962: }
3963:
3964: int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r)
3965: {
3966: NM m;
3967: UINT *t,*s;
3968: int i;
3969:
3970: for ( i = 0; i < n; i++ ) r[i] = 0;
3971: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
3972: t = DL(m);
3973: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
3974: r[i] = CM(m);
3975: }
3976: for ( i = 0; !r[i]; i++ );
3977: return i;
3978: }
3979:
1.113 noro 3980: int nd_to_vect_q(UINT *s0,int n,ND d,Q *r)
1.74 noro 3981: {
1.107 noro 3982: NM m;
1.74 noro 3983: UINT *t,*s;
1.107 noro 3984: int i;
1.74 noro 3985:
3986: for ( i = 0; i < n; i++ ) r[i] = 0;
1.107 noro 3987: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
1.74 noro 3988: t = DL(m);
3989: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
1.113 noro 3990: r[i] = CQ(m);
1.74 noro 3991: }
3992: for ( i = 0; !r[i]; i++ );
3993: return i;
3994: }
3995:
1.67 noro 3996: IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0,int n,NM_ind_pair pair)
1.64 noro 3997: {
3998: NM m;
3999: NMV mr;
4000: UINT *d,*t,*s;
4001: NDV p;
1.67 noro 4002: unsigned char *ivc;
4003: unsigned short *ivs;
1.81 noro 4004: UINT *v,*ivi,*s0v;
1.67 noro 4005: int i,j,len,prev,diff,cdiff;
4006: IndArray r;
1.64 noro 4007:
4008: m = pair->mul;
4009: d = DL(m);
4010: p = nd_ps[pair->index];
4011: len = LEN(p);
4012: t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
1.67 noro 4013: v = (unsigned int *)ALLOCA(len*sizeof(unsigned int));
1.64 noro 4014: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
4015: ndl_add(d,DL(mr),t);
4016: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
1.67 noro 4017: v[j] = i;
4018: }
1.81 noro 4019: r = (IndArray)MALLOC(sizeof(struct oIndArray));
1.67 noro 4020: r->head = v[0];
4021: diff = 0;
4022: for ( i = 1; i < len; i++ ) {
4023: cdiff = v[i]-v[i-1]; diff = MAX(cdiff,diff);
4024: }
4025: if ( diff < 256 ) {
4026: r->width = 1;
4027: ivc = (unsigned char *)MALLOC_ATOMIC(len*sizeof(unsigned char));
4028: r->index.c = ivc;
4029: for ( i = 1, ivc[0] = 0; i < len; i++ ) ivc[i] = v[i]-v[i-1];
4030: } else if ( diff < 65536 ) {
4031: r->width = 2;
4032: ivs = (unsigned short *)MALLOC_ATOMIC(len*sizeof(unsigned short));
4033: r->index.s = ivs;
4034: for ( i = 1, ivs[0] = 0; i < len; i++ ) ivs[i] = v[i]-v[i-1];
4035: } else {
4036: r->width = 4;
4037: ivi = (unsigned int *)MALLOC_ATOMIC(len*sizeof(unsigned int));
4038: r->index.i = ivi;
4039: for ( i = 1, ivi[0] = 0; i < len; i++ ) ivi[i] = v[i]-v[i-1];
1.64 noro 4040: }
1.67 noro 4041: return r;
1.64 noro 4042: }
4043:
1.65 noro 4044:
1.113 noro 4045: int ndv_reduce_vect_q(Q *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.107 noro 4046: {
4047: int i,j,k,len,pos,prev;
1.113 noro 4048: Q cs,mcs,c1,c2,cr,gcd,t;
1.107 noro 4049: IndArray ivect;
4050: unsigned char *ivc;
4051: unsigned short *ivs;
4052: unsigned int *ivi;
4053: NDV redv;
4054: NMV mr;
4055: NODE rp;
4056: int maxrs;
4057:
4058: maxrs = 0;
4059: for ( i = 0; i < nred; i++ ) {
4060: ivect = imat[i];
4061: k = ivect->head;
4062: if ( svect[k] ) {
4063: maxrs = MAX(maxrs,rp0[i]->sugar);
4064: redv = nd_ps[rp0[i]->index];
4065: len = LEN(redv); mr = BDY(redv);
1.113 noro 4066: igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr);
4067: chsgnq(cs,&mcs);
4068: if ( !UNIQ(cr) ) {
4069: for ( j = 0; j < col; j++ ) {
4070: mulq(svect[j],cr,&c1); svect[j] = c1;
4071: }
4072: }
1.107 noro 4073: svect[k] = 0; prev = k;
4074: switch ( ivect->width ) {
4075: case 1:
4076: ivc = ivect->index.c;
4077: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4078: pos = prev+ivc[j]; prev = pos;
1.113 noro 4079: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
1.107 noro 4080: }
4081: break;
4082: case 2:
4083: ivs = ivect->index.s;
4084: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4085: pos = prev+ivs[j]; prev = pos;
1.113 noro 4086: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
1.107 noro 4087: }
4088: break;
4089: case 4:
4090: ivi = ivect->index.i;
4091: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4092: pos = prev+ivi[j]; prev = pos;
1.113 noro 4093: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
1.107 noro 4094: }
4095: break;
4096: }
4097: }
4098: }
4099: return maxrs;
4100: }
4101:
1.76 noro 4102: int ndv_reduce_vect(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.65 noro 4103: {
1.67 noro 4104: int i,j,k,len,pos,prev;
1.66 noro 4105: UINT c,c1,c2,c3,up,lo,dmy;
1.67 noro 4106: IndArray ivect;
4107: unsigned char *ivc;
4108: unsigned short *ivs;
4109: unsigned int *ivi;
1.65 noro 4110: NDV redv;
1.67 noro 4111: NMV mr;
1.65 noro 4112: NODE rp;
1.76 noro 4113: int maxrs;
1.65 noro 4114:
1.76 noro 4115: maxrs = 0;
1.74 noro 4116: for ( i = 0; i < nred; i++ ) {
1.65 noro 4117: ivect = imat[i];
1.67 noro 4118: k = ivect->head; svect[k] %= m;
1.65 noro 4119: if ( c = svect[k] ) {
1.76 noro 4120: maxrs = MAX(maxrs,rp0[i]->sugar);
1.74 noro 4121: c = m-c; redv = nd_ps[rp0[i]->index];
1.67 noro 4122: len = LEN(redv); mr = BDY(redv);
4123: svect[k] = 0; prev = k;
4124: switch ( ivect->width ) {
4125: case 1:
4126: ivc = ivect->index.c;
4127: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4128: pos = prev+ivc[j]; c1 = CM(mr); c2 = svect[pos];
4129: prev = pos;
4130: DMA(c1,c,c2,up,lo);
4131: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
4132: } else svect[pos] = lo;
4133: }
4134: break;
4135: case 2:
4136: ivs = ivect->index.s;
4137: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4138: pos = prev+ivs[j]; c1 = CM(mr); c2 = svect[pos];
4139: prev = pos;
4140: DMA(c1,c,c2,up,lo);
4141: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
4142: } else svect[pos] = lo;
4143: }
4144: break;
4145: case 4:
4146: ivi = ivect->index.i;
4147: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4148: pos = prev+ivi[j]; c1 = CM(mr); c2 = svect[pos];
4149: prev = pos;
4150: DMA(c1,c,c2,up,lo);
4151: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
4152: } else svect[pos] = lo;
4153: }
4154: break;
1.65 noro 4155: }
4156: }
4157: }
1.66 noro 4158: for ( i = 0; i < col; i++ )
4159: if ( svect[i] >= (UINT)m ) svect[i] %= m;
1.76 noro 4160: return maxrs;
1.65 noro 4161: }
4162:
1.76 noro 4163: int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.72 noro 4164: {
4165: int i,j,k,len,pos,prev;
4166: UINT c,c1,c2,c3,up,lo,dmy;
4167: IndArray ivect;
4168: unsigned char *ivc;
4169: unsigned short *ivs;
4170: unsigned int *ivi;
4171: NDV redv;
4172: NMV mr;
4173: NODE rp;
1.76 noro 4174: int maxrs;
1.72 noro 4175:
1.76 noro 4176: maxrs = 0;
1.74 noro 4177: for ( i = 0; i < nred; i++ ) {
1.72 noro 4178: ivect = imat[i];
4179: k = ivect->head; svect[k] %= m;
4180: if ( c = svect[k] ) {
1.76 noro 4181: maxrs = MAX(maxrs,rp0[i]->sugar);
1.74 noro 4182: c = _chsgnsf(c); redv = nd_ps[rp0[i]->index];
1.72 noro 4183: len = LEN(redv); mr = BDY(redv);
4184: svect[k] = 0; prev = k;
4185: switch ( ivect->width ) {
4186: case 1:
4187: ivc = ivect->index.c;
4188: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4189: pos = prev+ivc[j]; prev = pos;
4190: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
4191: }
4192: break;
4193: case 2:
4194: ivs = ivect->index.s;
4195: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4196: pos = prev+ivs[j]; prev = pos;
4197: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
4198: }
4199: break;
4200: case 4:
4201: ivi = ivect->index.i;
4202: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4203: pos = prev+ivi[j]; prev = pos;
4204: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
4205: }
4206: break;
4207: }
4208: }
4209: }
1.76 noro 4210: return maxrs;
1.72 noro 4211: }
4212:
1.65 noro 4213: NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhead,UINT *s0vect)
4214: {
4215: int j,k,len;
4216: UINT *p;
4217: UINT c;
4218: NDV r;
4219: NMV mr0,mr;
4220:
4221: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
4222: if ( !len ) return 0;
4223: else {
1.74 noro 4224: mr0 = (NMV)GC_malloc_atomic_ignore_off_page(nmv_adv*len);
1.103 noro 4225: #if 0
1.74 noro 4226: ndv_alloc += nmv_adv*len;
1.103 noro 4227: #endif
1.65 noro 4228: mr = mr0;
4229: p = s0vect;
4230: for ( j = k = 0; j < col; j++, p += nd_wpd )
4231: if ( !rhead[j] ) {
4232: if ( c = vect[k++] ) {
4233: ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr);
4234: }
4235: }
4236: MKNDV(nd_nvar,mr0,len,r);
4237: return r;
4238: }
4239: }
4240:
1.113 noro 4241: NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead,UINT *s0vect)
1.107 noro 4242: {
4243: int j,k,len;
4244: UINT *p;
1.113 noro 4245: Q c;
1.107 noro 4246: NDV r;
4247: NMV mr0,mr;
4248:
4249: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
4250: if ( !len ) return 0;
4251: else {
1.109 noro 4252: mr0 = (NMV)GC_malloc(nmv_adv*len);
1.107 noro 4253: #if 0
4254: ndv_alloc += nmv_adv*len;
4255: #endif
4256: mr = mr0;
4257: p = s0vect;
4258: for ( j = k = 0; j < col; j++, p += nd_wpd )
4259: if ( !rhead[j] ) {
4260: if ( c = vect[k++] ) {
1.113 noro 4261: if ( DN(c) )
4262: error("afo");
4263: ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr);
1.107 noro 4264: }
4265: }
4266: MKNDV(nd_nvar,mr0,len,r);
4267: return r;
4268: }
4269: }
4270:
1.74 noro 4271: int nd_sp_f4(int m,ND_pairs l,PGeoBucket bucket)
1.65 noro 4272: {
4273: ND_pairs t;
4274: NODE sp0,sp;
4275: int stat;
4276: ND spol;
4277:
4278: for ( t = l; t; t = NEXT(t) ) {
4279: stat = nd_sp(m,0,t,&spol);
4280: if ( !stat ) return 0;
4281: if ( spol ) {
4282: add_pbucket_symbolic(bucket,spol);
4283: }
4284: }
1.68 noro 4285: return 1;
1.65 noro 4286: }
4287:
4288: int nd_symbolic_preproc(PGeoBucket bucket,UINT **s0vect,NODE *r)
4289: {
4290: NODE rp0,rp;
4291: NM mul,head,s0,s;
1.76 noro 4292: int index,col,i,sugar;
1.65 noro 4293: RHist h;
4294: UINT *s0v,*p;
4295: NM_ind_pair pair;
4296: ND red;
4297:
4298: s0 = 0; rp0 = 0; col = 0;
4299: while ( 1 ) {
4300: head = remove_head_pbucket_symbolic(bucket);
4301: if ( !head ) break;
4302: if ( !s0 ) s0 = head;
4303: else NEXT(s) = head;
4304: s = head;
4305: index = ndl_find_reducer(DL(head));
4306: if ( index >= 0 ) {
4307: h = nd_psh[index];
4308: NEWNM(mul);
4309: ndl_sub(DL(head),DL(h),DL(mul));
4310: if ( ndl_check_bound2(index,DL(mul)) ) return 0;
1.76 noro 4311: sugar = TD(DL(mul))+SG(nd_ps[index]);
4312: MKNM_ind_pair(pair,mul,index,sugar);
1.65 noro 4313: red = ndv_mul_nm_symbolic(mul,nd_ps[index]);
4314: add_pbucket_symbolic(bucket,nd_remove_head(red));
4315: NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair;
4316: }
4317: col++;
4318: }
1.72 noro 4319: if ( rp0 ) NEXT(rp) = 0;
4320: NEXT(s) = 0;
1.65 noro 4321: s0v = (UINT *)MALLOC_ATOMIC(col*nd_wpd*sizeof(UINT));
4322: for ( i = 0, p = s0v, s = s0; i < col;
4323: i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p);
4324: *s0vect = s0v;
4325: *r = rp0;
4326: return col;
4327: }
4328:
1.69 noro 4329: NODE nd_f4(int m)
4330: {
4331: int i,nh,stat,index;
4332: NODE r,g;
4333: ND_pairs d,l,t;
4334: ND spol,red;
4335: NDV nf,redv;
4336: NM s0,s;
1.84 noro 4337: NODE rp0,srp0,nflist;
1.69 noro 4338: int nsp,nred,col,rank,len,k,j,a;
4339: UINT c;
1.74 noro 4340: UINT **spmat;
1.69 noro 4341: UINT *s0vect,*svect,*p,*v;
4342: int *colstat;
4343: IndArray *imat;
4344: int *rhead;
4345: int spcol,sprow;
4346: int sugar;
4347: PGeoBucket bucket;
4348: struct oEGT eg0,eg1,eg_f4;
4349:
1.103 noro 4350: #if 0
1.74 noro 4351: ndv_alloc = 0;
1.103 noro 4352: #endif
1.69 noro 4353: g = 0; d = 0;
4354: for ( i = 0; i < nd_psn; i++ ) {
4355: d = update_pairs(d,g,i);
4356: g = update_base(g,i);
4357: }
4358: while ( d ) {
4359: get_eg(&eg0);
4360: l = nd_minsugarp(d,&d);
4361: sugar = SG(l);
4362: bucket = create_pbucket();
1.74 noro 4363: stat = nd_sp_f4(m,l,bucket);
1.69 noro 4364: if ( !stat ) {
4365: for ( t = l; NEXT(t); t = NEXT(t) );
4366: NEXT(t) = d; d = l;
1.103 noro 4367: d = nd_reconstruct(0,d);
1.69 noro 4368: continue;
4369: }
1.86 noro 4370: if ( bucket->m < 0 ) continue;
1.69 noro 4371: col = nd_symbolic_preproc(bucket,&s0vect,&rp0);
4372: if ( !col ) {
4373: for ( t = l; NEXT(t); t = NEXT(t) );
4374: NEXT(t) = d; d = l;
1.103 noro 4375: d = nd_reconstruct(0,d);
1.69 noro 4376: continue;
4377: }
4378: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
1.74 noro 4379: if ( DP_Print )
4380: fprintf(asir_out,"sugar=%d,symb=%fsec,",
4381: sugar,eg_f4.exectime+eg_f4.gctime);
4382: if ( 1 )
4383: nflist = nd_f4_red(m,l,s0vect,col,rp0);
4384: else
4385: nflist = nd_f4_red_dist(m,l,s0vect,col,rp0);
1.69 noro 4386: /* adding new bases */
1.74 noro 4387: for ( r = nflist; r; r = NEXT(r) ) {
4388: nf = (NDV)BDY(r);
1.69 noro 4389: ndv_removecont(m,nf);
1.77 noro 4390: nh = ndv_newps(m,nf,0);
1.69 noro 4391: d = update_pairs(d,g,nh);
4392: g = update_base(g,nh);
4393: }
4394: }
4395: for ( r = g; r; r = NEXT(r) ) BDY(r) = (pointer)nd_ps[(int)BDY(r)];
1.103 noro 4396: #if 0
1.74 noro 4397: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.103 noro 4398: #endif
1.69 noro 4399: return g;
4400: }
1.74 noro 4401:
4402: NODE nd_f4_red(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0)
1.63 noro 4403: {
1.67 noro 4404: IndArray *imat;
1.106 noro 4405: int nsp,nred,i;
1.65 noro 4406: int *rhead;
1.106 noro 4407: NODE r0,rp;
1.74 noro 4408: ND_pairs sp;
4409: NM_ind_pair *rvect;
1.63 noro 4410:
1.74 noro 4411: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
1.106 noro 4412: nred = length(rp0);
1.74 noro 4413: imat = (IndArray *)ALLOCA(nred*sizeof(IndArray));
4414: rhead = (int *)ALLOCA(col*sizeof(int));
4415: for ( i = 0; i < col; i++ ) rhead[i] = 0;
1.63 noro 4416:
1.74 noro 4417: /* construction of index arrays */
4418: rvect = (NM_ind_pair *)ALLOCA(nred*sizeof(NM_ind_pair));
4419: for ( rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) {
4420: rvect[i] = (NM_ind_pair)BDY(rp);
4421: imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rvect[i]);
4422: rhead[imat[i]->head] = 1;
4423: }
1.107 noro 4424: if ( m )
4425: r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred);
4426: else
1.113 noro 4427: r0 = nd_f4_red_q_main(sp0,nsp,s0vect,col,rvect,rhead,imat,nred);
1.106 noro 4428: return r0;
4429: }
1.74 noro 4430:
1.106 noro 4431: NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
4432: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
4433: {
4434: int spcol,sprow,a;
4435: int i,j,k,l,rank;
4436: NODE r0,r;
4437: ND_pairs sp;
4438: ND spol;
4439: int **spmat;
4440: UINT *svect,*v;
4441: int *colstat;
4442: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
4443: int maxrs;
4444: int *spsugar;
4445:
4446: spcol = col-nred;
4447: get_eg(&eg0);
1.74 noro 4448: /* elimination (1st step) */
4449: spmat = (int **)ALLOCA(nsp*sizeof(UINT *));
4450: svect = (UINT *)ALLOCA(col*sizeof(UINT));
1.76 noro 4451: spsugar = (int *)ALLOCA(nsp*sizeof(UINT));
1.74 noro 4452: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
4453: nd_sp(m,0,sp,&spol);
1.75 noro 4454: if ( !spol ) continue;
1.74 noro 4455: nd_to_vect(m,s0vect,col,spol,svect);
1.76 noro 4456: if ( m == -1 )
4457: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred);
4458: else
4459: maxrs = ndv_reduce_vect(m,svect,col,imat,rvect,nred);
1.74 noro 4460: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
4461: if ( i < col ) {
4462: spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT));
4463: for ( j = k = 0; j < col; j++ )
4464: if ( !rhead[j] ) v[k++] = svect[j];
1.76 noro 4465: spsugar[sprow] = MAX(maxrs,SG(spol));
1.74 noro 4466: sprow++;
4467: }
1.76 noro 4468: nd_free(spol);
1.74 noro 4469: }
1.80 noro 4470: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
4471: if ( DP_Print ) {
4472: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
4473: fflush(asir_out);
4474: }
1.74 noro 4475: /* free index arrays */
4476: for ( i = 0; i < nred; i++ ) GC_free(imat[i]->index.c);
4477:
4478: /* elimination (2nd step) */
4479: colstat = (int *)ALLOCA(spcol*sizeof(int));
4480: if ( m == -1 )
1.76 noro 4481: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4482: else
1.76 noro 4483: rank = nd_gauss_elim_mod(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4484: r0 = 0;
4485: for ( i = 0; i < rank; i++ ) {
4486: NEXTNODE(r0,r); BDY(r) =
4487: (pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
1.76 noro 4488: SG((NDV)BDY(r)) = spsugar[i];
1.74 noro 4489: GC_free(spmat[i]);
4490: }
1.109 noro 4491: if ( r0 ) NEXT(r) = 0;
1.74 noro 4492: for ( ; i < sprow; i++ ) GC_free(spmat[i]);
1.80 noro 4493: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
4494: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
1.74 noro 4495: if ( DP_Print ) {
1.80 noro 4496: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
1.74 noro 4497: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
4498: nsp,nred,sprow,spcol,rank);
4499: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
1.63 noro 4500: }
1.74 noro 4501: return r0;
4502: }
4503:
1.113 noro 4504: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vect,int col,
1.107 noro 4505: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
4506: {
4507: int spcol,sprow,a;
4508: int i,j,k,l,rank;
4509: NODE r0,r;
4510: ND_pairs sp;
4511: ND spol;
1.113 noro 4512: Q **spmat;
4513: Q *svect,*v;
1.107 noro 4514: int *colstat;
4515: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
4516: int maxrs;
4517: int *spsugar;
4518:
4519: spcol = col-nred;
4520: get_eg(&eg0);
4521: /* elimination (1st step) */
1.113 noro 4522: spmat = (Q **)ALLOCA(nsp*sizeof(Q *));
4523: svect = (Q *)ALLOCA(col*sizeof(Q));
4524: spsugar = (int *)ALLOCA(nsp*sizeof(Q));
1.107 noro 4525: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
4526: nd_sp(0,0,sp,&spol);
4527: if ( !spol ) continue;
1.113 noro 4528: nd_to_vect_q(s0vect,col,spol,svect);
4529: maxrs = ndv_reduce_vect_q(svect,col,imat,rvect,nred);
1.107 noro 4530: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
4531: if ( i < col ) {
1.113 noro 4532: spmat[sprow] = v = (Q *)MALLOC(spcol*sizeof(Q));
1.107 noro 4533: for ( j = k = 0; j < col; j++ )
4534: if ( !rhead[j] ) v[k++] = svect[j];
4535: spsugar[sprow] = MAX(maxrs,SG(spol));
4536: sprow++;
4537: }
1.109 noro 4538: /* nd_free(spol); */
1.107 noro 4539: }
4540: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
4541: if ( DP_Print ) {
4542: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
4543: fflush(asir_out);
4544: }
4545: /* free index arrays */
1.109 noro 4546: /* for ( i = 0; i < nred; i++ ) GC_free(imat[i]->index.c); */
1.107 noro 4547:
4548: /* elimination (2nd step) */
4549: colstat = (int *)ALLOCA(spcol*sizeof(int));
1.113 noro 4550: rank = nd_gauss_elim_q(spmat,spsugar,sprow,spcol,colstat);
1.107 noro 4551: r0 = 0;
4552: for ( i = 0; i < rank; i++ ) {
4553: NEXTNODE(r0,r); BDY(r) =
1.113 noro 4554: (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect);
1.107 noro 4555: SG((NDV)BDY(r)) = spsugar[i];
1.109 noro 4556: /* GC_free(spmat[i]); */
1.107 noro 4557: }
1.109 noro 4558: if ( r0 ) NEXT(r) = 0;
4559:
4560: /* for ( ; i < sprow; i++ ) GC_free(spmat[i]); */
1.107 noro 4561: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
4562: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
4563: if ( DP_Print ) {
4564: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
4565: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
4566: nsp,nred,sprow,spcol,rank);
4567: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
4568: }
4569: return r0;
4570: }
4571:
1.74 noro 4572: FILE *nd_write,*nd_read;
4573:
4574: void nd_send_int(int a) {
4575: write_int(nd_write,&a);
4576: }
4577:
4578: void nd_send_intarray(int *p,int len) {
4579: write_intarray(nd_write,p,len);
4580: }
4581:
4582: int nd_recv_int() {
4583: int a;
4584:
4585: read_int(nd_read,&a);
4586: return a;
4587: }
4588:
4589: void nd_recv_intarray(int *p,int len) {
4590: read_intarray(nd_read,p,len);
4591: }
4592:
4593: void nd_send_ndv(NDV p) {
4594: int len,i;
4595: NMV m;
4596:
4597: if ( !p ) nd_send_int(0);
4598: else {
4599: len = LEN(p);
4600: nd_send_int(len);
4601: m = BDY(p);
4602: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4603: nd_send_int(CM(m));
4604: nd_send_intarray(DL(m),nd_wpd);
1.68 noro 4605: }
1.74 noro 4606: }
4607: }
4608:
4609: void nd_send_nd(ND p) {
4610: int len,i;
4611: NM m;
4612:
4613: if ( !p ) nd_send_int(0);
4614: else {
4615: len = LEN(p);
4616: nd_send_int(len);
4617: m = BDY(p);
4618: for ( i = 0; i < len; i++, m = NEXT(m) ) {
4619: nd_send_int(CM(m));
4620: nd_send_intarray(DL(m),nd_wpd);
1.65 noro 4621: }
1.74 noro 4622: }
4623: }
1.65 noro 4624:
1.74 noro 4625: NDV nd_recv_ndv()
4626: {
4627: int len,i;
4628: NMV m,m0;
4629: NDV r;
1.65 noro 4630:
1.74 noro 4631: len = nd_recv_int();
4632: if ( !len ) return 0;
4633: else {
4634: m0 = m = (NMV)GC_malloc_atomic_ignore_off_page(nmv_adv*len);
1.103 noro 4635: #if 0
1.74 noro 4636: ndv_alloc += len*nmv_adv;
1.103 noro 4637: #endif
1.74 noro 4638: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4639: CM(m) = nd_recv_int();
4640: nd_recv_intarray(DL(m),nd_wpd);
1.71 noro 4641: }
1.74 noro 4642: MKNDV(nd_nvar,m0,len,r);
4643: return r;
4644: }
4645: }
1.65 noro 4646:
1.74 noro 4647: int ox_exec_f4_red(Q proc)
4648: {
4649: Obj obj;
4650: STRING fname;
4651: NODE arg;
4652: int s;
4653: extern int ox_need_conv,ox_file_io;
4654:
4655: MKSTR(fname,"nd_exec_f4_red");
4656: arg = mknode(2,proc,fname);
4657: Pox_cmo_rpc(arg,&obj);
4658: s = get_ox_server_id(QTOS(proc));
4659: nd_write = iofp[s].out;
4660: nd_read = iofp[s].in;
4661: ox_need_conv = ox_file_io = 0;
4662: return s;
4663: }
4664:
4665: NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0)
4666: {
4667: int nsp,nred;
4668: int i,rank,s;
4669: NODE rp,r0,r;
4670: ND_pairs sp;
4671: NM_ind_pair pair;
4672: NMV nmv;
4673: NM nm;
4674: NDV nf;
4675: Obj proc,dmy;
4676:
4677: ox_launch_main(0,0,&proc);
4678: s = ox_exec_f4_red((Q)proc);
4679:
4680: nd_send_int(m);
4681: nd_send_int(nd_nvar);
4682: nd_send_int(nd_bpe);
4683: nd_send_int(nd_wpd);
4684: nd_send_int(nmv_adv);
4685:
1.89 noro 4686: saveobj(nd_write,dp_current_spec->obj); fflush(nd_write);
1.74 noro 4687:
4688: nd_send_int(nd_psn);
4689: for ( i = 0; i < nd_psn; i++ ) nd_send_ndv(nd_ps[i]);
4690:
4691: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
4692: nd_send_int(nsp);
4693: for ( i = 0, sp = sp0; i < nsp; i++, sp = NEXT(sp) ) {
4694: nd_send_int(sp->i1); nd_send_int(sp->i2);
4695: }
4696:
4697: nd_send_int(col); nd_send_intarray(s0vect,col*nd_wpd);
4698:
4699: nred = length(rp0); nd_send_int(nred);
4700: for ( i = 0, rp = rp0; i < nred; i++, rp = NEXT(rp) ) {
4701: pair = (NM_ind_pair)BDY(rp);
4702: nd_send_int(pair->index);
4703: nd_send_intarray(pair->mul->dl,nd_wpd);
4704: }
4705: fflush(nd_write);
4706: rank = nd_recv_int();
4707: fprintf(asir_out,"rank=%d\n",rank);
4708: r0 = 0;
4709: for ( i = 0; i < rank; i++ ) {
4710: nf = nd_recv_ndv();
4711: NEXTNODE(r0,r); BDY(r) = (pointer)nf;
4712: }
4713: Pox_shutdown(mknode(1,proc),&dmy);
4714: return r0;
4715: }
4716:
4717: /* server side */
4718:
4719: void nd_exec_f4_red_dist()
4720: {
4721: int m,i,nsp,col,s0size,nred,spcol,j,k;
4722: NM_ind_pair *rp0;
4723: NDV nf;
4724: UINT *s0vect;
4725: IndArray *imat;
4726: int *rhead;
4727: int **spmat;
4728: UINT *svect,*v;
4729: ND_pairs *sp0;
4730: int *colstat;
4731: int a,sprow,rank;
1.89 noro 4732: struct order_spec *ord;
1.74 noro 4733: Obj ordspec;
4734: ND spol;
1.76 noro 4735: int maxrs;
4736: int *spsugar;
1.74 noro 4737:
4738: nd_read = iofp[0].in;
4739: nd_write = iofp[0].out;
4740: m = nd_recv_int();
4741: nd_nvar = nd_recv_int();
4742: nd_bpe = nd_recv_int();
4743: nd_wpd = nd_recv_int();
4744: nmv_adv = nd_recv_int();
4745:
4746: loadobj(nd_read,&ordspec);
1.89 noro 4747: create_order_spec(0,ordspec,&ord);
4748: nd_init_ord(ord);
1.74 noro 4749: nd_setup_parameters(nd_nvar,0);
4750:
4751: nd_psn = nd_recv_int();
4752: nd_ps = (NDV *)MALLOC(nd_psn*sizeof(NDV));
4753: nd_bound = (UINT **)MALLOC(nd_psn*sizeof(UINT *));
4754: for ( i = 0; i < nd_psn; i++ ) {
4755: nd_ps[i] = nd_recv_ndv();
4756: nd_bound[i] = ndv_compute_bound(nd_ps[i]);
4757: }
4758:
4759: nsp = nd_recv_int();
4760: sp0 = (ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
4761: for ( i = 0; i < nsp; i++ ) {
4762: NEWND_pairs(sp0[i]);
4763: sp0[i]->i1 = nd_recv_int(); sp0[i]->i2 = nd_recv_int();
4764: ndl_lcm(HDL(nd_ps[sp0[i]->i1]),HDL(nd_ps[sp0[i]->i2]),LCM(sp0[i]));
4765: }
4766:
4767: col = nd_recv_int();
4768: s0size = col*nd_wpd;
4769: s0vect = (UINT *)MALLOC(s0size*sizeof(UINT));
4770: nd_recv_intarray(s0vect,s0size);
4771:
4772: nred = nd_recv_int();
4773: rp0 = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair));
4774: for ( i = 0; i < nred; i++ ) {
4775: rp0[i] = (NM_ind_pair)MALLOC(sizeof(struct oNM_ind_pair));
4776: rp0[i]->index = nd_recv_int();
4777: rp0[i]->mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
4778: nd_recv_intarray(rp0[i]->mul->dl,nd_wpd);
4779: }
4780:
4781: spcol = col-nred;
4782: imat = (IndArray *)MALLOC(nred*sizeof(IndArray));
4783: rhead = (int *)MALLOC(col*sizeof(int));
4784: for ( i = 0; i < col; i++ ) rhead[i] = 0;
4785:
4786: /* construction of index arrays */
4787: for ( i = 0; i < nred; i++ ) {
4788: imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rp0[i]);
4789: rhead[imat[i]->head] = 1;
4790: }
4791:
4792: /* elimination (1st step) */
4793: spmat = (int **)MALLOC(nsp*sizeof(UINT *));
4794: svect = (UINT *)MALLOC(col*sizeof(UINT));
1.76 noro 4795: spsugar = (int *)ALLOCA(nsp*sizeof(UINT));
1.74 noro 4796: for ( a = sprow = 0; a < nsp; a++ ) {
4797: nd_sp(m,0,sp0[a],&spol);
1.75 noro 4798: if ( !spol ) continue;
1.74 noro 4799: nd_to_vect(m,s0vect,col,spol,svect);
1.76 noro 4800: if ( m == -1 )
4801: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rp0,nred);
4802: else
4803: maxrs = ndv_reduce_vect(m,svect,col,imat,rp0,nred);
1.74 noro 4804: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
4805: if ( i < col ) {
4806: spmat[sprow] = v = (UINT *)MALLOC(spcol*sizeof(UINT));
4807: for ( j = k = 0; j < col; j++ )
4808: if ( !rhead[j] ) v[k++] = svect[j];
1.76 noro 4809: spsugar[sprow] = MAX(maxrs,SG(spol));
1.74 noro 4810: sprow++;
4811: }
1.76 noro 4812: nd_free(spol);
1.74 noro 4813: }
4814: /* elimination (2nd step) */
4815: colstat = (int *)ALLOCA(spcol*sizeof(int));
4816: if ( m == -1 )
1.76 noro 4817: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4818: else
1.76 noro 4819: rank = nd_gauss_elim_mod(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4820: nd_send_int(rank);
4821: for ( i = 0; i < rank; i++ ) {
4822: nf = vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
4823: nd_send_ndv(nf);
1.63 noro 4824: }
1.74 noro 4825: fflush(nd_write);
1.107 noro 4826: }
4827:
1.113 noro 4828: int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int col,int *colstat)
1.107 noro 4829: {
1.109 noro 4830: int mod,i,j,t,c,rank,rank0,inv;
4831: int *ci,*ri;
1.113 noro 4832: Q dn;
1.109 noro 4833: MAT m,nm;
1.108 noro 4834: int **wmat;
4835:
4836: /* XXX */
4837: mod = 99999989;
4838: wmat = (int **)ALLOCA(row*sizeof(int *));
4839: for ( i = 0; i < row; i++ ) {
4840: wmat[i] = (int *)ALLOCA(col*sizeof(int));
4841: for ( j = 0; j < col; j++ ) {
1.113 noro 4842: if ( mat0[i][j] ) {
4843: t = rem(NM(mat0[i][j]),mod);
4844: if ( SGN(mat0[i][j]) < 0 ) t = mod-t;
4845: wmat[i][j] = t;
4846: } else
1.108 noro 4847: wmat[i][j] = 0;
4848: }
4849: }
1.109 noro 4850: rank0 = nd_gauss_elim_mod(wmat,sugar,row,col,mod,colstat);
4851: NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0;
1.113 noro 4852: rank = generic_gauss_elim(m,&nm,&dn,&ri,&ci);
1.109 noro 4853: if ( rank != rank0 )
4854: error("afo");
4855: for ( i = 0; i < row; i++ )
4856: for ( j = 0; j < col; j++ )
4857: mat0[i][j] = 0;
4858: c = col-rank;
4859: for ( i = 0; i < rank; i++ ) {
1.113 noro 4860: mat0[i][ri[i]] = dn;
1.109 noro 4861: for ( j = 0; j < c; j++ )
1.113 noro 4862: mat0[i][ci[j]] = (Q)BDY(nm)[i][j];
1.109 noro 4863: }
1.113 noro 4864: inv = invm(rem(NM(dn),mod),mod);
4865: if ( SGN(dn) < 0 ) inv = mod-inv;
1.109 noro 4866: for ( i = 0; i < row; i++ )
4867: for ( j = 0; j < col; j++ ) {
1.113 noro 4868: if ( mat0[i][j] ) {
4869: t = rem(NM(mat0[i][j]),mod);
4870: if ( SGN(mat0[i][j]) < 0 ) t = mod-t;
4871: } else
1.109 noro 4872: t = 0;
4873: c = dmar(t,inv,0,mod);
4874: if ( wmat[i][j] != c )
4875: error("afo");
4876: }
4877: return rank;
1.76 noro 4878: }
4879:
4880: int nd_gauss_elim_mod(int **mat0,int *sugar,int row,int col,int md,int *colstat)
4881: {
4882: int i,j,k,l,inv,a,rank,s;
4883: unsigned int *t,*pivot,*pk;
4884: unsigned int **mat;
4885:
4886: mat = (unsigned int **)mat0;
4887: for ( rank = 0, j = 0; j < col; j++ ) {
4888: for ( i = rank; i < row; i++ )
4889: mat[i][j] %= md;
4890: for ( i = rank; i < row; i++ )
4891: if ( mat[i][j] )
4892: break;
4893: if ( i == row ) {
4894: colstat[j] = 0;
4895: continue;
4896: } else
4897: colstat[j] = 1;
4898: if ( i != rank ) {
4899: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
4900: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
4901: }
4902: pivot = mat[rank];
4903: s = sugar[rank];
4904: inv = invm(pivot[j],md);
4905: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
4906: if ( *pk ) {
4907: if ( *pk >= (unsigned int)md )
4908: *pk %= md;
4909: DMAR(*pk,inv,0,md,*pk)
4910: }
4911: for ( i = rank+1; i < row; i++ ) {
4912: t = mat[i];
4913: if ( a = t[j] ) {
4914: sugar[i] = MAX(sugar[i],s);
4915: red_by_vect(md,t+j,pivot+j,md-a,col-j);
4916: }
4917: }
4918: rank++;
4919: }
4920: for ( j = col-1, l = rank-1; j >= 0; j-- )
4921: if ( colstat[j] ) {
4922: pivot = mat[l];
4923: s = sugar[l];
4924: for ( i = 0; i < l; i++ ) {
4925: t = mat[i];
4926: t[j] %= md;
4927: if ( a = t[j] ) {
4928: sugar[i] = MAX(sugar[i],s);
4929: red_by_vect(md,t+j,pivot+j,md-a,col-j);
4930: }
4931: }
4932: l--;
4933: }
4934: for ( j = 0, l = 0; l < rank; j++ )
4935: if ( colstat[j] ) {
4936: t = mat[l];
4937: for ( k = j; k < col; k++ )
4938: if ( t[k] >= (unsigned int)md )
4939: t[k] %= md;
4940: l++;
4941: }
4942: return rank;
4943: }
4944:
4945: int nd_gauss_elim_sf(int **mat0,int *sugar,int row,int col,int md,int *colstat)
4946: {
4947: int i,j,k,l,inv,a,rank,s;
4948: unsigned int *t,*pivot,*pk;
4949: unsigned int **mat;
4950:
4951: mat = (unsigned int **)mat0;
4952: for ( rank = 0, j = 0; j < col; j++ ) {
4953: for ( i = rank; i < row; i++ )
4954: if ( mat[i][j] )
4955: break;
4956: if ( i == row ) {
4957: colstat[j] = 0;
4958: continue;
4959: } else
4960: colstat[j] = 1;
4961: if ( i != rank ) {
4962: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
4963: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
4964: }
4965: pivot = mat[rank];
4966: s = sugar[rank];
4967: inv = _invsf(pivot[j]);
4968: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
4969: if ( *pk )
4970: *pk = _mulsf(*pk,inv);
4971: for ( i = rank+1; i < row; i++ ) {
4972: t = mat[i];
4973: if ( a = t[j] ) {
4974: sugar[i] = MAX(sugar[i],s);
4975: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
4976: }
4977: }
4978: rank++;
4979: }
4980: for ( j = col-1, l = rank-1; j >= 0; j-- )
4981: if ( colstat[j] ) {
4982: pivot = mat[l];
4983: s = sugar[l];
4984: for ( i = 0; i < l; i++ ) {
4985: t = mat[i];
4986: if ( a = t[j] ) {
4987: sugar[i] = MAX(sugar[i],s);
4988: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
4989: }
4990: }
4991: l--;
4992: }
4993: return rank;
1.77 noro 4994: }
4995:
4996: int ndv_ishomo(NDV p)
4997: {
4998: NMV m;
4999: int len,h;
5000:
5001: if ( !p ) return 1;
5002: len = LEN(p);
5003: m = BDY(p);
5004: h = TD(DL(m));
5005: NMV_ADV(m);
5006: for ( len--; len; len--, NMV_ADV(m) )
5007: if ( TD(DL(m)) != h ) return 0;
5008: return 1;
5009: }
5010:
5011: void ndv_save(NDV p,int index)
5012: {
5013: FILE *s;
5014: char name[BUFSIZ];
5015: short id;
5016: int nv,sugar,len,n,i,td,e,j;
5017: NMV m;
5018: unsigned int *dl;
5019:
5020: sprintf(name,"%s/%d",Demand,index);
5021: s = fopen(name,"w");
5022: savevl(s,0);
5023: if ( !p ) {
5024: saveobj(s,0);
5025: return;
5026: }
5027: id = O_DP;
5028: nv = NV(p);
5029: sugar = SG(p);
5030: len = LEN(p);
5031: write_short(s,&id); write_int(s,&nv); write_int(s,&sugar);
5032: write_int(s,&len);
5033:
5034: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
1.113 noro 5035: saveobj(s,(Obj)CQ(m));
1.77 noro 5036: dl = DL(m);
5037: td = TD(dl);
5038: write_int(s,&td);
5039: for ( j = 0; j < nv; j++ ) {
5040: e = GET_EXP(dl,j);
5041: write_int(s,&e);
5042: }
5043: }
5044: fclose(s);
5045: }
5046:
5047: NDV ndv_load(int index)
5048: {
5049: FILE *s;
5050: char name[BUFSIZ];
5051: short id;
5052: int nv,sugar,len,n,i,td,e,j;
5053: NDV d;
5054: NMV m0,m;
5055: unsigned int *dl;
5056: Obj obj;
5057:
5058: sprintf(name,"%s/%d",Demand,index);
5059: s = fopen(name,"r");
5060: if ( !s ) return 0;
5061:
5062: skipvl(s);
5063: read_short(s,&id);
5064: if ( !id ) return 0;
5065: read_int(s,&nv);
5066: read_int(s,&sugar);
5067: read_int(s,&len);
5068:
5069: m0 = m = MALLOC(len*nmv_adv);
5070: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
1.113 noro 5071: loadobj(s,&obj); CQ(m) = (Q)obj;
1.77 noro 5072: dl = DL(m);
5073: ndl_zero(dl);
5074: read_int(s,&td); TD(dl) = td;
5075: for ( j = 0; j < nv; j++ ) {
5076: read_int(s,&e);
5077: PUT_EXP(dl,j,e);
5078: }
5079: if ( nd_blockmask ) ndl_weight_mask(dl);
5080: }
5081: fclose(s);
5082: MKNDV(nv,m0,len,d);
5083: SG(d) = sugar;
5084: return d;
1.99 noro 5085: }
5086:
1.102 noro 5087: void nd_det(int mod,MAT f,P *rp)
1.99 noro 5088: {
5089: VL fv,tv;
1.102 noro 5090: int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a;
1.99 noro 5091: pointer **m;
1.113 noro 5092: Q mone;
1.102 noro 5093: NDV **dm;
5094: NDV *t,*mi,*mj;
5095: NDV d,s,mij,mjj;
5096: ND u;
5097: NMV nmv;
1.114 noro 5098: UINT *bound;
1.99 noro 5099: PGeoBucket bucket;
5100: struct order_spec *ord;
5101:
5102: create_order_spec(0,0,&ord);
5103: nd_init_ord(ord);
5104: get_vars((Obj)f,&fv);
5105: if ( f->row != f->col )
5106: error("nd_det : non-square matrix");
5107: n = f->row;
5108: for ( nvar = 0, tv = fv; tv; tv = NEXT(tv), nvar++ );
5109: m = f->body;
5110: for ( i = 0, max = 0; i < n; i++ )
5111: for ( j = 0; j < n; j++ )
5112: for ( tv = fv; tv; tv = NEXT(tv) ) {
5113: e = getdeg(tv->v,(P)m[i][j]);
5114: max = MAX(e,max);
5115: }
1.114 noro 5116: nd_setup_parameters(nvar,max);
1.102 noro 5117: dm = (NDV **)almat_pointer(n,n);
1.99 noro 5118: for ( i = 0, max = 0; i < n; i++ )
1.102 noro 5119: for ( j = 0; j < n; j++ ) {
5120: dm[i][j] = ptondv(CO,fv,m[i][j]);
5121: if ( mod ) ndv_mod(mod,dm[i][j]);
5122: if ( dm[i][j] && !LEN(dm[i][j]) ) dm[i][j] = 0;
5123: }
5124: d = ptondv(CO,fv,(P)ONE);
5125: if ( mod ) ndv_mod(mod,d);
1.113 noro 5126: chsgnq(ONE,&mone);
1.99 noro 5127: for ( j = 0, sgn = 1; j < n; j++ ) {
1.104 noro 5128: if ( DP_Print ) fprintf(stderr,"j=%d\n",j);
1.99 noro 5129: for ( i = j; i < n && !dm[i][j]; i++ );
5130: if ( i == n ) {
5131: *rp = 0;
5132: return;
5133: }
1.102 noro 5134: k0 = i; l0 = j; len0 = LEN(dm[k0][l0]);
1.99 noro 5135: for ( k = j; k < n; k++ )
5136: for ( l = j; l < n; l++ )
1.102 noro 5137: if ( dm[k][l] && LEN(dm[k][l]) < len0 ) {
5138: k0 = k; l0 = l; len0 = LEN(dm[k][l]);
1.99 noro 5139: }
5140: if ( k0 != j ) {
5141: t = dm[j]; dm[j] = dm[k0]; dm[k0] = t;
5142: sgn = -sgn;
5143: }
5144: if ( l0 != j ) {
5145: for ( k = j; k < n; k++ ) {
5146: s = dm[k][j]; dm[k][j] = dm[k][l0]; dm[k][l0] = s;
5147: }
5148: sgn = -sgn;
5149: }
1.114 noro 5150: bound = nd_det_compute_bound(dm,n,j);
5151: if ( ndl_check_bound(bound,bound) )
5152: nd_det_reconstruct(dm,n,j,d);
5153:
1.99 noro 5154: for ( i = j+1, mj = dm[j], mjj = mj[j]; i < n; i++ ) {
1.114 noro 5155: /* if ( DP_Print ) fprintf(stderr," i=%d\n ",i); */
1.99 noro 5156: mi = dm[i]; mij = mi[j];
1.102 noro 5157: if ( mod )
5158: ndv_mul_c(mod,mij,mod-1);
5159: else
1.113 noro 5160: ndv_mul_c_q(mij,mone);
1.99 noro 5161: for ( k = j+1; k < n; k++ ) {
1.114 noro 5162: /* if ( DP_Print ) fprintf(stderr,"k=%d ",k); */
1.99 noro 5163: bucket = create_pbucket();
1.104 noro 5164: if ( mi[k] ) {
1.102 noro 5165: nmv = BDY(mjj); len = LEN(mjj);
5166: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
5167: u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d)));
5168: add_pbucket(mod,bucket,u);
1.99 noro 5169: }
1.104 noro 5170: }
1.99 noro 5171: if ( mj[k] && mij ) {
1.102 noro 5172: nmv = BDY(mij); len = LEN(mij);
5173: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
5174: u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d)));
5175: add_pbucket(mod,bucket,u);
1.99 noro 5176: }
5177: }
1.104 noro 5178: u = nd_quo(mod,bucket,d);
1.102 noro 5179: mi[k] = ndtondv(mod,u);
1.99 noro 5180: }
1.114 noro 5181: /* if ( DP_Print ) fprintf(stderr,"\n",k); */
1.99 noro 5182: }
5183: d = mjj;
5184: }
1.100 noro 5185: if ( sgn < 0 )
1.102 noro 5186: if ( mod )
5187: ndv_mul_c(mod,d,mod-1);
5188: else
1.113 noro 5189: ndv_mul_c_q(d,mone);
1.102 noro 5190: *rp = ndvtop(mod,CO,fv,d);
1.99 noro 5191: }
5192:
1.102 noro 5193: ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d)
1.99 noro 5194: {
5195: NM mr,mr0;
1.102 noro 5196: NM tnm;
5197: NMV m;
1.99 noro 5198: UINT *d0,*dt,*dm;
5199: int c,n,td,i,c1,c2,len;
1.113 noro 5200: Q q;
1.99 noro 5201: ND r;
5202:
5203: if ( !p ) return 0;
5204: else {
1.102 noro 5205: n = NV(p); m = BDY(p); len = LEN(p);
1.99 noro 5206: d0 = DL(m0);
1.102 noro 5207: td = TD(d);
1.99 noro 5208: mr0 = 0;
5209: NEWNM(tnm);
1.102 noro 5210: if ( mod ) {
5211: c = CM(m0);
5212: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
5213: ndl_add(DL(m),d0,DL(tnm));
5214: if ( ndl_reducible(DL(tnm),d) ) {
5215: NEXTNM(mr0,mr);
5216: c1 = CM(m); DMAR(c1,c,0,mod,c2); CM(mr) = c2;
1.104 noro 5217: ndl_copy(DL(tnm),DL(mr));
1.102 noro 5218: }
5219: }
5220: } else {
1.113 noro 5221: q = CQ(m0);
1.102 noro 5222: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
5223: ndl_add(DL(m),d0,DL(tnm));
5224: if ( ndl_reducible(DL(tnm),d) ) {
5225: NEXTNM(mr0,mr);
1.113 noro 5226: mulq(CQ(m),q,&CQ(mr));
1.104 noro 5227: ndl_copy(DL(tnm),DL(mr));
1.102 noro 5228: }
1.99 noro 5229: }
5230: }
5231: if ( !mr0 )
5232: return 0;
5233: else {
5234: NEXT(mr) = 0;
1.105 noro 5235: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
1.99 noro 5236: MKND(NV(p),mr0,len,r);
5237: SG(r) = SG(p) + TD(d0);
5238: return r;
5239: }
5240: }
1.114 noro 5241: }
5242:
5243: void nd_det_reconstruct(NDV **dm,int n,int j,NDV d)
5244: {
5245: int i,obpe,oadv,h,k,l;
5246: static NM prev_nm_free_list;
5247: EPOS oepos;
5248:
5249: obpe = nd_bpe;
5250: oadv = nmv_adv;
5251: oepos = nd_epos;
5252: if ( obpe < 2 ) nd_bpe = 2;
5253: else if ( obpe < 3 ) nd_bpe = 3;
5254: else if ( obpe < 4 ) nd_bpe = 4;
5255: else if ( obpe < 5 ) nd_bpe = 5;
5256: else if ( obpe < 6 ) nd_bpe = 6;
5257: else if ( obpe < 8 ) nd_bpe = 8;
5258: else if ( obpe < 10 ) nd_bpe = 10;
5259: else if ( obpe < 16 ) nd_bpe = 16;
5260: else if ( obpe < 32 ) nd_bpe = 32;
5261: else error("nd_det_reconstruct : exponent too large");
5262:
5263: nd_setup_parameters(nd_nvar,0);
5264: prev_nm_free_list = _nm_free_list;
5265: _nm_free_list = 0;
5266: for ( k = j; k < n; k++ )
5267: for (l = j; l < n; l++ )
5268: ndv_realloc(dm[k][l],obpe,oadv,oepos);
5269: ndv_realloc(d,obpe,oadv,oepos);
5270: prev_nm_free_list = 0;
5271: #if 0
5272: GC_gcollect();
5273: #endif
5274: }
5275:
5276: UINT *nd_det_compute_bound(NDV **dm,int n,int j)
5277: {
5278: UINT *d0,*d1,*d,*t,*r;
5279: int k,l;
5280:
5281: d0 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
5282: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
5283: for ( k = 0; k < nd_wpd; k++ ) d0[k] = 0;
5284: for ( k = j; k < n; k++ )
5285: for ( l = j; l < n; l++ )
5286: if ( dm[k][l] ) {
5287: d = ndv_compute_bound(dm[k][l]);
5288: ndl_lcm(d,d0,d1);
5289: t = d1; d1 = d0; d0 = t;
5290: }
5291: r = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
5292: for ( k = 0; k < nd_wpd; k++ ) r[k] = d0[k];
5293: return r;
1.117 noro 5294: }
5295:
5296: DL nd_separate_d(UINT *d,UINT *trans)
5297: {
1.121 noro 5298: int n,td,i,e,j;
1.117 noro 5299: DL a;
5300:
5301: ndl_zero(trans);
5302: td = 0;
1.121 noro 5303: for ( i = 0; i < nd_ntrans; i++ ) {
5304: e = GET_EXP(d,i);
5305: PUT_EXP(trans,i,e);
5306: td += MUL_WEIGHT(e,i);
5307: }
5308: if ( nd_ntrans+nd_nalg < nd_nvar ) {
5309: /* homogenized */
5310: i = nd_nvar-1;
1.117 noro 5311: e = GET_EXP(d,i);
5312: PUT_EXP(trans,i,e);
5313: td += MUL_WEIGHT(e,i);
5314: }
5315: TD(trans) = td;
5316: if ( nd_blockmask) ndl_weight_mask(trans);
5317: NEWDL(a,nd_nalg);
5318: td = 0;
1.121 noro 5319: for ( i = 0; i < nd_nalg; i++ ) {
5320: j = nd_ntrans+i;
5321: e = GET_EXP(d,j);
5322: a->d[i] = e;
1.117 noro 5323: td += e;
5324: }
5325: a->td = td;
5326: return a;
5327: }
5328:
1.118 noro 5329: int nd_monic(int mod,ND *p)
1.117 noro 5330: {
5331: UINT *trans,*t;
5332: DL alg;
5333: MP mp0,mp;
1.118 noro 5334: NM m,m0,m1,ma0,ma,mb,mr0,mr;
5335: ND r;
1.117 noro 5336: DL dl;
5337: DP nm;
5338: NDV ndv;
1.118 noro 5339: DAlg inv,cd;
1.117 noro 5340: ND s,c;
1.118 noro 5341: Q l,mul;
5342: N ln;
5343: int n,ntrans,i,e,td,is_lc,len;
5344: NumberField nf;
5345: struct oEGT eg0,eg1;
5346:
5347: if ( !(nf = get_numberfield()) )
5348: error("nd_monic : current_numberfield is not set");
1.117 noro 5349:
1.118 noro 5350: /* Q coef -> DAlg coef */
5351: NEWNM(ma0); ma = ma0;
5352: m = BDY(*p);
5353: is_lc = 1;
5354: while ( 1 ) {
5355: NEWMP(mp0); mp = mp0;
5356: mp->c = (P)CQ(m);
5357: mp->dl = nd_separate_d(DL(m),DL(ma));
5358: NEWNM(mb);
5359: for ( m = NEXT(m); m; m = NEXT(m) ) {
5360: alg = nd_separate_d(DL(m),DL(mb));
5361: if ( !ndl_equal(DL(ma),DL(mb)) )
5362: break;
5363: NEXTMP(mp0,mp); mp->c = (P)CQ(m); mp->dl = alg;
5364: }
5365: NEXT(mp) = 0;
5366: MKDP(nd_nalg,mp0,nm);
5367: MKDAlg(nm,ONE,cd);
5368: if ( is_lc == 1 ) {
5369: /* if the lc is a rational number, we have nothing to do */
5370: if ( !mp0->dl->td )
5371: return 1;
5372:
5373: get_eg(&eg0);
5374: invdalg(cd,&inv);
5375: get_eg(&eg1); add_eg(&eg_invdalg,&eg0,&eg1);
5376: /* check the validity of inv */
5377: if ( mod && !rem(NM(inv->dn),mod) )
5378: return 0;
5379: CA(ma) = nf->one;
5380: is_lc = 0;
5381: ln = ONEN;
5382: } else {
5383: muldalg(cd,inv,&CA(ma));
5384: lcmn(ln,NM(CA(ma)->dn),&ln);
5385: }
5386: if ( m ) {
5387: NEXT(ma) = mb; ma = mb;
5388: } else {
5389: NEXT(ma) = 0;
5390: break;
5391: }
5392: }
5393: /* l = lcm(denoms) */
5394: NTOQ(ln,1,l);
5395: for ( mr0 = 0, m = ma0; m; m = NEXT(m) ) {
5396: divq(l,CA(m)->dn,&mul);
5397: for ( mp = BDY(CA(m)->nm); mp; mp = NEXT(mp) ) {
5398: NEXTNM(mr0,mr);
5399: mulq((Q)mp->c,mul,&CQ(mr));
5400: dl = mp->dl;
5401: td = TD(DL(m));
5402: ndl_copy(DL(m),DL(mr));
1.121 noro 5403: for ( i = 0; i < nd_nalg; i++ ) {
5404: e = dl->d[i];
5405: PUT_EXP(DL(mr),i+nd_ntrans,e);
5406: td += MUL_WEIGHT(e,i+nd_ntrans);
1.118 noro 5407: }
5408: TD(DL(mr)) = td;
5409: if ( nd_blockmask) ndl_weight_mask(DL(mr));
5410: }
1.117 noro 5411: }
1.118 noro 5412: NEXT(mr) = 0;
5413: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
5414: MKND(NV(*p),mr0,len,r);
5415: /* XXX */
5416: SG(r) = SG(*p);
5417: nd_free(*p);
5418: *p = r;
5419: return 1;
1.59 noro 5420: }