Annotation of OpenXM_contrib2/asir2000/engine/nd.c, Revision 1.122
1.122 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.121 2004/12/09 08:56:43 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;
2369: if ( !m ) {
2370: get_algtree((Obj)f,&av);
2371: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
1.121 noro 2372: nd_ntrans = nvar;
1.119 noro 2373: nd_nalg = nalg;
2374: /* #i -> t#i */
2375: if ( nalg ) {
1.120 noro 2376: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
2377: ord = ord1;
2378: f = f1;
1.119 noro 2379: }
1.120 noro 2380: nvar += nalg;
1.119 noro 2381: }
1.32 noro 2382: nd_init_ord(ord);
1.61 noro 2383: for ( t = BDY(f), max = 0; t; t = NEXT(t) )
2384: for ( tv = vv; tv; tv = NEXT(tv) ) {
2385: e = getdeg(tv->v,(P)BDY(t));
2386: max = MAX(e,max);
2387: }
2388: nd_setup_parameters(nvar,max);
1.77 noro 2389: ishomo = 1;
1.1 noro 2390: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
1.61 noro 2391: b = (pointer)ptondv(CO,vv,(P)BDY(t));
1.77 noro 2392: if ( ishomo )
2393: ishomo = ishomo && ndv_ishomo(b);
1.69 noro 2394: if ( m ) ndv_mod(m,b);
1.61 noro 2395: if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; }
1.1 noro 2396: }
2397: if ( fd0 ) NEXT(fd) = 0;
1.61 noro 2398: ndv_setup(m,0,fd0);
1.77 noro 2399: x = f4?nd_f4(m):nd_gb(m,ishomo,0);
1.82 noro 2400: nd_demand = 0;
1.61 noro 2401: x = ndv_reducebase(x);
2402: x = ndv_reduceall(m,x);
1.23 noro 2403: for ( r0 = 0, t = x; t; t = NEXT(t) ) {
1.1 noro 2404: NEXTNODE(r0,r);
1.61 noro 2405: BDY(r) = ndvtop(m,CO,vv,BDY(t));
1.20 noro 2406: }
2407: if ( r0 ) NEXT(r) = 0;
1.121 noro 2408: if ( nalg )
2409: r0 = postprocess_algcoef(av,alist,r0);
1.20 noro 2410: MKLIST(*rp,r0);
1.103 noro 2411: #if 0
1.74 noro 2412: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.103 noro 2413: #endif
1.20 noro 2414: }
2415:
1.52 noro 2416: void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp)
1.20 noro 2417: {
1.119 noro 2418: VL tv,fv,vv,vc,av;
2419: NODE fd,fd0,in0,in,r,r0,t,s,cand,alist;
1.61 noro 2420: int m,nocheck,nvar,mindex,e,max;
2421: NDV c;
2422: NMV a;
1.27 noro 2423: P p;
1.61 noro 2424: EPOS oepos;
1.119 noro 2425: int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg;
2426: Alg alpha,dp;
2427: P poly;
2428: LIST f1,f2;
2429: Obj obj;
2430: NumberField nf;
1.120 noro 2431: struct order_spec *ord1;
1.20 noro 2432:
2433: get_vars((Obj)f,&fv); pltovl(v,&vv);
1.74 noro 2434: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
1.88 noro 2435: switch ( ord->id ) {
2436: case 1:
2437: if ( ord->nv != nvar )
2438: error("nd_gr_trace : invalid order specification");
2439: break;
2440: default:
2441: break;
2442: }
1.119 noro 2443:
2444: get_algtree((Obj)f,&av);
2445: for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );
1.121 noro 2446: nd_ntrans = nvar;
1.119 noro 2447: nd_nalg = nalg;
2448: /* #i -> t#i */
2449: if ( nalg ) {
1.120 noro 2450: preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);
2451: ord = ord1;
2452: f = f1;
1.119 noro 2453: }
1.120 noro 2454: nvar += nalg;
1.119 noro 2455:
1.52 noro 2456: nocheck = 0;
2457: mindex = 0;
2458:
1.78 noro 2459: if ( Demand ) nd_demand = 1;
2460: else nd_demand = 0;
2461:
1.52 noro 2462: /* setup modulus */
2463: if ( trace < 0 ) {
2464: trace = -trace;
2465: nocheck = 1;
2466: }
2467: m = trace > 1 ? trace : get_lprime(mindex);
1.61 noro 2468: for ( t = BDY(f), max = 0; t; t = NEXT(t) )
2469: for ( tv = vv; tv; tv = NEXT(tv) ) {
2470: e = getdeg(tv->v,(P)BDY(t));
2471: max = MAX(e,max);
1.23 noro 2472: }
1.61 noro 2473: nd_init_ord(ord);
2474: nd_setup_parameters(nvar,max);
2475: obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos;
1.82 noro 2476: ishomo = 1;
1.61 noro 2477: for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
2478: c = ptondv(CO,vv,(P)BDY(t));
1.82 noro 2479: if ( ishomo )
2480: ishomo = ishomo && ndv_ishomo(c);
1.61 noro 2481: if ( c ) {
2482: NEXTNODE(in0,in); BDY(in) = (pointer)c;
2483: NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c);
1.23 noro 2484: }
1.61 noro 2485: }
2486: if ( in0 ) NEXT(in) = 0;
2487: if ( fd0 ) NEXT(fd) = 0;
1.82 noro 2488: if ( !ishomo && homo ) {
1.122 ! noro 2489: for ( t = in0, wmax = max; t; t = NEXT(t) ) {
1.61 noro 2490: c = (NDV)BDY(t); len = LEN(c);
2491: for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) )
2492: wmax = MAX(TD(DL(a)),wmax);
2493: }
2494: homogenize_order(ord,nvar,&ord1);
1.89 noro 2495: nd_init_ord(ord1);
1.61 noro 2496: nd_setup_parameters(nvar+1,wmax);
2497: for ( t = fd0; t; t = NEXT(t) )
2498: ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos);
1.27 noro 2499: }
1.52 noro 2500: while ( 1 ) {
1.77 noro 2501: if ( Demand )
2502: nd_demand = 1;
1.61 noro 2503: ndv_setup(m,1,fd0);
1.82 noro 2504: cand = nd_gb_trace(m,ishomo || homo);
1.52 noro 2505: if ( !cand ) {
2506: /* failure */
1.61 noro 2507: if ( trace > 1 ) { *rp = 0; return; }
2508: else m = get_lprime(++mindex);
1.52 noro 2509: continue;
2510: }
1.82 noro 2511: if ( !ishomo && homo ) {
1.27 noro 2512: /* dehomogenization */
1.61 noro 2513: for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord);
1.45 noro 2514: nd_init_ord(ord);
1.61 noro 2515: nd_setup_parameters(nvar,0);
1.27 noro 2516: }
1.77 noro 2517: nd_demand = 0;
1.61 noro 2518: cand = ndv_reducebase(cand);
2519: cand = ndv_reduceall(0,cand);
1.78 noro 2520: cbpe = nd_bpe;
1.61 noro 2521: if ( nocheck )
2522: break;
2523: if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) )
1.52 noro 2524: /* success */
2525: break;
2526: else if ( trace > 1 ) {
2527: /* failure */
2528: *rp = 0; return;
1.61 noro 2529: } else {
1.52 noro 2530: /* try the next modulus */
2531: m = get_lprime(++mindex);
1.61 noro 2532: /* reset the parameters */
1.82 noro 2533: if ( !ishomo && homo ) {
1.89 noro 2534: nd_init_ord(ord1);
1.61 noro 2535: nd_setup_parameters(nvar+1,wmax);
2536: } else {
2537: nd_init_ord(ord);
2538: nd_setup_parameters(nvar,max);
2539: }
2540: }
1.52 noro 2541: }
1.27 noro 2542: /* dp->p */
1.61 noro 2543: nd_bpe = cbpe;
1.73 noro 2544: nd_setup_parameters(nd_nvar,0);
1.121 noro 2545: for ( r = cand; r; r = NEXT(r) )
1.119 noro 2546: BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r));
1.121 noro 2547: if ( nalg )
2548: cand = postprocess_algcoef(av,alist,cand);
1.27 noro 2549: MKLIST(*rp,cand);
1.1 noro 2550: }
2551:
1.61 noro 2552: void dltondl(int n,DL dl,UINT *r)
1.1 noro 2553: {
1.61 noro 2554: UINT *d;
1.57 noro 2555: int i,j,l,s,ord_l;
1.43 noro 2556: struct order_pair *op;
1.1 noro 2557:
2558: d = dl->d;
1.41 noro 2559: for ( i = 0; i < nd_wpd; i++ ) r[i] = 0;
1.43 noro 2560: if ( nd_blockmask ) {
2561: l = nd_blockmask->n;
2562: op = nd_blockmask->order_pair;
2563: for ( j = 0, s = 0; j < l; j++ ) {
2564: ord_l = op[j].length;
1.57 noro 2565: for ( i = 0; i < ord_l; i++, s++ ) PUT_EXP(r,s,d[s]);
1.43 noro 2566: }
2567: TD(r) = ndl_weight(r);
1.61 noro 2568: ndl_weight_mask(r);
1.43 noro 2569: } else {
1.56 noro 2570: for ( i = 0; i < n; i++ ) PUT_EXP(r,i,d[i]);
1.43 noro 2571: TD(r) = ndl_weight(r);
2572: }
1.1 noro 2573: }
2574:
1.61 noro 2575: DL ndltodl(int n,UINT *ndl)
1.1 noro 2576: {
2577: DL dl;
2578: int *d;
1.57 noro 2579: int i,j,l,s,ord_l;
1.43 noro 2580: struct order_pair *op;
1.1 noro 2581:
2582: NEWDL(dl,n);
1.34 noro 2583: dl->td = TD(ndl);
1.1 noro 2584: d = dl->d;
1.43 noro 2585: if ( nd_blockmask ) {
2586: l = nd_blockmask->n;
2587: op = nd_blockmask->order_pair;
2588: for ( j = 0, s = 0; j < l; j++ ) {
2589: ord_l = op[j].length;
1.57 noro 2590: for ( i = 0; i < ord_l; i++, s++ ) d[s] = GET_EXP(ndl,s);
1.43 noro 2591: }
2592: } else {
1.56 noro 2593: for ( i = 0; i < n; i++ ) d[i] = GET_EXP(ndl,i);
1.43 noro 2594: }
1.1 noro 2595: return dl;
2596: }
2597:
1.61 noro 2598: void ndl_print(UINT *dl)
1.1 noro 2599: {
2600: int n;
1.57 noro 2601: int i,j,l,ord_l,s,s0;
1.43 noro 2602: struct order_pair *op;
1.1 noro 2603:
2604: n = nd_nvar;
2605: printf("<<");
1.43 noro 2606: if ( nd_blockmask ) {
2607: l = nd_blockmask->n;
2608: op = nd_blockmask->order_pair;
2609: for ( j = 0, s = s0 = 0; j < l; j++ ) {
2610: ord_l = op[j].length;
1.57 noro 2611: for ( i = 0; i < ord_l; i++, s++ )
2612: printf(s==n-1?"%d":"%d,",GET_EXP(dl,s));
1.43 noro 2613: }
2614: } else {
1.56 noro 2615: for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,i));
1.43 noro 2616: }
1.1 noro 2617: printf(">>");
2618: }
2619:
2620: void nd_print(ND p)
2621: {
2622: NM m;
2623:
2624: if ( !p )
2625: printf("0\n");
2626: else {
2627: for ( m = BDY(p); m; m = NEXT(m) ) {
1.71 noro 2628: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
2629: else printf("+%d*",CM(m));
1.14 noro 2630: ndl_print(DL(m));
1.1 noro 2631: }
2632: printf("\n");
2633: }
2634: }
2635:
1.113 noro 2636: void nd_print_q(ND p)
1.16 noro 2637: {
2638: NM m;
2639:
2640: if ( !p )
2641: printf("0\n");
2642: else {
2643: for ( m = BDY(p); m; m = NEXT(m) ) {
2644: printf("+");
1.113 noro 2645: printexpr(CO,(Obj)CQ(m));
1.16 noro 2646: printf("*");
2647: ndl_print(DL(m));
2648: }
2649: printf("\n");
2650: }
2651: }
2652:
1.1 noro 2653: void ndp_print(ND_pairs d)
2654: {
2655: ND_pairs t;
2656:
1.34 noro 2657: for ( t = d; t; t = NEXT(t) ) printf("%d,%d ",t->i1,t->i2);
1.1 noro 2658: printf("\n");
2659: }
2660:
1.20 noro 2661: void nd_removecont(int mod,ND p)
1.16 noro 2662: {
2663: int i,n;
1.113 noro 2664: Q *w;
2665: Q dvr,t;
1.16 noro 2666: NM m;
1.21 noro 2667: struct oVECT v;
1.113 noro 2668: N q,r;
1.16 noro 2669:
1.71 noro 2670: if ( mod == -1 ) nd_mul_c(mod,p,_invsf(HCM(p)));
2671: else if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod));
1.20 noro 2672: else {
2673: for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ );
1.113 noro 2674: w = (Q *)ALLOCA(n*sizeof(Q));
1.21 noro 2675: v.len = n;
2676: v.body = (pointer *)w;
1.113 noro 2677: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
1.21 noro 2678: removecont_array(w,n);
1.113 noro 2679: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
1.16 noro 2680: }
2681: }
2682:
1.21 noro 2683: void nd_removecont2(ND p1,ND p2)
2684: {
2685: int i,n1,n2,n;
1.113 noro 2686: Q *w;
2687: Q dvr,t;
1.21 noro 2688: NM m;
2689: struct oVECT v;
1.113 noro 2690: N q,r;
1.21 noro 2691:
2692: if ( !p1 ) {
2693: nd_removecont(0,p2); return;
2694: } else if ( !p2 ) {
2695: nd_removecont(0,p1); return;
2696: }
2697: n1 = nd_length(p1);
2698: n2 = nd_length(p2);
2699: n = n1+n2;
1.113 noro 2700: w = (Q *)ALLOCA(n*sizeof(Q));
1.21 noro 2701: v.len = n;
2702: v.body = (pointer *)w;
1.113 noro 2703: for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) w[i] = CQ(m);
2704: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
1.21 noro 2705: removecont_array(w,n);
1.113 noro 2706: for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) CQ(m) = w[i];
2707: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
1.21 noro 2708: }
2709:
1.20 noro 2710: void ndv_removecont(int mod,NDV p)
1.16 noro 2711: {
2712: int i,len;
1.113 noro 2713: Q *w;
2714: Q dvr,t;
1.16 noro 2715: NMV m;
2716:
1.71 noro 2717: if ( mod == -1 )
2718: ndv_mul_c(mod,p,_invsf(HCM(p)));
2719: else if ( mod )
1.20 noro 2720: ndv_mul_c(mod,p,invm(HCM(p),mod));
2721: else {
2722: len = p->len;
1.113 noro 2723: w = (Q *)ALLOCA(len*sizeof(Q));
2724: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) w[i] = CQ(m);
2725: sortbynm(w,len);
2726: qltozl(w,len,&dvr);
2727: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) {
2728: divq(CQ(m),dvr,&t); CQ(m) = t;
2729: }
1.16 noro 2730: }
1.21 noro 2731: }
2732:
1.61 noro 2733: void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos)
2734: {
2735: int len,i,max;
2736: NMV m,mr0,mr,t;
2737:
2738: len = p->len;
2739: for ( m = BDY(p), i = 0, max = 0; i < len; NMV_OADV(m), i++ )
2740: max = MAX(max,TD(DL(m)));
2741: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
2742: m = (NMV)((char *)mr0+(len-1)*oadv);
2743: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
2744: t = (NMV)ALLOCA(nmv_adv);
2745: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
2746: ndl_homogenize(DL(m),DL(t),obpe,oepos,max);
1.113 noro 2747: CQ(mr) = CQ(m);
1.61 noro 2748: ndl_copy(DL(t),DL(mr));
2749: }
2750: NV(p)++;
2751: BDY(p) = mr0;
2752: }
2753:
1.45 noro 2754: void ndv_dehomogenize(NDV p,struct order_spec *ord)
1.23 noro 2755: {
1.45 noro 2756: int i,j,adj,len,newnvar,newwpd,newadv,newexporigin;
1.113 noro 2757: Q *w;
2758: Q dvr,t;
1.23 noro 2759: NMV m,r;
2760:
2761: len = p->len;
2762: newnvar = nd_nvar-1;
1.48 noro 2763: newexporigin = nd_get_exporigin(ord);
1.45 noro 2764: newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0)+newexporigin;
1.23 noro 2765: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ )
1.34 noro 2766: ndl_dehomogenize(DL(m));
1.23 noro 2767: if ( newwpd != nd_wpd ) {
1.90 noro 2768: newadv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(newwpd-1)*sizeof(UINT));
1.61 noro 2769: for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NDV_NADV(r), i++ ) {
1.113 noro 2770: CQ(r) = CQ(m);
1.45 noro 2771: for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j];
2772: adj = nd_exporigin-newexporigin;
2773: for ( ; j < newwpd; j++ ) DL(r)[j] = DL(m)[j+adj];
1.23 noro 2774: }
2775: }
2776: NV(p)--;
2777: }
2778:
1.113 noro 2779: void removecont_array(Q *c,int n)
1.21 noro 2780: {
2781: struct oVECT v;
1.113 noro 2782: Q d0,d1,a,u,u1,gcd;
1.110 noro 2783: int i,j;
1.113 noro 2784: N qn,rn,gn;
2785: Q *q,*r;
1.21 noro 2786:
1.113 noro 2787: q = (Q *)ALLOCA(n*sizeof(Q));
2788: r = (Q *)ALLOCA(n*sizeof(Q));
1.21 noro 2789: v.id = O_VECT; v.len = n; v.body = (pointer *)c;
1.113 noro 2790: igcdv_estimate(&v,&d0);
2791: for ( i = 0; i < n; i++ ) {
2792: divn(NM(c[i]),NM(d0),&qn,&rn);
2793: NTOQ(qn,SGN(c[i])*SGN(d0),q[i]);
2794: NTOQ(rn,SGN(c[i]),r[i]);
2795: }
1.34 noro 2796: for ( i = 0; i < n; i++ ) if ( r[i] ) break;
1.21 noro 2797: if ( i < n ) {
2798: v.id = O_VECT; v.len = n; v.body = (pointer *)r;
1.113 noro 2799: igcdv(&v,&d1);
2800: gcdn(NM(d0),NM(d1),&gn); NTOQ(gn,1,gcd);
2801: divsn(NM(d0),gn,&qn); NTOQ(qn,1,a);
1.21 noro 2802: for ( i = 0; i < n; i++ ) {
1.113 noro 2803: mulq(a,q[i],&u);
2804: if ( r[i] ) {
2805: divsn(NM(r[i]),gn,&qn); NTOQ(qn,SGN(r[i]),u1);
2806: addq(u,u1,&q[i]);
2807: } else
2808: q[i] = u;
1.21 noro 2809: }
2810: }
1.34 noro 2811: for ( i = 0; i < n; i++ ) c[i] = q[i];
1.16 noro 2812: }
2813:
1.19 noro 2814: void nd_mul_c(int mod,ND p,int mul)
1.1 noro 2815: {
2816: NM m;
2817: int c,c1;
2818:
1.34 noro 2819: if ( !p ) return;
1.115 noro 2820: if ( mul == 1 ) return;
1.71 noro 2821: if ( mod == -1 )
2822: for ( m = BDY(p); m; m = NEXT(m) )
2823: CM(m) = _mulsf(CM(m),mul);
2824: else
2825: for ( m = BDY(p); m; m = NEXT(m) ) {
2826: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
2827: }
1.1 noro 2828: }
2829:
1.113 noro 2830: void nd_mul_c_q(ND p,Q mul)
1.16 noro 2831: {
2832: NM m;
1.113 noro 2833: Q c;
1.16 noro 2834:
1.113 noro 2835: if ( !p ) return;
1.115 noro 2836: if ( UNIQ(mul) ) return;
1.16 noro 2837: for ( m = BDY(p); m; m = NEXT(m) ) {
1.113 noro 2838: mulq(CQ(m),mul,&c); CQ(m) = c;
1.16 noro 2839: }
2840: }
2841:
1.61 noro 2842: void nd_mul_c_p(VL vl,ND p,P mul)
2843: {
2844: NM m;
2845: P c;
2846:
2847: if ( !p ) return;
2848: for ( m = BDY(p); m; m = NEXT(m) ) {
2849: mulp(vl,CP(m),mul,&c); CP(m) = c;
2850: }
2851: }
2852:
1.1 noro 2853: void nd_free(ND p)
2854: {
2855: NM t,s;
2856:
1.34 noro 2857: if ( !p ) return;
1.1 noro 2858: t = BDY(p);
2859: while ( t ) {
2860: s = NEXT(t);
2861: FREENM(t);
2862: t = s;
2863: }
2864: FREEND(p);
2865: }
2866:
1.23 noro 2867: void ndv_free(NDV p)
2868: {
2869: GC_free(BDY(p));
2870: }
2871:
1.61 noro 2872: void nd_append_red(UINT *d,int i)
1.1 noro 2873: {
1.13 noro 2874: RHist m,m0;
1.1 noro 2875: int h;
2876:
1.13 noro 2877: NEWRHist(m);
1.34 noro 2878: h = ndl_hash_value(d);
1.13 noro 2879: m->index = i;
1.14 noro 2880: ndl_copy(d,DL(m));
1.1 noro 2881: NEXT(m) = nd_red[h];
2882: nd_red[h] = m;
2883: }
2884:
1.61 noro 2885: UINT *ndv_compute_bound(NDV p)
1.1 noro 2886: {
1.61 noro 2887: UINT *d1,*d2,*t;
2888: UINT u;
1.57 noro 2889: int i,j,k,l,len,ind;
1.45 noro 2890: NMV m;
1.1 noro 2891:
2892: if ( !p )
2893: return 0;
1.61 noro 2894: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
2895: d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
1.45 noro 2896: len = LEN(p);
2897: m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m);
2898: for ( i = 1; i < len; i++, NMV_ADV(m) ) {
1.14 noro 2899: ndl_lcm(DL(m),d1,d2);
1.1 noro 2900: t = d1; d1 = d2; d2 = t;
2901: }
1.12 noro 2902: l = nd_nvar+31;
1.61 noro 2903: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
1.57 noro 2904: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
2905: u = d1[i];
2906: k = (nd_epw-1)*nd_bpe;
2907: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
2908: t[ind] = (u>>k)&nd_mask0;
2909: }
2910: for ( ; ind < l; ind++ ) t[ind] = 0;
1.1 noro 2911: return t;
2912: }
2913:
1.99 noro 2914: UINT *nd_compute_bound(ND p)
2915: {
2916: UINT *d1,*d2,*t;
2917: UINT u;
2918: int i,j,k,l,len,ind;
2919: NM m;
2920:
2921: if ( !p )
2922: return 0;
2923: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
2924: d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
2925: len = LEN(p);
2926: m = BDY(p); ndl_copy(DL(m),d1); m = NEXT(m);
2927: for ( m = NEXT(m); m; m = NEXT(m) ) {
2928: ndl_lcm(DL(m),d1,d2);
2929: t = d1; d1 = d2; d2 = t;
2930: }
2931: l = nd_nvar+31;
2932: t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT));
2933: for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) {
2934: u = d1[i];
2935: k = (nd_epw-1)*nd_bpe;
2936: for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ )
2937: t[ind] = (u>>k)&nd_mask0;
2938: }
2939: for ( ; ind < l; ind++ ) t[ind] = 0;
2940: return t;
2941: }
2942:
1.48 noro 2943: int nd_get_exporigin(struct order_spec *ord)
2944: {
1.51 noro 2945: switch ( ord->id ) {
1.96 noro 2946: case 0: case 2:
1.48 noro 2947: return 1;
1.41 noro 2948: case 1:
2949: /* block order */
1.43 noro 2950: /* d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */
1.48 noro 2951: return ord->ord.block.length+1;
1.96 noro 2952: case 3:
2953: error("nd_get_exporigin : composite order is not supported yet.");
1.41 noro 2954: }
1.48 noro 2955: }
2956:
1.61 noro 2957: void nd_setup_parameters(int nvar,int max) {
1.79 noro 2958: int i,j,n,elen,ord_o,ord_l,l,s,wpd;
1.57 noro 2959: struct order_pair *op;
1.48 noro 2960:
1.73 noro 2961: nd_nvar = nvar;
1.79 noro 2962: if ( max ) {
1.83 noro 2963: /* XXX */
2964: if ( do_weyl ) nd_bpe = 32;
2965: else if ( max < 2 ) nd_bpe = 1;
1.79 noro 2966: else if ( max < 4 ) nd_bpe = 2;
2967: else if ( max < 8 ) nd_bpe = 3;
2968: else if ( max < 16 ) nd_bpe = 4;
2969: else if ( max < 32 ) nd_bpe = 5;
2970: else if ( max < 64 ) nd_bpe = 6;
2971: else if ( max < 256 ) nd_bpe = 8;
2972: else if ( max < 1024 ) nd_bpe = 10;
2973: else if ( max < 65536 ) nd_bpe = 16;
2974: else nd_bpe = 32;
2975: }
1.61 noro 2976: nd_epw = (sizeof(UINT)*8)/nd_bpe;
1.48 noro 2977: elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);
2978: nd_exporigin = nd_get_exporigin(nd_ord);
1.79 noro 2979: wpd = nd_exporigin+elen;
2980: if ( wpd != nd_wpd ) {
2981: nd_free_private_storage();
2982: nd_wpd = wpd;
2983: }
1.1 noro 2984: if ( nd_bpe < 32 ) {
2985: nd_mask0 = (1<<nd_bpe)-1;
2986: } else {
2987: nd_mask0 = 0xffffffff;
2988: }
2989: bzero(nd_mask,sizeof(nd_mask));
2990: nd_mask1 = 0;
2991: for ( i = 0; i < nd_epw; i++ ) {
2992: nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe));
2993: nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe);
2994: }
1.90 noro 2995: nmv_adv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(nd_wpd-1)*sizeof(UINT));
1.57 noro 2996: nd_epos = nd_create_epos(nd_ord);
1.43 noro 2997: nd_blockmask = nd_create_blockmask(nd_ord);
1.96 noro 2998: nd_work_vector = (int *)REALLOC(nd_work_vector,nd_nvar*sizeof(int));
1.1 noro 2999: }
3000:
1.103 noro 3001: ND_pairs nd_reconstruct(int trace,ND_pairs d)
1.1 noro 3002: {
1.37 noro 3003: int i,obpe,oadv,h;
1.71 noro 3004: static NM prev_nm_free_list;
3005: static ND_pairs prev_ndp_free_list;
1.13 noro 3006: RHist mr0,mr;
3007: RHist r;
1.37 noro 3008: RHist *old_red;
1.71 noro 3009: ND_pairs s0,s,t;
1.43 noro 3010: EPOS oepos;
1.15 noro 3011:
1.1 noro 3012: obpe = nd_bpe;
1.11 noro 3013: oadv = nmv_adv;
1.43 noro 3014: oepos = nd_epos;
1.63 noro 3015: if ( obpe < 2 ) nd_bpe = 2;
3016: else if ( obpe < 3 ) nd_bpe = 3;
1.62 noro 3017: else if ( obpe < 4 ) nd_bpe = 4;
1.63 noro 3018: else if ( obpe < 5 ) nd_bpe = 5;
1.34 noro 3019: else if ( obpe < 6 ) nd_bpe = 6;
3020: else if ( obpe < 8 ) nd_bpe = 8;
1.63 noro 3021: else if ( obpe < 10 ) nd_bpe = 10;
1.34 noro 3022: else if ( obpe < 16 ) nd_bpe = 16;
3023: else if ( obpe < 32 ) nd_bpe = 32;
3024: else error("nd_reconstruct : exponent too large");
1.5 noro 3025:
1.73 noro 3026: nd_setup_parameters(nd_nvar,0);
1.1 noro 3027: prev_nm_free_list = _nm_free_list;
3028: prev_ndp_free_list = _ndp_free_list;
3029: _nm_free_list = 0;
3030: _ndp_free_list = 0;
1.53 noro 3031: for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos);
3032: if ( trace )
3033: for ( i = nd_psn-1; i >= 0; i-- )
3034: ndv_realloc(nd_ps_trace[i],obpe,oadv,oepos);
1.1 noro 3035: s0 = 0;
3036: for ( t = d; t; t = NEXT(t) ) {
3037: NEXTND_pairs(s0,s);
3038: s->i1 = t->i1;
3039: s->i2 = t->i2;
1.14 noro 3040: SG(s) = SG(t);
1.61 noro 3041: ndl_reconstruct(LCM(t),LCM(s),obpe,oepos);
1.1 noro 3042: }
1.37 noro 3043:
3044: old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist));
1.6 noro 3045: for ( i = 0; i < REDTAB_LEN; i++ ) {
1.37 noro 3046: old_red[i] = nd_red[i];
3047: nd_red[i] = 0;
3048: }
3049: for ( i = 0; i < REDTAB_LEN; i++ )
3050: for ( r = old_red[i]; r; r = NEXT(r) ) {
3051: NEWRHist(mr);
1.13 noro 3052: mr->index = r->index;
1.20 noro 3053: SG(mr) = SG(r);
1.61 noro 3054: ndl_reconstruct(DL(r),DL(mr),obpe,oepos);
1.37 noro 3055: h = ndl_hash_value(DL(mr));
3056: NEXT(mr) = nd_red[h];
3057: nd_red[h] = mr;
1.6 noro 3058: }
1.37 noro 3059: for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0;
3060: old_red = 0;
1.11 noro 3061: for ( i = 0; i < nd_psn; i++ ) {
1.20 noro 3062: NEWRHist(r); SG(r) = SG(nd_psh[i]);
1.61 noro 3063: ndl_reconstruct(DL(nd_psh[i]),DL(r),obpe,oepos);
1.13 noro 3064: nd_psh[i] = r;
1.11 noro 3065: }
1.1 noro 3066: if ( s0 ) NEXT(s) = 0;
3067: prev_nm_free_list = 0;
3068: prev_ndp_free_list = 0;
1.71 noro 3069: #if 0
1.1 noro 3070: GC_gcollect();
1.71 noro 3071: #endif
1.1 noro 3072: return s0;
3073: }
3074:
1.61 noro 3075: void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos)
1.1 noro 3076: {
1.57 noro 3077: int n,i,ei,oepw,omask0,j,s,ord_l,l;
1.43 noro 3078: struct order_pair *op;
1.1 noro 3079:
3080: n = nd_nvar;
1.61 noro 3081: oepw = (sizeof(UINT)*8)/obpe;
1.43 noro 3082: omask0 = (1<<obpe)-1;
1.34 noro 3083: TD(r) = TD(d);
1.41 noro 3084: for ( i = nd_exporigin; i < nd_wpd; i++ ) r[i] = 0;
1.43 noro 3085: if ( nd_blockmask ) {
3086: l = nd_blockmask->n;
3087: op = nd_blockmask->order_pair;
3088: for ( i = 1; i < nd_exporigin; i++ )
3089: r[i] = d[i];
3090: for ( j = 0, s = 0; j < l; j++ ) {
3091: ord_l = op[j].length;
1.57 noro 3092: for ( i = 0; i < ord_l; i++, s++ ) {
3093: ei = GET_EXP_OLD(d,s);
3094: PUT_EXP(r,s,ei);
3095: }
1.1 noro 3096: }
1.43 noro 3097: } else {
1.56 noro 3098: for ( i = 0; i < n; i++ ) {
3099: ei = GET_EXP_OLD(d,i);
3100: PUT_EXP(r,i,ei);
3101: }
1.1 noro 3102: }
3103: }
1.3 noro 3104:
1.6 noro 3105: ND nd_copy(ND p)
3106: {
3107: NM m,mr,mr0;
1.41 noro 3108: int c,n;
1.6 noro 3109: ND r;
3110:
3111: if ( !p )
3112: return 0;
3113: else {
3114: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
3115: NEXTNM(mr0,mr);
1.14 noro 3116: CM(mr) = CM(m);
3117: ndl_copy(DL(m),DL(mr));
1.6 noro 3118: }
3119: NEXT(mr) = 0;
1.31 noro 3120: MKND(NV(p),mr0,LEN(p),r);
1.14 noro 3121: SG(r) = SG(p);
1.6 noro 3122: return r;
3123: }
3124: }
3125:
1.53 noro 3126: int nd_sp(int mod,int trace,ND_pairs p,ND *rp)
1.11 noro 3127: {
3128: NM m;
3129: NDV p1,p2;
3130: ND t1,t2;
1.61 noro 3131: UINT *lcm;
1.31 noro 3132: int td;
1.11 noro 3133:
1.77 noro 3134: if ( !mod && nd_demand ) {
3135: p1 = ndv_load(p->i1); p2 = ndv_load(p->i2);
1.53 noro 3136: } else {
1.77 noro 3137: if ( trace ) {
3138: p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2];
3139: } else {
3140: p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2];
3141: }
1.20 noro 3142: }
1.34 noro 3143: lcm = LCM(p);
1.11 noro 3144: NEWNM(m);
1.113 noro 3145: CQ(m) = HCQ(p2);
1.34 noro 3146: ndl_sub(lcm,HDL(p1),DL(m));
1.56 noro 3147: if ( ndl_check_bound2(p->i1,DL(m)) )
3148: return 0;
1.55 noro 3149: t1 = ndv_mul_nm(mod,m,p1);
1.71 noro 3150: if ( mod == -1 ) CM(m) = _chsgnsf(HCM(p1));
3151: else if ( mod ) CM(m) = mod-HCM(p1);
1.113 noro 3152: else chsgnq(HCQ(p1),&CQ(m));
1.34 noro 3153: ndl_sub(lcm,HDL(p2),DL(m));
1.14 noro 3154: if ( ndl_check_bound2(p->i2,DL(m)) ) {
1.11 noro 3155: nd_free(t1);
3156: return 0;
3157: }
1.55 noro 3158: t2 = ndv_mul_nm(mod,m,p2);
1.31 noro 3159: *rp = nd_add(mod,t1,t2);
1.11 noro 3160: FREENM(m);
3161: return 1;
3162: }
3163:
1.19 noro 3164: void ndv_mul_c(int mod,NDV p,int mul)
1.11 noro 3165: {
3166: NMV m;
3167: int c,c1,len,i;
3168:
1.34 noro 3169: if ( !p ) return;
1.14 noro 3170: len = LEN(p);
1.71 noro 3171: if ( mod == -1 )
3172: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) )
3173: CM(m) = _mulsf(CM(m),mul);
3174: else
3175: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
3176: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
3177: }
1.11 noro 3178: }
3179:
1.113 noro 3180: void ndv_mul_c_q(NDV p,Q mul)
1.16 noro 3181: {
3182: NMV m;
1.113 noro 3183: Q c;
1.16 noro 3184: int len,i;
3185:
1.34 noro 3186: if ( !p ) return;
1.16 noro 3187: len = LEN(p);
3188: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
1.113 noro 3189: mulq(CQ(m),mul,&c); CQ(m) = c;
1.16 noro 3190: }
3191: }
3192:
1.55 noro 3193: ND weyl_ndv_mul_nm(int mod,NM m0,NDV p) {
3194: int n2,i,j,l,n,tlen;
1.61 noro 3195: UINT *d0;
1.55 noro 3196: NM *tab,*psum;
3197: ND s,r;
3198: NM t;
3199: NMV m1;
3200:
3201: if ( !p ) return 0;
3202: n = NV(p); n2 = n>>1;
3203: d0 = DL(m0);
3204: l = LEN(p);
3205: for ( i = 0, tlen = 1; i < n2; i++ ) tlen *= (GET_EXP(d0,n2+i)+1);
3206: tab = (NM *)ALLOCA(tlen*sizeof(NM));
3207: psum = (NM *)ALLOCA(tlen*sizeof(NM));
3208: for ( i = 0; i < tlen; i++ ) psum[i] = 0;
1.56 noro 3209: m1 = (NMV)(((char *)BDY(p))+nmv_adv*(l-1));
3210: for ( i = l-1; i >= 0; i--, NMV_PREV(m1) ) {
1.55 noro 3211: /* m0(NM) * m1(NMV) => tab(NM) */
1.56 noro 3212: weyl_mul_nm_nmv(n,mod,m0,m1,tab,tlen);
1.55 noro 3213: for ( j = 0; j < tlen; j++ ) {
3214: if ( tab[j] ) {
3215: NEXT(tab[j]) = psum[j]; psum[j] = tab[j];
3216: }
3217: }
3218: }
3219: for ( i = tlen-1, r = 0; i >= 0; i-- )
3220: if ( psum[i] ) {
3221: for ( j = 0, t = psum[i]; t; t = NEXT(t), j++ );
3222: MKND(n,psum[i],j,s);
3223: r = nd_add(mod,r,s);
3224: }
1.56 noro 3225: if ( r ) SG(r) = SG(p)+TD(d0);
3226: return r;
1.55 noro 3227: }
3228:
1.56 noro 3229: /* product of monomials */
3230: /* XXX block order is not handled correctly */
3231:
1.55 noro 3232: void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *tab,int tlen)
3233: {
1.56 noro 3234: int i,n2,j,s,curlen,homo,h,a,b,k,l,u,min;
1.61 noro 3235: UINT *d0,*d1,*d,*dt,*ctab;
1.113 noro 3236: Q *ctab_q;
3237: Q q,q1;
1.61 noro 3238: UINT c0,c1,c;
1.55 noro 3239: NM *p;
3240: NM m,t;
3241:
3242: for ( i = 0; i < tlen; i++ ) tab[i] = 0;
3243: if ( !m0 || !m1 ) return;
3244: d0 = DL(m0); d1 = DL(m1); n2 = n>>1;
3245: NEWNM(m); d = DL(m);
1.56 noro 3246: if ( mod ) {
3247: c0 = CM(m0); c1 = CM(m1); DMAR(c0,c1,0,mod,c); CM(m) = c;
3248: } else
1.113 noro 3249: mulq(CQ(m0),CQ(m1),&CQ(m));
1.55 noro 3250: for ( i = 0; i < nd_wpd; i++ ) d[i] = 0;
3251: homo = n&1 ? 1 : 0;
3252: if ( homo ) {
3253: /* offset of h-degree */
3254: h = GET_EXP(d0,n-1)+GET_EXP(d1,n-1);
3255: PUT_EXP(DL(m),n-1,h);
3256: TD(DL(m)) = h;
1.61 noro 3257: if ( nd_blockmask ) ndl_weight_mask(DL(m));
1.55 noro 3258: }
3259: tab[0] = m;
3260: NEWNM(m); d = DL(m);
1.57 noro 3261: for ( i = 0, curlen = 1; i < n2; i++ ) {
1.55 noro 3262: a = GET_EXP(d0,i); b = GET_EXP(d1,n2+i);
3263: k = GET_EXP(d0,n2+i); l = GET_EXP(d1,i);
3264: /* xi^a*(Di^k*xi^l)*Di^b */
3265: a += l; b += k;
1.56 noro 3266: s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i);
1.55 noro 3267: if ( !k || !l ) {
3268: for ( j = 0; j < curlen; j++ )
1.56 noro 3269: if ( t = tab[j] ) {
3270: dt = DL(t);
3271: PUT_EXP(dt,i,a); PUT_EXP(dt,n2+i,b); TD(dt) += s;
1.61 noro 3272: if ( nd_blockmask ) ndl_weight_mask(dt);
1.55 noro 3273: }
3274: curlen *= k+1;
3275: continue;
3276: }
3277: min = MIN(k,l);
1.56 noro 3278: if ( mod ) {
1.61 noro 3279: ctab = (UINT *)ALLOCA((min+1)*sizeof(UINT));
1.56 noro 3280: mkwcm(k,l,mod,ctab);
3281: } else {
1.113 noro 3282: ctab_q = (Q *)ALLOCA((min+1)*sizeof(Q));
3283: mkwc(k,l,ctab_q);
1.56 noro 3284: }
1.57 noro 3285: for ( j = min; j >= 0; j-- ) {
1.56 noro 3286: for ( u = 0; u < nd_wpd; u++ ) d[u] = 0;
1.55 noro 3287: PUT_EXP(d,i,a-j); PUT_EXP(d,n2+i,b-j);
1.56 noro 3288: h = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i);
1.55 noro 3289: if ( homo ) {
3290: TD(d) = s;
1.56 noro 3291: PUT_EXP(d,n-1,s-h);
1.55 noro 3292: } else TD(d) = h;
1.61 noro 3293: if ( nd_blockmask ) ndl_weight_mask(d);
1.56 noro 3294: if ( mod ) c = ctab[j];
1.113 noro 3295: else q = ctab_q[j];
1.57 noro 3296: p = tab+curlen*j;
3297: if ( j == 0 ) {
3298: for ( u = 0; u < curlen; u++, p++ ) {
3299: if ( tab[u] ) {
3300: ndl_addto(DL(tab[u]),d);
3301: if ( mod ) {
3302: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(tab[u]) = c1;
3303: } else {
1.113 noro 3304: mulq(CQ(tab[u]),q,&q1); CQ(tab[u]) = q1;
1.57 noro 3305: }
3306: }
1.56 noro 3307: }
1.57 noro 3308: } else {
3309: for ( u = 0; u < curlen; u++, p++ ) {
3310: if ( tab[u] ) {
3311: NEWNM(t);
3312: ndl_add(DL(tab[u]),d,DL(t));
3313: if ( mod ) {
3314: c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(t) = c1;
3315: } else
1.113 noro 3316: mulq(CQ(tab[u]),q,&CQ(t));
1.57 noro 3317: *p = t;
3318: }
1.55 noro 3319: }
3320: }
3321: }
3322: curlen *= k+1;
3323: }
3324: FREENM(m);
3325: }
3326:
1.63 noro 3327: ND ndv_mul_nm_symbolic(NM m0,NDV p)
3328: {
3329: NM mr,mr0;
3330: NMV m;
3331: UINT *d,*dt,*dm;
3332: int c,n,td,i,c1,c2,len;
1.113 noro 3333: Q q;
1.63 noro 3334: ND r;
3335:
3336: if ( !p ) return 0;
3337: else {
3338: n = NV(p); m = BDY(p);
3339: d = DL(m0);
3340: len = LEN(p);
3341: mr0 = 0;
3342: td = TD(d);
3343: c = CM(m0);
3344: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3345: NEXTNM(mr0,mr);
3346: CM(mr) = 1;
3347: ndl_add(DL(m),d,DL(mr));
3348: }
3349: NEXT(mr) = 0;
3350: MKND(NV(p),mr0,len,r);
3351: SG(r) = SG(p) + TD(d);
3352: return r;
3353: }
3354: }
3355:
1.55 noro 3356: ND ndv_mul_nm(int mod,NM m0,NDV p)
1.9 noro 3357: {
3358: NM mr,mr0;
3359: NMV m;
1.61 noro 3360: UINT *d,*dt,*dm;
1.9 noro 3361: int c,n,td,i,c1,c2,len;
1.113 noro 3362: Q q;
1.9 noro 3363: ND r;
3364:
1.34 noro 3365: if ( !p ) return 0;
1.55 noro 3366: else if ( do_weyl )
1.71 noro 3367: if ( mod == -1 )
3368: error("ndv_mul_nm : not implemented (weyl)");
3369: else
3370: return weyl_ndv_mul_nm(mod,m0,p);
1.9 noro 3371: else {
3372: n = NV(p); m = BDY(p);
1.34 noro 3373: d = DL(m0);
1.14 noro 3374: len = LEN(p);
1.9 noro 3375: mr0 = 0;
1.34 noro 3376: td = TD(d);
1.71 noro 3377: if ( mod == -1 ) {
3378: c = CM(m0);
3379: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3380: NEXTNM(mr0,mr);
3381: CM(mr) = _mulsf(CM(m),c);
3382: ndl_add(DL(m),d,DL(mr));
3383: }
3384: } else if ( mod ) {
1.16 noro 3385: c = CM(m0);
3386: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3387: NEXTNM(mr0,mr);
3388: c1 = CM(m);
1.19 noro 3389: DMAR(c1,c,0,mod,c2);
1.16 noro 3390: CM(mr) = c2;
3391: ndl_add(DL(m),d,DL(mr));
3392: }
3393: } else {
1.113 noro 3394: q = CQ(m0);
1.16 noro 3395: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
3396: NEXTNM(mr0,mr);
1.113 noro 3397: mulq(CQ(m),q,&CQ(mr));
1.16 noro 3398: ndl_add(DL(m),d,DL(mr));
3399: }
1.4 noro 3400: }
1.9 noro 3401: NEXT(mr) = 0;
1.31 noro 3402: MKND(NV(p),mr0,len,r);
1.34 noro 3403: SG(r) = SG(p) + TD(d);
1.9 noro 3404: return r;
1.4 noro 3405: }
3406: }
3407:
1.104 noro 3408: ND nd_quo(int mod,PGeoBucket bucket,NDV d)
1.99 noro 3409: {
3410: NM mq0,mq;
1.102 noro 3411: NMV tm;
1.113 noro 3412: Q q;
1.104 noro 3413: int i,nv,sg,c,c1,c2,hindex;
3414: ND p,t,r;
3415: N tnm;
3416:
1.99 noro 3417: if ( !p ) return 0;
3418: else {
1.104 noro 3419: nv = NV(d);
1.99 noro 3420: mq0 = 0;
1.102 noro 3421: tm = (NMV)ALLOCA(nmv_adv);
1.104 noro 3422: while ( 1 ) {
1.113 noro 3423: hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket);
1.104 noro 3424: if ( hindex < 0 ) break;
3425: p = bucket->body[hindex];
1.99 noro 3426: NEXTNM(mq0,mq);
3427: ndl_sub(HDL(p),HDL(d),DL(mq));
1.102 noro 3428: ndl_copy(DL(mq),DL(tm));
3429: if ( mod ) {
3430: c1 = invm(HCM(d),mod); c2 = HCM(p);
3431: DMAR(c1,c2,0,mod,c); CM(mq) = c;
3432: CM(tm) = mod-c;
3433: } else {
1.113 noro 3434: divsn(NM(HCQ(p)),NM(HCQ(d)),&tnm);
3435: NTOQ(tnm,SGN(HCQ(p))*SGN(HCQ(d)),CQ(mq));
3436: chsgnq(CQ(mq),&CQ(tm));
1.102 noro 3437: }
3438: t = ndv_mul_nmv_trunc(mod,tm,d,HDL(d));
1.104 noro 3439: bucket->body[hindex] = nd_remove_head(p);
3440: t = nd_remove_head(t);
3441: add_pbucket(mod,bucket,t);
3442: }
3443: if ( !mq0 )
3444: r = 0;
3445: else {
3446: NEXT(mq) = 0;
3447: for ( i = 0, mq = mq0; mq; mq = NEXT(mq), i++ );
3448: MKND(nv,mq0,i,r);
3449: /* XXX */
3450: SG(r) = HTD(r);
1.99 noro 3451: }
3452: return r;
3453: }
3454: }
3455:
1.43 noro 3456: void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos)
1.11 noro 3457: {
1.13 noro 3458: NMV m,mr,mr0,t;
3459: int len,i,k;
1.11 noro 3460:
1.61 noro 3461: if ( !p ) return;
3462: m = BDY(p); len = LEN(p);
3463: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
3464: m = (NMV)((char *)mr0+(len-1)*oadv);
3465: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
3466: t = (NMV)ALLOCA(nmv_adv);
3467: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
1.113 noro 3468: CQ(t) = CQ(m);
1.61 noro 3469: for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0;
3470: ndl_reconstruct(DL(m),DL(t),obpe,oepos);
1.113 noro 3471: CQ(mr) = CQ(t);
1.61 noro 3472: ndl_copy(DL(t),DL(mr));
3473: }
3474: BDY(p) = mr0;
3475: }
3476:
3477: NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos)
3478: {
3479: NMV m,mr,mr0;
3480: int len,i;
3481: NDV r;
1.11 noro 3482:
1.61 noro 3483: if ( !p ) return 0;
3484: m = BDY(p); len = LEN(p);
3485: mr0 = mr = (NMV)MALLOC(len*nmv_adv);
3486: for ( i = 0; i < len; i++, NMV_OADV(m), NMV_ADV(mr) ) {
3487: ndl_zero(DL(mr));
3488: ndl_reconstruct(DL(m),DL(mr),obpe,oepos);
1.113 noro 3489: CQ(mr) = CQ(m);
1.11 noro 3490: }
1.61 noro 3491: MKNDV(NV(p),mr0,len,r);
3492: SG(r) = SG(p);
3493: return r;
1.11 noro 3494: }
3495:
1.61 noro 3496: /* duplicate p */
3497:
3498: NDV ndv_dup(int mod,NDV p)
1.3 noro 3499: {
3500: NDV d;
1.61 noro 3501: NMV t,m,m0;
1.3 noro 3502: int i,len;
3503:
1.34 noro 3504: if ( !p ) return 0;
1.31 noro 3505: len = LEN(p);
1.34 noro 3506: m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv));
1.61 noro 3507: for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) {
1.14 noro 3508: ndl_copy(DL(t),DL(m));
1.113 noro 3509: CQ(m) = CQ(t);
1.3 noro 3510: }
3511: MKNDV(NV(p),m0,len,d);
1.23 noro 3512: SG(d) = SG(p);
3513: return d;
3514: }
3515:
1.63 noro 3516: ND nd_dup(ND p)
3517: {
3518: ND d;
3519: NM t,m,m0;
3520:
3521: if ( !p ) return 0;
3522: for ( m0 = 0, t = BDY(p); t; t = NEXT(t) ) {
3523: NEXTNM(m0,m);
3524: ndl_copy(DL(t),DL(m));
1.113 noro 3525: CQ(m) = CQ(t);
1.63 noro 3526: }
3527: if ( m0 ) NEXT(m) = 0;
3528: MKND(NV(p),m0,LEN(p),d);
3529: SG(d) = SG(p);
3530: return d;
3531: }
3532:
1.61 noro 3533: /* XXX if p->len == 0 then it represents 0 */
3534:
3535: void ndv_mod(int mod,NDV p)
3536: {
3537: NMV t,d;
3538: int r;
3539: int i,len,dlen;
1.71 noro 3540: Obj gfs;
1.61 noro 3541:
3542: if ( !p ) return;
3543: len = LEN(p);
3544: dlen = 0;
1.71 noro 3545: if ( mod == -1 )
3546: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
3547: simp_ff((Obj)CP(t),&gfs);
3548: r = FTOIF(CONT((GFS)gfs));
1.61 noro 3549: CM(d) = r;
3550: ndl_copy(DL(t),DL(d));
3551: NMV_ADV(d);
3552: dlen++;
3553: }
1.71 noro 3554: else
3555: for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
1.113 noro 3556: r = rem(NM(CQ(t)),mod);
1.71 noro 3557: if ( r ) {
1.113 noro 3558: if ( SGN(CQ(t)) < 0 )
3559: r = mod-r;
1.71 noro 3560: CM(d) = r;
3561: ndl_copy(DL(t),DL(d));
3562: NMV_ADV(d);
3563: dlen++;
3564: }
3565: }
1.61 noro 3566: LEN(p) = dlen;
3567: }
3568:
3569: NDV ptondv(VL vl,VL dvl,P p)
3570: {
3571: ND nd;
3572:
3573: nd = ptond(vl,dvl,p);
3574: return ndtondv(0,nd);
3575: }
3576:
3577: ND ptond(VL vl,VL dvl,P p)
1.23 noro 3578: {
1.61 noro 3579: int n,i,j,k,e;
3580: VL tvl;
3581: V v;
3582: DCP dc;
3583: DCP *w;
3584: ND r,s,t,u;
3585: P x;
3586: int c;
3587: UINT *d;
1.23 noro 3588: NM m,m0;
1.61 noro 3589:
3590: if ( !p )
3591: return 0;
3592: else if ( NUM(p) ) {
3593: NEWNM(m);
3594: ndl_zero(DL(m));
1.113 noro 3595: CQ(m) = (Q)p;
1.61 noro 3596: NEXT(m) = 0;
3597: MKND(nd_nvar,m,1,r);
3598: SG(r) = 0;
3599: return r;
3600: } else {
3601: for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ );
3602: w = (DCP *)ALLOCA(k*sizeof(DCP));
3603: for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ ) w[j] = dc;
3604: for ( i = 0, tvl = dvl, v = VR(p);
1.98 noro 3605: tvl && tvl->v != v; tvl = NEXT(tvl), i++ );
1.61 noro 3606: if ( !tvl ) {
3607: for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) {
3608: t = ptond(vl,dvl,COEF(w[j]));
3609: pwrp(vl,x,DEG(w[j]),&p);
3610: nd_mul_c_p(CO,t,p); s = nd_add(0,s,t);
3611: }
3612: return s;
3613: } else {
3614: NEWNM(m0); d = DL(m0);
3615: for ( j = k-1, s = 0; j >= 0; j-- ) {
3616: ndl_zero(d); e = QTOS(DEG(w[j])); PUT_EXP(d,i,e);
3617: TD(d) = MUL_WEIGHT(e,i);
3618: if ( nd_blockmask) ndl_weight_mask(d);
3619: t = ptond(vl,dvl,COEF(w[j]));
3620: for ( m = BDY(t); m; m = NEXT(m) )
3621: ndl_addto(DL(m),d);
3622: SG(t) += TD(d);
3623: s = nd_add(0,s,t);
3624: }
3625: FREENM(m0);
3626: return s;
3627: }
3628: }
3629: }
3630:
3631: P ndvtop(int mod,VL vl,VL dvl,NDV p)
3632: {
3633: VL tvl;
3634: int len,n,j,i,e;
3635: NMV m;
3636: Q q;
3637: P c;
3638: UINT *d;
3639: P s,r,u,t,w;
1.71 noro 3640: GFS gfs;
1.23 noro 3641:
1.34 noro 3642: if ( !p ) return 0;
1.61 noro 3643: else {
3644: len = LEN(p);
3645: n = NV(p);
3646: m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1));
3647: for ( j = len-1, s = 0; j >= 0; j--, NMV_PREV(m) ) {
1.71 noro 3648: if ( mod == -1 ) {
3649: e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs;
3650: } else if ( mod ) {
1.61 noro 3651: STOQ(CM(m),q); c = (P)q;
3652: } else
1.113 noro 3653: c = CP(m);
1.61 noro 3654: d = DL(m);
3655: for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) {
3656: MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q);
3657: pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w;
3658: }
3659: addp(vl,s,t,&u); s = u;
3660: }
3661: return s;
1.23 noro 3662: }
1.3 noro 3663: }
3664:
1.61 noro 3665: NDV ndtondv(int mod,ND p)
1.11 noro 3666: {
3667: NDV d;
1.61 noro 3668: NMV m,m0;
3669: NM t;
3670: int i,len;
1.11 noro 3671:
1.34 noro 3672: if ( !p ) return 0;
1.61 noro 3673: len = LEN(p);
1.74 noro 3674: if ( mod )
3675: m0 = m = (NMV)GC_malloc_atomic_ignore_off_page(len*nmv_adv);
3676: else
3677: m0 = m = MALLOC(len*nmv_adv);
1.103 noro 3678: #if 0
1.74 noro 3679: ndv_alloc += nmv_adv*len;
1.103 noro 3680: #endif
1.61 noro 3681: for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) {
3682: ndl_copy(DL(t),DL(m));
1.113 noro 3683: CQ(m) = CQ(t);
1.11 noro 3684: }
1.61 noro 3685: MKNDV(NV(p),m0,len,d);
1.14 noro 3686: SG(d) = SG(p);
1.11 noro 3687: return d;
3688: }
3689:
1.61 noro 3690: ND ndvtond(int mod,NDV p)
1.11 noro 3691: {
1.61 noro 3692: ND d;
3693: NM m,m0;
1.11 noro 3694: NMV t;
1.61 noro 3695: int i,len;
1.11 noro 3696:
1.34 noro 3697: if ( !p ) return 0;
1.11 noro 3698: m0 = 0;
1.61 noro 3699: len = p->len;
3700: for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) {
3701: NEXTNM(m0,m);
3702: ndl_copy(DL(t),DL(m));
1.113 noro 3703: CQ(m) = CQ(t);
1.11 noro 3704: }
3705: NEXT(m) = 0;
1.61 noro 3706: MKND(NV(p),m0,len,d);
1.14 noro 3707: SG(d) = SG(p);
1.11 noro 3708: return d;
3709: }
3710:
1.3 noro 3711: void ndv_print(NDV p)
3712: {
3713: NMV m;
3714: int i,len;
3715:
1.34 noro 3716: if ( !p ) printf("0\n");
1.3 noro 3717: else {
1.14 noro 3718: len = LEN(p);
1.3 noro 3719: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
1.71 noro 3720: if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m)));
3721: else printf("+%d*",CM(m));
1.16 noro 3722: ndl_print(DL(m));
3723: }
3724: printf("\n");
3725: }
3726: }
3727:
1.113 noro 3728: void ndv_print_q(NDV p)
1.16 noro 3729: {
3730: NMV m;
3731: int i,len;
3732:
1.34 noro 3733: if ( !p ) printf("0\n");
1.16 noro 3734: else {
3735: len = LEN(p);
3736: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
3737: printf("+");
1.113 noro 3738: printexpr(CO,(Obj)CQ(m));
1.16 noro 3739: printf("*");
1.14 noro 3740: ndl_print(DL(m));
1.3 noro 3741: }
3742: printf("\n");
3743: }
1.25 noro 3744: }
3745:
1.61 noro 3746: NODE ndv_reducebase(NODE x)
1.27 noro 3747: {
3748: int len,i,j;
3749: NDV *w;
3750: NODE t,t0;
3751:
3752: len = length(x);
3753: w = (NDV *)ALLOCA(len*sizeof(NDV));
3754: for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t);
3755: for ( i = 0; i < len; i++ ) {
3756: for ( j = 0; j < i; j++ ) {
3757: if ( w[i] && w[j] )
3758: if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0;
3759: else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0;
3760: }
3761: }
3762: for ( i = len-1, t0 = 0; i >= 0; i-- ) {
3763: if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; }
3764: }
3765: NEXT(t) = 0; x = t0;
3766: return x;
1.11 noro 3767: }
1.32 noro 3768:
1.43 noro 3769: /* XXX incomplete */
3770:
1.32 noro 3771: void nd_init_ord(struct order_spec *ord)
3772: {
1.43 noro 3773: switch ( ord->id ) {
1.32 noro 3774: case 0:
1.43 noro 3775: switch ( ord->ord.simple ) {
3776: case 0:
3777: nd_dcomp = 1;
3778: nd_isrlex = 1;
3779: break;
3780: case 1:
3781: nd_dcomp = 1;
3782: nd_isrlex = 0;
3783: break;
3784: case 2:
3785: nd_dcomp = 0;
3786: nd_isrlex = 0;
1.45 noro 3787: ndl_compare_function = ndl_lex_compare;
1.58 noro 3788: break;
3789: case 11:
3790: /* XXX */
3791: nd_dcomp = 0;
3792: nd_isrlex = 1;
3793: ndl_compare_function = ndl_ww_lex_compare;
1.43 noro 3794: break;
3795: default:
3796: error("nd_gr : unsupported order");
3797: }
1.32 noro 3798: break;
3799: case 1:
1.96 noro 3800: /* block order */
1.43 noro 3801: /* XXX */
3802: nd_dcomp = -1;
1.32 noro 3803: nd_isrlex = 0;
1.45 noro 3804: ndl_compare_function = ndl_block_compare;
1.34 noro 3805: break;
1.43 noro 3806: case 2:
1.96 noro 3807: /* matrix order */
3808: /* XXX */
3809: nd_dcomp = -1;
3810: nd_isrlex = 0;
3811: nd_matrix_len = ord->ord.matrix.row;
3812: nd_matrix = ord->ord.matrix.matrix;
3813: ndl_compare_function = ndl_matrix_compare;
3814: break;
3815: case 3:
1.97 noro 3816: /* composite order */
3817: nd_dcomp = -1;
3818: nd_isrlex = 0;
3819: nd_worb_len = ord->ord.composite.length;
3820: nd_worb = ord->ord.composite.w_or_b;
3821: ndl_compare_function = ndl_composite_compare;
1.32 noro 3822: break;
3823: }
1.41 noro 3824: nd_ord = ord;
1.32 noro 3825: }
3826:
1.43 noro 3827: BlockMask nd_create_blockmask(struct order_spec *ord)
3828: {
3829: int n,i,j,s,l;
1.61 noro 3830: UINT *t;
1.43 noro 3831: BlockMask bm;
3832:
1.96 noro 3833: /* we only create mask table for block order */
3834: if ( ord->id != 1 )
1.43 noro 3835: return 0;
3836: n = ord->ord.block.length;
3837: bm = (BlockMask)MALLOC(sizeof(struct oBlockMask));
3838: bm->n = n;
3839: bm->order_pair = ord->ord.block.order_pair;
1.61 noro 3840: bm->mask = (UINT **)MALLOC(n*sizeof(UINT *));
1.43 noro 3841: for ( i = 0, s = 0; i < n; i++ ) {
1.61 noro 3842: bm->mask[i] = t = (UINT *)MALLOC_ATOMIC(nd_wpd*sizeof(UINT));
1.43 noro 3843: for ( j = 0; j < nd_wpd; j++ ) t[j] = 0;
3844: l = bm->order_pair[i].length;
3845: for ( j = 0; j < l; j++, s++ ) PUT_EXP(t,s,nd_mask0);
3846: }
3847: return bm;
1.57 noro 3848: }
3849:
3850: EPOS nd_create_epos(struct order_spec *ord)
3851: {
3852: int i,j,l,s,ord_l,ord_o;
3853: EPOS epos;
3854: struct order_pair *op;
3855:
3856: epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS));
3857: switch ( ord->id ) {
3858: case 0:
3859: if ( nd_isrlex ) {
3860: for ( i = 0; i < nd_nvar; i++ ) {
3861: epos[i].i = nd_exporigin + (nd_nvar-1-i)/nd_epw;
3862: epos[i].s = (nd_epw-((nd_nvar-1-i)%nd_epw)-1)*nd_bpe;
3863: }
3864: } else {
3865: for ( i = 0; i < nd_nvar; i++ ) {
3866: epos[i].i = nd_exporigin + i/nd_epw;
3867: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
3868: }
3869: }
3870: break;
3871: case 1:
3872: /* block order */
3873: l = ord->ord.block.length;
3874: op = ord->ord.block.order_pair;
3875: for ( j = 0, s = 0; j < l; j++ ) {
3876: ord_o = op[j].order;
3877: ord_l = op[j].length;
3878: if ( !ord_o )
3879: for ( i = 0; i < ord_l; i++ ) {
3880: epos[s+i].i = nd_exporigin + (s+ord_l-i-1)/nd_epw;
3881: epos[s+i].s = (nd_epw-((s+ord_l-i-1)%nd_epw)-1)*nd_bpe;
3882: }
3883: else
3884: for ( i = 0; i < ord_l; i++ ) {
3885: epos[s+i].i = nd_exporigin + (s+i)/nd_epw;
3886: epos[s+i].s = (nd_epw-((s+i)%nd_epw)-1)*nd_bpe;
3887: }
3888: s += ord_l;
3889: }
3890: break;
3891: case 2:
1.96 noro 3892: /* matrix order */
3893: case 3:
3894: /* composite order */
3895: for ( i = 0; i < nd_nvar; i++ ) {
3896: epos[i].i = nd_exporigin + i/nd_epw;
3897: epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
3898: }
3899: break;
1.57 noro 3900: }
3901: return epos;
1.43 noro 3902: }
1.59 noro 3903:
3904: /* external interface */
3905:
3906: void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec *ord,P *rp)
3907: {
1.61 noro 3908: NODE t,in0,in;
1.59 noro 3909: ND nd,nf;
1.61 noro 3910: NDV ndv;
3911: VL vv,tv;
3912: int stat,nvar,max,e;
1.113 noro 3913: union oNDC dn;
1.59 noro 3914:
1.116 noro 3915: if ( !f ) {
3916: *rp = 0;
3917: return;
3918: }
1.59 noro 3919: pltovl(v,&vv);
1.74 noro 3920: for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );
1.61 noro 3921:
3922: /* get the degree bound */
3923: for ( t = BDY(g), max = 0; t; t = NEXT(t) )
3924: for ( tv = vv; tv; tv = NEXT(tv) ) {
3925: e = getdeg(tv->v,(P)BDY(t));
3926: max = MAX(e,max);
3927: }
3928: for ( tv = vv; tv; tv = NEXT(tv) ) {
3929: e = getdeg(tv->v,f);
3930: max = MAX(e,max);
3931: }
3932:
1.59 noro 3933: nd_init_ord(ord);
1.61 noro 3934: nd_setup_parameters(nvar,max);
3935:
3936: /* conversion to ndv */
3937: for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) {
3938: NEXTNODE(in0,in);
3939: BDY(in) = (pointer)ptondv(CO,vv,(P)BDY(t));
1.69 noro 3940: if ( m ) ndv_mod(m,(NDV)BDY(in));
1.61 noro 3941: }
3942: NEXTNODE(in0,in);
3943: BDY(in) = (pointer)ptondv(CO,vv,f);
1.69 noro 3944: if ( m ) ndv_mod(m,(NDV)BDY(in));
1.61 noro 3945: NEXT(in) = 0;
3946:
3947: ndv_setup(m,0,in0);
1.59 noro 3948: nd_psn--;
3949: nd_scale=2;
3950: while ( 1 ) {
3951: nd = (pointer)ndvtond(m,nd_ps[nd_psn]);
1.69 noro 3952: stat = nd_nf(m,nd,nd_ps,1,0,&nf);
1.59 noro 3953: if ( !stat ) {
3954: nd_psn++;
1.103 noro 3955: nd_reconstruct(0,0);
1.59 noro 3956: nd_psn--;
3957: } else
3958: break;
3959: }
1.61 noro 3960: *rp = ndvtop(m,CO,vv,ndtondv(m,nf));
1.63 noro 3961: }
3962:
3963: int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r)
3964: {
3965: NM m;
3966: UINT *t,*s;
3967: int i;
3968:
3969: for ( i = 0; i < n; i++ ) r[i] = 0;
3970: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
3971: t = DL(m);
3972: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
3973: r[i] = CM(m);
3974: }
3975: for ( i = 0; !r[i]; i++ );
3976: return i;
3977: }
3978:
1.113 noro 3979: int nd_to_vect_q(UINT *s0,int n,ND d,Q *r)
1.74 noro 3980: {
1.107 noro 3981: NM m;
1.74 noro 3982: UINT *t,*s;
1.107 noro 3983: int i;
1.74 noro 3984:
3985: for ( i = 0; i < n; i++ ) r[i] = 0;
1.107 noro 3986: for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) {
1.74 noro 3987: t = DL(m);
3988: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
1.113 noro 3989: r[i] = CQ(m);
1.74 noro 3990: }
3991: for ( i = 0; !r[i]; i++ );
3992: return i;
3993: }
3994:
1.67 noro 3995: IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0,int n,NM_ind_pair pair)
1.64 noro 3996: {
3997: NM m;
3998: NMV mr;
3999: UINT *d,*t,*s;
4000: NDV p;
1.67 noro 4001: unsigned char *ivc;
4002: unsigned short *ivs;
1.81 noro 4003: UINT *v,*ivi,*s0v;
1.67 noro 4004: int i,j,len,prev,diff,cdiff;
4005: IndArray r;
1.64 noro 4006:
4007: m = pair->mul;
4008: d = DL(m);
4009: p = nd_ps[pair->index];
4010: len = LEN(p);
4011: t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
1.67 noro 4012: v = (unsigned int *)ALLOCA(len*sizeof(unsigned int));
1.64 noro 4013: for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) {
4014: ndl_add(d,DL(mr),t);
4015: for ( ; !ndl_equal(t,s); s += nd_wpd, i++ );
1.67 noro 4016: v[j] = i;
4017: }
1.81 noro 4018: r = (IndArray)MALLOC(sizeof(struct oIndArray));
1.67 noro 4019: r->head = v[0];
4020: diff = 0;
4021: for ( i = 1; i < len; i++ ) {
4022: cdiff = v[i]-v[i-1]; diff = MAX(cdiff,diff);
4023: }
4024: if ( diff < 256 ) {
4025: r->width = 1;
4026: ivc = (unsigned char *)MALLOC_ATOMIC(len*sizeof(unsigned char));
4027: r->index.c = ivc;
4028: for ( i = 1, ivc[0] = 0; i < len; i++ ) ivc[i] = v[i]-v[i-1];
4029: } else if ( diff < 65536 ) {
4030: r->width = 2;
4031: ivs = (unsigned short *)MALLOC_ATOMIC(len*sizeof(unsigned short));
4032: r->index.s = ivs;
4033: for ( i = 1, ivs[0] = 0; i < len; i++ ) ivs[i] = v[i]-v[i-1];
4034: } else {
4035: r->width = 4;
4036: ivi = (unsigned int *)MALLOC_ATOMIC(len*sizeof(unsigned int));
4037: r->index.i = ivi;
4038: for ( i = 1, ivi[0] = 0; i < len; i++ ) ivi[i] = v[i]-v[i-1];
1.64 noro 4039: }
1.67 noro 4040: return r;
1.64 noro 4041: }
4042:
1.65 noro 4043:
1.113 noro 4044: int ndv_reduce_vect_q(Q *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.107 noro 4045: {
4046: int i,j,k,len,pos,prev;
1.113 noro 4047: Q cs,mcs,c1,c2,cr,gcd,t;
1.107 noro 4048: IndArray ivect;
4049: unsigned char *ivc;
4050: unsigned short *ivs;
4051: unsigned int *ivi;
4052: NDV redv;
4053: NMV mr;
4054: NODE rp;
4055: int maxrs;
4056:
4057: maxrs = 0;
4058: for ( i = 0; i < nred; i++ ) {
4059: ivect = imat[i];
4060: k = ivect->head;
4061: if ( svect[k] ) {
4062: maxrs = MAX(maxrs,rp0[i]->sugar);
4063: redv = nd_ps[rp0[i]->index];
4064: len = LEN(redv); mr = BDY(redv);
1.113 noro 4065: igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr);
4066: chsgnq(cs,&mcs);
4067: if ( !UNIQ(cr) ) {
4068: for ( j = 0; j < col; j++ ) {
4069: mulq(svect[j],cr,&c1); svect[j] = c1;
4070: }
4071: }
1.107 noro 4072: svect[k] = 0; prev = k;
4073: switch ( ivect->width ) {
4074: case 1:
4075: ivc = ivect->index.c;
4076: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4077: pos = prev+ivc[j]; prev = pos;
1.113 noro 4078: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
1.107 noro 4079: }
4080: break;
4081: case 2:
4082: ivs = ivect->index.s;
4083: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4084: pos = prev+ivs[j]; prev = pos;
1.113 noro 4085: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
1.107 noro 4086: }
4087: break;
4088: case 4:
4089: ivi = ivect->index.i;
4090: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4091: pos = prev+ivi[j]; prev = pos;
1.113 noro 4092: mulq(CQ(mr),mcs,&c2); addq(svect[pos],c2,&t); svect[pos] = t;
1.107 noro 4093: }
4094: break;
4095: }
4096: }
4097: }
4098: return maxrs;
4099: }
4100:
1.76 noro 4101: int ndv_reduce_vect(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.65 noro 4102: {
1.67 noro 4103: int i,j,k,len,pos,prev;
1.66 noro 4104: UINT c,c1,c2,c3,up,lo,dmy;
1.67 noro 4105: IndArray ivect;
4106: unsigned char *ivc;
4107: unsigned short *ivs;
4108: unsigned int *ivi;
1.65 noro 4109: NDV redv;
1.67 noro 4110: NMV mr;
1.65 noro 4111: NODE rp;
1.76 noro 4112: int maxrs;
1.65 noro 4113:
1.76 noro 4114: maxrs = 0;
1.74 noro 4115: for ( i = 0; i < nred; i++ ) {
1.65 noro 4116: ivect = imat[i];
1.67 noro 4117: k = ivect->head; svect[k] %= m;
1.65 noro 4118: if ( c = svect[k] ) {
1.76 noro 4119: maxrs = MAX(maxrs,rp0[i]->sugar);
1.74 noro 4120: c = m-c; redv = nd_ps[rp0[i]->index];
1.67 noro 4121: len = LEN(redv); mr = BDY(redv);
4122: svect[k] = 0; prev = k;
4123: switch ( ivect->width ) {
4124: case 1:
4125: ivc = ivect->index.c;
4126: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4127: pos = prev+ivc[j]; c1 = CM(mr); c2 = svect[pos];
4128: prev = pos;
4129: DMA(c1,c,c2,up,lo);
4130: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
4131: } else svect[pos] = lo;
4132: }
4133: break;
4134: case 2:
4135: ivs = ivect->index.s;
4136: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4137: pos = prev+ivs[j]; c1 = CM(mr); c2 = svect[pos];
4138: prev = pos;
4139: DMA(c1,c,c2,up,lo);
4140: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
4141: } else svect[pos] = lo;
4142: }
4143: break;
4144: case 4:
4145: ivi = ivect->index.i;
4146: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4147: pos = prev+ivi[j]; c1 = CM(mr); c2 = svect[pos];
4148: prev = pos;
4149: DMA(c1,c,c2,up,lo);
4150: if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3;
4151: } else svect[pos] = lo;
4152: }
4153: break;
1.65 noro 4154: }
4155: }
4156: }
1.66 noro 4157: for ( i = 0; i < col; i++ )
4158: if ( svect[i] >= (UINT)m ) svect[i] %= m;
1.76 noro 4159: return maxrs;
1.65 noro 4160: }
4161:
1.76 noro 4162: int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred)
1.72 noro 4163: {
4164: int i,j,k,len,pos,prev;
4165: UINT c,c1,c2,c3,up,lo,dmy;
4166: IndArray ivect;
4167: unsigned char *ivc;
4168: unsigned short *ivs;
4169: unsigned int *ivi;
4170: NDV redv;
4171: NMV mr;
4172: NODE rp;
1.76 noro 4173: int maxrs;
1.72 noro 4174:
1.76 noro 4175: maxrs = 0;
1.74 noro 4176: for ( i = 0; i < nred; i++ ) {
1.72 noro 4177: ivect = imat[i];
4178: k = ivect->head; svect[k] %= m;
4179: if ( c = svect[k] ) {
1.76 noro 4180: maxrs = MAX(maxrs,rp0[i]->sugar);
1.74 noro 4181: c = _chsgnsf(c); redv = nd_ps[rp0[i]->index];
1.72 noro 4182: len = LEN(redv); mr = BDY(redv);
4183: svect[k] = 0; prev = k;
4184: switch ( ivect->width ) {
4185: case 1:
4186: ivc = ivect->index.c;
4187: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4188: pos = prev+ivc[j]; prev = pos;
4189: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
4190: }
4191: break;
4192: case 2:
4193: ivs = ivect->index.s;
4194: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4195: pos = prev+ivs[j]; prev = pos;
4196: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
4197: }
4198: break;
4199: case 4:
4200: ivi = ivect->index.i;
4201: for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) {
4202: pos = prev+ivi[j]; prev = pos;
4203: svect[pos] = _addsf(_mulsf(CM(mr),c),svect[pos]);
4204: }
4205: break;
4206: }
4207: }
4208: }
1.76 noro 4209: return maxrs;
1.72 noro 4210: }
4211:
1.65 noro 4212: NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhead,UINT *s0vect)
4213: {
4214: int j,k,len;
4215: UINT *p;
4216: UINT c;
4217: NDV r;
4218: NMV mr0,mr;
4219:
4220: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
4221: if ( !len ) return 0;
4222: else {
1.74 noro 4223: mr0 = (NMV)GC_malloc_atomic_ignore_off_page(nmv_adv*len);
1.103 noro 4224: #if 0
1.74 noro 4225: ndv_alloc += nmv_adv*len;
1.103 noro 4226: #endif
1.65 noro 4227: mr = mr0;
4228: p = s0vect;
4229: for ( j = k = 0; j < col; j++, p += nd_wpd )
4230: if ( !rhead[j] ) {
4231: if ( c = vect[k++] ) {
4232: ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr);
4233: }
4234: }
4235: MKNDV(nd_nvar,mr0,len,r);
4236: return r;
4237: }
4238: }
4239:
1.113 noro 4240: NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead,UINT *s0vect)
1.107 noro 4241: {
4242: int j,k,len;
4243: UINT *p;
1.113 noro 4244: Q c;
1.107 noro 4245: NDV r;
4246: NMV mr0,mr;
4247:
4248: for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++;
4249: if ( !len ) return 0;
4250: else {
1.109 noro 4251: mr0 = (NMV)GC_malloc(nmv_adv*len);
1.107 noro 4252: #if 0
4253: ndv_alloc += nmv_adv*len;
4254: #endif
4255: mr = mr0;
4256: p = s0vect;
4257: for ( j = k = 0; j < col; j++, p += nd_wpd )
4258: if ( !rhead[j] ) {
4259: if ( c = vect[k++] ) {
1.113 noro 4260: if ( DN(c) )
4261: error("afo");
4262: ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr);
1.107 noro 4263: }
4264: }
4265: MKNDV(nd_nvar,mr0,len,r);
4266: return r;
4267: }
4268: }
4269:
1.74 noro 4270: int nd_sp_f4(int m,ND_pairs l,PGeoBucket bucket)
1.65 noro 4271: {
4272: ND_pairs t;
4273: NODE sp0,sp;
4274: int stat;
4275: ND spol;
4276:
4277: for ( t = l; t; t = NEXT(t) ) {
4278: stat = nd_sp(m,0,t,&spol);
4279: if ( !stat ) return 0;
4280: if ( spol ) {
4281: add_pbucket_symbolic(bucket,spol);
4282: }
4283: }
1.68 noro 4284: return 1;
1.65 noro 4285: }
4286:
4287: int nd_symbolic_preproc(PGeoBucket bucket,UINT **s0vect,NODE *r)
4288: {
4289: NODE rp0,rp;
4290: NM mul,head,s0,s;
1.76 noro 4291: int index,col,i,sugar;
1.65 noro 4292: RHist h;
4293: UINT *s0v,*p;
4294: NM_ind_pair pair;
4295: ND red;
4296:
4297: s0 = 0; rp0 = 0; col = 0;
4298: while ( 1 ) {
4299: head = remove_head_pbucket_symbolic(bucket);
4300: if ( !head ) break;
4301: if ( !s0 ) s0 = head;
4302: else NEXT(s) = head;
4303: s = head;
4304: index = ndl_find_reducer(DL(head));
4305: if ( index >= 0 ) {
4306: h = nd_psh[index];
4307: NEWNM(mul);
4308: ndl_sub(DL(head),DL(h),DL(mul));
4309: if ( ndl_check_bound2(index,DL(mul)) ) return 0;
1.76 noro 4310: sugar = TD(DL(mul))+SG(nd_ps[index]);
4311: MKNM_ind_pair(pair,mul,index,sugar);
1.65 noro 4312: red = ndv_mul_nm_symbolic(mul,nd_ps[index]);
4313: add_pbucket_symbolic(bucket,nd_remove_head(red));
4314: NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair;
4315: }
4316: col++;
4317: }
1.72 noro 4318: if ( rp0 ) NEXT(rp) = 0;
4319: NEXT(s) = 0;
1.65 noro 4320: s0v = (UINT *)MALLOC_ATOMIC(col*nd_wpd*sizeof(UINT));
4321: for ( i = 0, p = s0v, s = s0; i < col;
4322: i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p);
4323: *s0vect = s0v;
4324: *r = rp0;
4325: return col;
4326: }
4327:
1.69 noro 4328: NODE nd_f4(int m)
4329: {
4330: int i,nh,stat,index;
4331: NODE r,g;
4332: ND_pairs d,l,t;
4333: ND spol,red;
4334: NDV nf,redv;
4335: NM s0,s;
1.84 noro 4336: NODE rp0,srp0,nflist;
1.69 noro 4337: int nsp,nred,col,rank,len,k,j,a;
4338: UINT c;
1.74 noro 4339: UINT **spmat;
1.69 noro 4340: UINT *s0vect,*svect,*p,*v;
4341: int *colstat;
4342: IndArray *imat;
4343: int *rhead;
4344: int spcol,sprow;
4345: int sugar;
4346: PGeoBucket bucket;
4347: struct oEGT eg0,eg1,eg_f4;
4348:
1.103 noro 4349: #if 0
1.74 noro 4350: ndv_alloc = 0;
1.103 noro 4351: #endif
1.69 noro 4352: g = 0; d = 0;
4353: for ( i = 0; i < nd_psn; i++ ) {
4354: d = update_pairs(d,g,i);
4355: g = update_base(g,i);
4356: }
4357: while ( d ) {
4358: get_eg(&eg0);
4359: l = nd_minsugarp(d,&d);
4360: sugar = SG(l);
4361: bucket = create_pbucket();
1.74 noro 4362: stat = nd_sp_f4(m,l,bucket);
1.69 noro 4363: if ( !stat ) {
4364: for ( t = l; NEXT(t); t = NEXT(t) );
4365: NEXT(t) = d; d = l;
1.103 noro 4366: d = nd_reconstruct(0,d);
1.69 noro 4367: continue;
4368: }
1.86 noro 4369: if ( bucket->m < 0 ) continue;
1.69 noro 4370: col = nd_symbolic_preproc(bucket,&s0vect,&rp0);
4371: if ( !col ) {
4372: for ( t = l; NEXT(t); t = NEXT(t) );
4373: NEXT(t) = d; d = l;
1.103 noro 4374: d = nd_reconstruct(0,d);
1.69 noro 4375: continue;
4376: }
4377: get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1);
1.74 noro 4378: if ( DP_Print )
4379: fprintf(asir_out,"sugar=%d,symb=%fsec,",
4380: sugar,eg_f4.exectime+eg_f4.gctime);
4381: if ( 1 )
4382: nflist = nd_f4_red(m,l,s0vect,col,rp0);
4383: else
4384: nflist = nd_f4_red_dist(m,l,s0vect,col,rp0);
1.69 noro 4385: /* adding new bases */
1.74 noro 4386: for ( r = nflist; r; r = NEXT(r) ) {
4387: nf = (NDV)BDY(r);
1.69 noro 4388: ndv_removecont(m,nf);
1.77 noro 4389: nh = ndv_newps(m,nf,0);
1.69 noro 4390: d = update_pairs(d,g,nh);
4391: g = update_base(g,nh);
4392: }
4393: }
4394: for ( r = g; r; r = NEXT(r) ) BDY(r) = (pointer)nd_ps[(int)BDY(r)];
1.103 noro 4395: #if 0
1.74 noro 4396: fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc);
1.103 noro 4397: #endif
1.69 noro 4398: return g;
4399: }
1.74 noro 4400:
4401: NODE nd_f4_red(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0)
1.63 noro 4402: {
1.67 noro 4403: IndArray *imat;
1.106 noro 4404: int nsp,nred,i;
1.65 noro 4405: int *rhead;
1.106 noro 4406: NODE r0,rp;
1.74 noro 4407: ND_pairs sp;
4408: NM_ind_pair *rvect;
1.63 noro 4409:
1.74 noro 4410: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
1.106 noro 4411: nred = length(rp0);
1.74 noro 4412: imat = (IndArray *)ALLOCA(nred*sizeof(IndArray));
4413: rhead = (int *)ALLOCA(col*sizeof(int));
4414: for ( i = 0; i < col; i++ ) rhead[i] = 0;
1.63 noro 4415:
1.74 noro 4416: /* construction of index arrays */
4417: rvect = (NM_ind_pair *)ALLOCA(nred*sizeof(NM_ind_pair));
4418: for ( rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) {
4419: rvect[i] = (NM_ind_pair)BDY(rp);
4420: imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rvect[i]);
4421: rhead[imat[i]->head] = 1;
4422: }
1.107 noro 4423: if ( m )
4424: r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred);
4425: else
1.113 noro 4426: r0 = nd_f4_red_q_main(sp0,nsp,s0vect,col,rvect,rhead,imat,nred);
1.106 noro 4427: return r0;
4428: }
1.74 noro 4429:
1.106 noro 4430: NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col,
4431: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
4432: {
4433: int spcol,sprow,a;
4434: int i,j,k,l,rank;
4435: NODE r0,r;
4436: ND_pairs sp;
4437: ND spol;
4438: int **spmat;
4439: UINT *svect,*v;
4440: int *colstat;
4441: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
4442: int maxrs;
4443: int *spsugar;
4444:
4445: spcol = col-nred;
4446: get_eg(&eg0);
1.74 noro 4447: /* elimination (1st step) */
4448: spmat = (int **)ALLOCA(nsp*sizeof(UINT *));
4449: svect = (UINT *)ALLOCA(col*sizeof(UINT));
1.76 noro 4450: spsugar = (int *)ALLOCA(nsp*sizeof(UINT));
1.74 noro 4451: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
4452: nd_sp(m,0,sp,&spol);
1.75 noro 4453: if ( !spol ) continue;
1.74 noro 4454: nd_to_vect(m,s0vect,col,spol,svect);
1.76 noro 4455: if ( m == -1 )
4456: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred);
4457: else
4458: maxrs = ndv_reduce_vect(m,svect,col,imat,rvect,nred);
1.74 noro 4459: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
4460: if ( i < col ) {
4461: spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT));
4462: for ( j = k = 0; j < col; j++ )
4463: if ( !rhead[j] ) v[k++] = svect[j];
1.76 noro 4464: spsugar[sprow] = MAX(maxrs,SG(spol));
1.74 noro 4465: sprow++;
4466: }
1.76 noro 4467: nd_free(spol);
1.74 noro 4468: }
1.80 noro 4469: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
4470: if ( DP_Print ) {
4471: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
4472: fflush(asir_out);
4473: }
1.74 noro 4474: /* free index arrays */
4475: for ( i = 0; i < nred; i++ ) GC_free(imat[i]->index.c);
4476:
4477: /* elimination (2nd step) */
4478: colstat = (int *)ALLOCA(spcol*sizeof(int));
4479: if ( m == -1 )
1.76 noro 4480: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4481: else
1.76 noro 4482: rank = nd_gauss_elim_mod(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4483: r0 = 0;
4484: for ( i = 0; i < rank; i++ ) {
4485: NEXTNODE(r0,r); BDY(r) =
4486: (pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
1.76 noro 4487: SG((NDV)BDY(r)) = spsugar[i];
1.74 noro 4488: GC_free(spmat[i]);
4489: }
1.109 noro 4490: if ( r0 ) NEXT(r) = 0;
1.74 noro 4491: for ( ; i < sprow; i++ ) GC_free(spmat[i]);
1.80 noro 4492: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
4493: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
1.74 noro 4494: if ( DP_Print ) {
1.80 noro 4495: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
1.74 noro 4496: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
4497: nsp,nred,sprow,spcol,rank);
4498: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
1.63 noro 4499: }
1.74 noro 4500: return r0;
4501: }
4502:
1.113 noro 4503: NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vect,int col,
1.107 noro 4504: NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred)
4505: {
4506: int spcol,sprow,a;
4507: int i,j,k,l,rank;
4508: NODE r0,r;
4509: ND_pairs sp;
4510: ND spol;
1.113 noro 4511: Q **spmat;
4512: Q *svect,*v;
1.107 noro 4513: int *colstat;
4514: struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2;
4515: int maxrs;
4516: int *spsugar;
4517:
4518: spcol = col-nred;
4519: get_eg(&eg0);
4520: /* elimination (1st step) */
1.113 noro 4521: spmat = (Q **)ALLOCA(nsp*sizeof(Q *));
4522: svect = (Q *)ALLOCA(col*sizeof(Q));
4523: spsugar = (int *)ALLOCA(nsp*sizeof(Q));
1.107 noro 4524: for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) {
4525: nd_sp(0,0,sp,&spol);
4526: if ( !spol ) continue;
1.113 noro 4527: nd_to_vect_q(s0vect,col,spol,svect);
4528: maxrs = ndv_reduce_vect_q(svect,col,imat,rvect,nred);
1.107 noro 4529: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
4530: if ( i < col ) {
1.113 noro 4531: spmat[sprow] = v = (Q *)MALLOC(spcol*sizeof(Q));
1.107 noro 4532: for ( j = k = 0; j < col; j++ )
4533: if ( !rhead[j] ) v[k++] = svect[j];
4534: spsugar[sprow] = MAX(maxrs,SG(spol));
4535: sprow++;
4536: }
1.109 noro 4537: /* nd_free(spol); */
1.107 noro 4538: }
4539: get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1);
4540: if ( DP_Print ) {
4541: fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime);
4542: fflush(asir_out);
4543: }
4544: /* free index arrays */
1.109 noro 4545: /* for ( i = 0; i < nred; i++ ) GC_free(imat[i]->index.c); */
1.107 noro 4546:
4547: /* elimination (2nd step) */
4548: colstat = (int *)ALLOCA(spcol*sizeof(int));
1.113 noro 4549: rank = nd_gauss_elim_q(spmat,spsugar,sprow,spcol,colstat);
1.107 noro 4550: r0 = 0;
4551: for ( i = 0; i < rank; i++ ) {
4552: NEXTNODE(r0,r); BDY(r) =
1.113 noro 4553: (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect);
1.107 noro 4554: SG((NDV)BDY(r)) = spsugar[i];
1.109 noro 4555: /* GC_free(spmat[i]); */
1.107 noro 4556: }
1.109 noro 4557: if ( r0 ) NEXT(r) = 0;
4558:
4559: /* for ( ; i < sprow; i++ ) GC_free(spmat[i]); */
1.107 noro 4560: get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2);
4561: init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2);
4562: if ( DP_Print ) {
4563: fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime);
4564: fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ",
4565: nsp,nred,sprow,spcol,rank);
4566: fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime);
4567: }
4568: return r0;
4569: }
4570:
1.74 noro 4571: FILE *nd_write,*nd_read;
4572:
4573: void nd_send_int(int a) {
4574: write_int(nd_write,&a);
4575: }
4576:
4577: void nd_send_intarray(int *p,int len) {
4578: write_intarray(nd_write,p,len);
4579: }
4580:
4581: int nd_recv_int() {
4582: int a;
4583:
4584: read_int(nd_read,&a);
4585: return a;
4586: }
4587:
4588: void nd_recv_intarray(int *p,int len) {
4589: read_intarray(nd_read,p,len);
4590: }
4591:
4592: void nd_send_ndv(NDV p) {
4593: int len,i;
4594: NMV m;
4595:
4596: if ( !p ) nd_send_int(0);
4597: else {
4598: len = LEN(p);
4599: nd_send_int(len);
4600: m = BDY(p);
4601: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4602: nd_send_int(CM(m));
4603: nd_send_intarray(DL(m),nd_wpd);
1.68 noro 4604: }
1.74 noro 4605: }
4606: }
4607:
4608: void nd_send_nd(ND p) {
4609: int len,i;
4610: NM m;
4611:
4612: if ( !p ) nd_send_int(0);
4613: else {
4614: len = LEN(p);
4615: nd_send_int(len);
4616: m = BDY(p);
4617: for ( i = 0; i < len; i++, m = NEXT(m) ) {
4618: nd_send_int(CM(m));
4619: nd_send_intarray(DL(m),nd_wpd);
1.65 noro 4620: }
1.74 noro 4621: }
4622: }
1.65 noro 4623:
1.74 noro 4624: NDV nd_recv_ndv()
4625: {
4626: int len,i;
4627: NMV m,m0;
4628: NDV r;
1.65 noro 4629:
1.74 noro 4630: len = nd_recv_int();
4631: if ( !len ) return 0;
4632: else {
4633: m0 = m = (NMV)GC_malloc_atomic_ignore_off_page(nmv_adv*len);
1.103 noro 4634: #if 0
1.74 noro 4635: ndv_alloc += len*nmv_adv;
1.103 noro 4636: #endif
1.74 noro 4637: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
4638: CM(m) = nd_recv_int();
4639: nd_recv_intarray(DL(m),nd_wpd);
1.71 noro 4640: }
1.74 noro 4641: MKNDV(nd_nvar,m0,len,r);
4642: return r;
4643: }
4644: }
1.65 noro 4645:
1.74 noro 4646: int ox_exec_f4_red(Q proc)
4647: {
4648: Obj obj;
4649: STRING fname;
4650: NODE arg;
4651: int s;
4652: extern int ox_need_conv,ox_file_io;
4653:
4654: MKSTR(fname,"nd_exec_f4_red");
4655: arg = mknode(2,proc,fname);
4656: Pox_cmo_rpc(arg,&obj);
4657: s = get_ox_server_id(QTOS(proc));
4658: nd_write = iofp[s].out;
4659: nd_read = iofp[s].in;
4660: ox_need_conv = ox_file_io = 0;
4661: return s;
4662: }
4663:
4664: NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0)
4665: {
4666: int nsp,nred;
4667: int i,rank,s;
4668: NODE rp,r0,r;
4669: ND_pairs sp;
4670: NM_ind_pair pair;
4671: NMV nmv;
4672: NM nm;
4673: NDV nf;
4674: Obj proc,dmy;
4675:
4676: ox_launch_main(0,0,&proc);
4677: s = ox_exec_f4_red((Q)proc);
4678:
4679: nd_send_int(m);
4680: nd_send_int(nd_nvar);
4681: nd_send_int(nd_bpe);
4682: nd_send_int(nd_wpd);
4683: nd_send_int(nmv_adv);
4684:
1.89 noro 4685: saveobj(nd_write,dp_current_spec->obj); fflush(nd_write);
1.74 noro 4686:
4687: nd_send_int(nd_psn);
4688: for ( i = 0; i < nd_psn; i++ ) nd_send_ndv(nd_ps[i]);
4689:
4690: for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ );
4691: nd_send_int(nsp);
4692: for ( i = 0, sp = sp0; i < nsp; i++, sp = NEXT(sp) ) {
4693: nd_send_int(sp->i1); nd_send_int(sp->i2);
4694: }
4695:
4696: nd_send_int(col); nd_send_intarray(s0vect,col*nd_wpd);
4697:
4698: nred = length(rp0); nd_send_int(nred);
4699: for ( i = 0, rp = rp0; i < nred; i++, rp = NEXT(rp) ) {
4700: pair = (NM_ind_pair)BDY(rp);
4701: nd_send_int(pair->index);
4702: nd_send_intarray(pair->mul->dl,nd_wpd);
4703: }
4704: fflush(nd_write);
4705: rank = nd_recv_int();
4706: fprintf(asir_out,"rank=%d\n",rank);
4707: r0 = 0;
4708: for ( i = 0; i < rank; i++ ) {
4709: nf = nd_recv_ndv();
4710: NEXTNODE(r0,r); BDY(r) = (pointer)nf;
4711: }
4712: Pox_shutdown(mknode(1,proc),&dmy);
4713: return r0;
4714: }
4715:
4716: /* server side */
4717:
4718: void nd_exec_f4_red_dist()
4719: {
4720: int m,i,nsp,col,s0size,nred,spcol,j,k;
4721: NM_ind_pair *rp0;
4722: NDV nf;
4723: UINT *s0vect;
4724: IndArray *imat;
4725: int *rhead;
4726: int **spmat;
4727: UINT *svect,*v;
4728: ND_pairs *sp0;
4729: int *colstat;
4730: int a,sprow,rank;
1.89 noro 4731: struct order_spec *ord;
1.74 noro 4732: Obj ordspec;
4733: ND spol;
1.76 noro 4734: int maxrs;
4735: int *spsugar;
1.74 noro 4736:
4737: nd_read = iofp[0].in;
4738: nd_write = iofp[0].out;
4739: m = nd_recv_int();
4740: nd_nvar = nd_recv_int();
4741: nd_bpe = nd_recv_int();
4742: nd_wpd = nd_recv_int();
4743: nmv_adv = nd_recv_int();
4744:
4745: loadobj(nd_read,&ordspec);
1.89 noro 4746: create_order_spec(0,ordspec,&ord);
4747: nd_init_ord(ord);
1.74 noro 4748: nd_setup_parameters(nd_nvar,0);
4749:
4750: nd_psn = nd_recv_int();
4751: nd_ps = (NDV *)MALLOC(nd_psn*sizeof(NDV));
4752: nd_bound = (UINT **)MALLOC(nd_psn*sizeof(UINT *));
4753: for ( i = 0; i < nd_psn; i++ ) {
4754: nd_ps[i] = nd_recv_ndv();
4755: nd_bound[i] = ndv_compute_bound(nd_ps[i]);
4756: }
4757:
4758: nsp = nd_recv_int();
4759: sp0 = (ND_pairs *)MALLOC(nsp*sizeof(ND_pairs));
4760: for ( i = 0; i < nsp; i++ ) {
4761: NEWND_pairs(sp0[i]);
4762: sp0[i]->i1 = nd_recv_int(); sp0[i]->i2 = nd_recv_int();
4763: ndl_lcm(HDL(nd_ps[sp0[i]->i1]),HDL(nd_ps[sp0[i]->i2]),LCM(sp0[i]));
4764: }
4765:
4766: col = nd_recv_int();
4767: s0size = col*nd_wpd;
4768: s0vect = (UINT *)MALLOC(s0size*sizeof(UINT));
4769: nd_recv_intarray(s0vect,s0size);
4770:
4771: nred = nd_recv_int();
4772: rp0 = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair));
4773: for ( i = 0; i < nred; i++ ) {
4774: rp0[i] = (NM_ind_pair)MALLOC(sizeof(struct oNM_ind_pair));
4775: rp0[i]->index = nd_recv_int();
4776: rp0[i]->mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT));
4777: nd_recv_intarray(rp0[i]->mul->dl,nd_wpd);
4778: }
4779:
4780: spcol = col-nred;
4781: imat = (IndArray *)MALLOC(nred*sizeof(IndArray));
4782: rhead = (int *)MALLOC(col*sizeof(int));
4783: for ( i = 0; i < col; i++ ) rhead[i] = 0;
4784:
4785: /* construction of index arrays */
4786: for ( i = 0; i < nred; i++ ) {
4787: imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rp0[i]);
4788: rhead[imat[i]->head] = 1;
4789: }
4790:
4791: /* elimination (1st step) */
4792: spmat = (int **)MALLOC(nsp*sizeof(UINT *));
4793: svect = (UINT *)MALLOC(col*sizeof(UINT));
1.76 noro 4794: spsugar = (int *)ALLOCA(nsp*sizeof(UINT));
1.74 noro 4795: for ( a = sprow = 0; a < nsp; a++ ) {
4796: nd_sp(m,0,sp0[a],&spol);
1.75 noro 4797: if ( !spol ) continue;
1.74 noro 4798: nd_to_vect(m,s0vect,col,spol,svect);
1.76 noro 4799: if ( m == -1 )
4800: maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rp0,nred);
4801: else
4802: maxrs = ndv_reduce_vect(m,svect,col,imat,rp0,nred);
1.74 noro 4803: for ( i = 0; i < col; i++ ) if ( svect[i] ) break;
4804: if ( i < col ) {
4805: spmat[sprow] = v = (UINT *)MALLOC(spcol*sizeof(UINT));
4806: for ( j = k = 0; j < col; j++ )
4807: if ( !rhead[j] ) v[k++] = svect[j];
1.76 noro 4808: spsugar[sprow] = MAX(maxrs,SG(spol));
1.74 noro 4809: sprow++;
4810: }
1.76 noro 4811: nd_free(spol);
1.74 noro 4812: }
4813: /* elimination (2nd step) */
4814: colstat = (int *)ALLOCA(spcol*sizeof(int));
4815: if ( m == -1 )
1.76 noro 4816: rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4817: else
1.76 noro 4818: rank = nd_gauss_elim_mod(spmat,spsugar,sprow,spcol,m,colstat);
1.74 noro 4819: nd_send_int(rank);
4820: for ( i = 0; i < rank; i++ ) {
4821: nf = vect_to_ndv(spmat[i],spcol,col,rhead,s0vect);
4822: nd_send_ndv(nf);
1.63 noro 4823: }
1.74 noro 4824: fflush(nd_write);
1.107 noro 4825: }
4826:
1.113 noro 4827: int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int col,int *colstat)
1.107 noro 4828: {
1.109 noro 4829: int mod,i,j,t,c,rank,rank0,inv;
4830: int *ci,*ri;
1.113 noro 4831: Q dn;
1.109 noro 4832: MAT m,nm;
1.108 noro 4833: int **wmat;
4834:
4835: /* XXX */
4836: mod = 99999989;
4837: wmat = (int **)ALLOCA(row*sizeof(int *));
4838: for ( i = 0; i < row; i++ ) {
4839: wmat[i] = (int *)ALLOCA(col*sizeof(int));
4840: for ( j = 0; j < col; j++ ) {
1.113 noro 4841: if ( mat0[i][j] ) {
4842: t = rem(NM(mat0[i][j]),mod);
4843: if ( SGN(mat0[i][j]) < 0 ) t = mod-t;
4844: wmat[i][j] = t;
4845: } else
1.108 noro 4846: wmat[i][j] = 0;
4847: }
4848: }
1.109 noro 4849: rank0 = nd_gauss_elim_mod(wmat,sugar,row,col,mod,colstat);
4850: NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0;
1.113 noro 4851: rank = generic_gauss_elim(m,&nm,&dn,&ri,&ci);
1.109 noro 4852: if ( rank != rank0 )
4853: error("afo");
4854: for ( i = 0; i < row; i++ )
4855: for ( j = 0; j < col; j++ )
4856: mat0[i][j] = 0;
4857: c = col-rank;
4858: for ( i = 0; i < rank; i++ ) {
1.113 noro 4859: mat0[i][ri[i]] = dn;
1.109 noro 4860: for ( j = 0; j < c; j++ )
1.113 noro 4861: mat0[i][ci[j]] = (Q)BDY(nm)[i][j];
1.109 noro 4862: }
1.113 noro 4863: inv = invm(rem(NM(dn),mod),mod);
4864: if ( SGN(dn) < 0 ) inv = mod-inv;
1.109 noro 4865: for ( i = 0; i < row; i++ )
4866: for ( j = 0; j < col; j++ ) {
1.113 noro 4867: if ( mat0[i][j] ) {
4868: t = rem(NM(mat0[i][j]),mod);
4869: if ( SGN(mat0[i][j]) < 0 ) t = mod-t;
4870: } else
1.109 noro 4871: t = 0;
4872: c = dmar(t,inv,0,mod);
4873: if ( wmat[i][j] != c )
4874: error("afo");
4875: }
4876: return rank;
1.76 noro 4877: }
4878:
4879: int nd_gauss_elim_mod(int **mat0,int *sugar,int row,int col,int md,int *colstat)
4880: {
4881: int i,j,k,l,inv,a,rank,s;
4882: unsigned int *t,*pivot,*pk;
4883: unsigned int **mat;
4884:
4885: mat = (unsigned int **)mat0;
4886: for ( rank = 0, j = 0; j < col; j++ ) {
4887: for ( i = rank; i < row; i++ )
4888: mat[i][j] %= md;
4889: for ( i = rank; i < row; i++ )
4890: if ( mat[i][j] )
4891: break;
4892: if ( i == row ) {
4893: colstat[j] = 0;
4894: continue;
4895: } else
4896: colstat[j] = 1;
4897: if ( i != rank ) {
4898: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
4899: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
4900: }
4901: pivot = mat[rank];
4902: s = sugar[rank];
4903: inv = invm(pivot[j],md);
4904: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
4905: if ( *pk ) {
4906: if ( *pk >= (unsigned int)md )
4907: *pk %= md;
4908: DMAR(*pk,inv,0,md,*pk)
4909: }
4910: for ( i = rank+1; i < row; i++ ) {
4911: t = mat[i];
4912: if ( a = t[j] ) {
4913: sugar[i] = MAX(sugar[i],s);
4914: red_by_vect(md,t+j,pivot+j,md-a,col-j);
4915: }
4916: }
4917: rank++;
4918: }
4919: for ( j = col-1, l = rank-1; j >= 0; j-- )
4920: if ( colstat[j] ) {
4921: pivot = mat[l];
4922: s = sugar[l];
4923: for ( i = 0; i < l; i++ ) {
4924: t = mat[i];
4925: t[j] %= md;
4926: if ( a = t[j] ) {
4927: sugar[i] = MAX(sugar[i],s);
4928: red_by_vect(md,t+j,pivot+j,md-a,col-j);
4929: }
4930: }
4931: l--;
4932: }
4933: for ( j = 0, l = 0; l < rank; j++ )
4934: if ( colstat[j] ) {
4935: t = mat[l];
4936: for ( k = j; k < col; k++ )
4937: if ( t[k] >= (unsigned int)md )
4938: t[k] %= md;
4939: l++;
4940: }
4941: return rank;
4942: }
4943:
4944: int nd_gauss_elim_sf(int **mat0,int *sugar,int row,int col,int md,int *colstat)
4945: {
4946: int i,j,k,l,inv,a,rank,s;
4947: unsigned int *t,*pivot,*pk;
4948: unsigned int **mat;
4949:
4950: mat = (unsigned int **)mat0;
4951: for ( rank = 0, j = 0; j < col; j++ ) {
4952: for ( i = rank; i < row; i++ )
4953: if ( mat[i][j] )
4954: break;
4955: if ( i == row ) {
4956: colstat[j] = 0;
4957: continue;
4958: } else
4959: colstat[j] = 1;
4960: if ( i != rank ) {
4961: t = mat[i]; mat[i] = mat[rank]; mat[rank] = t;
4962: s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s;
4963: }
4964: pivot = mat[rank];
4965: s = sugar[rank];
4966: inv = _invsf(pivot[j]);
4967: for ( k = j, pk = pivot+k; k < col; k++, pk++ )
4968: if ( *pk )
4969: *pk = _mulsf(*pk,inv);
4970: for ( i = rank+1; i < row; i++ ) {
4971: t = mat[i];
4972: if ( a = t[j] ) {
4973: sugar[i] = MAX(sugar[i],s);
4974: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
4975: }
4976: }
4977: rank++;
4978: }
4979: for ( j = col-1, l = rank-1; j >= 0; j-- )
4980: if ( colstat[j] ) {
4981: pivot = mat[l];
4982: s = sugar[l];
4983: for ( i = 0; i < l; i++ ) {
4984: t = mat[i];
4985: if ( a = t[j] ) {
4986: sugar[i] = MAX(sugar[i],s);
4987: red_by_vect_sf(md,t+j,pivot+j,_chsgnsf(a),col-j);
4988: }
4989: }
4990: l--;
4991: }
4992: return rank;
1.77 noro 4993: }
4994:
4995: int ndv_ishomo(NDV p)
4996: {
4997: NMV m;
4998: int len,h;
4999:
5000: if ( !p ) return 1;
5001: len = LEN(p);
5002: m = BDY(p);
5003: h = TD(DL(m));
5004: NMV_ADV(m);
5005: for ( len--; len; len--, NMV_ADV(m) )
5006: if ( TD(DL(m)) != h ) return 0;
5007: return 1;
5008: }
5009:
5010: void ndv_save(NDV p,int index)
5011: {
5012: FILE *s;
5013: char name[BUFSIZ];
5014: short id;
5015: int nv,sugar,len,n,i,td,e,j;
5016: NMV m;
5017: unsigned int *dl;
5018:
5019: sprintf(name,"%s/%d",Demand,index);
5020: s = fopen(name,"w");
5021: savevl(s,0);
5022: if ( !p ) {
5023: saveobj(s,0);
5024: return;
5025: }
5026: id = O_DP;
5027: nv = NV(p);
5028: sugar = SG(p);
5029: len = LEN(p);
5030: write_short(s,&id); write_int(s,&nv); write_int(s,&sugar);
5031: write_int(s,&len);
5032:
5033: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
1.113 noro 5034: saveobj(s,(Obj)CQ(m));
1.77 noro 5035: dl = DL(m);
5036: td = TD(dl);
5037: write_int(s,&td);
5038: for ( j = 0; j < nv; j++ ) {
5039: e = GET_EXP(dl,j);
5040: write_int(s,&e);
5041: }
5042: }
5043: fclose(s);
5044: }
5045:
5046: NDV ndv_load(int index)
5047: {
5048: FILE *s;
5049: char name[BUFSIZ];
5050: short id;
5051: int nv,sugar,len,n,i,td,e,j;
5052: NDV d;
5053: NMV m0,m;
5054: unsigned int *dl;
5055: Obj obj;
5056:
5057: sprintf(name,"%s/%d",Demand,index);
5058: s = fopen(name,"r");
5059: if ( !s ) return 0;
5060:
5061: skipvl(s);
5062: read_short(s,&id);
5063: if ( !id ) return 0;
5064: read_int(s,&nv);
5065: read_int(s,&sugar);
5066: read_int(s,&len);
5067:
5068: m0 = m = MALLOC(len*nmv_adv);
5069: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
1.113 noro 5070: loadobj(s,&obj); CQ(m) = (Q)obj;
1.77 noro 5071: dl = DL(m);
5072: ndl_zero(dl);
5073: read_int(s,&td); TD(dl) = td;
5074: for ( j = 0; j < nv; j++ ) {
5075: read_int(s,&e);
5076: PUT_EXP(dl,j,e);
5077: }
5078: if ( nd_blockmask ) ndl_weight_mask(dl);
5079: }
5080: fclose(s);
5081: MKNDV(nv,m0,len,d);
5082: SG(d) = sugar;
5083: return d;
1.99 noro 5084: }
5085:
1.102 noro 5086: void nd_det(int mod,MAT f,P *rp)
1.99 noro 5087: {
5088: VL fv,tv;
1.102 noro 5089: int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a;
1.99 noro 5090: pointer **m;
1.113 noro 5091: Q mone;
1.102 noro 5092: NDV **dm;
5093: NDV *t,*mi,*mj;
5094: NDV d,s,mij,mjj;
5095: ND u;
5096: NMV nmv;
1.114 noro 5097: UINT *bound;
1.99 noro 5098: PGeoBucket bucket;
5099: struct order_spec *ord;
5100:
5101: create_order_spec(0,0,&ord);
5102: nd_init_ord(ord);
5103: get_vars((Obj)f,&fv);
5104: if ( f->row != f->col )
5105: error("nd_det : non-square matrix");
5106: n = f->row;
5107: for ( nvar = 0, tv = fv; tv; tv = NEXT(tv), nvar++ );
5108: m = f->body;
5109: for ( i = 0, max = 0; i < n; i++ )
5110: for ( j = 0; j < n; j++ )
5111: for ( tv = fv; tv; tv = NEXT(tv) ) {
5112: e = getdeg(tv->v,(P)m[i][j]);
5113: max = MAX(e,max);
5114: }
1.114 noro 5115: nd_setup_parameters(nvar,max);
1.102 noro 5116: dm = (NDV **)almat_pointer(n,n);
1.99 noro 5117: for ( i = 0, max = 0; i < n; i++ )
1.102 noro 5118: for ( j = 0; j < n; j++ ) {
5119: dm[i][j] = ptondv(CO,fv,m[i][j]);
5120: if ( mod ) ndv_mod(mod,dm[i][j]);
5121: if ( dm[i][j] && !LEN(dm[i][j]) ) dm[i][j] = 0;
5122: }
5123: d = ptondv(CO,fv,(P)ONE);
5124: if ( mod ) ndv_mod(mod,d);
1.113 noro 5125: chsgnq(ONE,&mone);
1.99 noro 5126: for ( j = 0, sgn = 1; j < n; j++ ) {
1.104 noro 5127: if ( DP_Print ) fprintf(stderr,"j=%d\n",j);
1.99 noro 5128: for ( i = j; i < n && !dm[i][j]; i++ );
5129: if ( i == n ) {
5130: *rp = 0;
5131: return;
5132: }
1.102 noro 5133: k0 = i; l0 = j; len0 = LEN(dm[k0][l0]);
1.99 noro 5134: for ( k = j; k < n; k++ )
5135: for ( l = j; l < n; l++ )
1.102 noro 5136: if ( dm[k][l] && LEN(dm[k][l]) < len0 ) {
5137: k0 = k; l0 = l; len0 = LEN(dm[k][l]);
1.99 noro 5138: }
5139: if ( k0 != j ) {
5140: t = dm[j]; dm[j] = dm[k0]; dm[k0] = t;
5141: sgn = -sgn;
5142: }
5143: if ( l0 != j ) {
5144: for ( k = j; k < n; k++ ) {
5145: s = dm[k][j]; dm[k][j] = dm[k][l0]; dm[k][l0] = s;
5146: }
5147: sgn = -sgn;
5148: }
1.114 noro 5149: bound = nd_det_compute_bound(dm,n,j);
5150: if ( ndl_check_bound(bound,bound) )
5151: nd_det_reconstruct(dm,n,j,d);
5152:
1.99 noro 5153: for ( i = j+1, mj = dm[j], mjj = mj[j]; i < n; i++ ) {
1.114 noro 5154: /* if ( DP_Print ) fprintf(stderr," i=%d\n ",i); */
1.99 noro 5155: mi = dm[i]; mij = mi[j];
1.102 noro 5156: if ( mod )
5157: ndv_mul_c(mod,mij,mod-1);
5158: else
1.113 noro 5159: ndv_mul_c_q(mij,mone);
1.99 noro 5160: for ( k = j+1; k < n; k++ ) {
1.114 noro 5161: /* if ( DP_Print ) fprintf(stderr,"k=%d ",k); */
1.99 noro 5162: bucket = create_pbucket();
1.104 noro 5163: if ( mi[k] ) {
1.102 noro 5164: nmv = BDY(mjj); len = LEN(mjj);
5165: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
5166: u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d)));
5167: add_pbucket(mod,bucket,u);
1.99 noro 5168: }
1.104 noro 5169: }
1.99 noro 5170: if ( mj[k] && mij ) {
1.102 noro 5171: nmv = BDY(mij); len = LEN(mij);
5172: for ( a = 0; a < len; a++, NMV_ADV(nmv) ) {
5173: u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d)));
5174: add_pbucket(mod,bucket,u);
1.99 noro 5175: }
5176: }
1.104 noro 5177: u = nd_quo(mod,bucket,d);
1.102 noro 5178: mi[k] = ndtondv(mod,u);
1.99 noro 5179: }
1.114 noro 5180: /* if ( DP_Print ) fprintf(stderr,"\n",k); */
1.99 noro 5181: }
5182: d = mjj;
5183: }
1.100 noro 5184: if ( sgn < 0 )
1.102 noro 5185: if ( mod )
5186: ndv_mul_c(mod,d,mod-1);
5187: else
1.113 noro 5188: ndv_mul_c_q(d,mone);
1.102 noro 5189: *rp = ndvtop(mod,CO,fv,d);
1.99 noro 5190: }
5191:
1.102 noro 5192: ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d)
1.99 noro 5193: {
5194: NM mr,mr0;
1.102 noro 5195: NM tnm;
5196: NMV m;
1.99 noro 5197: UINT *d0,*dt,*dm;
5198: int c,n,td,i,c1,c2,len;
1.113 noro 5199: Q q;
1.99 noro 5200: ND r;
5201:
5202: if ( !p ) return 0;
5203: else {
1.102 noro 5204: n = NV(p); m = BDY(p); len = LEN(p);
1.99 noro 5205: d0 = DL(m0);
1.102 noro 5206: td = TD(d);
1.99 noro 5207: mr0 = 0;
5208: NEWNM(tnm);
1.102 noro 5209: if ( mod ) {
5210: c = CM(m0);
5211: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
5212: ndl_add(DL(m),d0,DL(tnm));
5213: if ( ndl_reducible(DL(tnm),d) ) {
5214: NEXTNM(mr0,mr);
5215: c1 = CM(m); DMAR(c1,c,0,mod,c2); CM(mr) = c2;
1.104 noro 5216: ndl_copy(DL(tnm),DL(mr));
1.102 noro 5217: }
5218: }
5219: } else {
1.113 noro 5220: q = CQ(m0);
1.102 noro 5221: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
5222: ndl_add(DL(m),d0,DL(tnm));
5223: if ( ndl_reducible(DL(tnm),d) ) {
5224: NEXTNM(mr0,mr);
1.113 noro 5225: mulq(CQ(m),q,&CQ(mr));
1.104 noro 5226: ndl_copy(DL(tnm),DL(mr));
1.102 noro 5227: }
1.99 noro 5228: }
5229: }
5230: if ( !mr0 )
5231: return 0;
5232: else {
5233: NEXT(mr) = 0;
1.105 noro 5234: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
1.99 noro 5235: MKND(NV(p),mr0,len,r);
5236: SG(r) = SG(p) + TD(d0);
5237: return r;
5238: }
5239: }
1.114 noro 5240: }
5241:
5242: void nd_det_reconstruct(NDV **dm,int n,int j,NDV d)
5243: {
5244: int i,obpe,oadv,h,k,l;
5245: static NM prev_nm_free_list;
5246: EPOS oepos;
5247:
5248: obpe = nd_bpe;
5249: oadv = nmv_adv;
5250: oepos = nd_epos;
5251: if ( obpe < 2 ) nd_bpe = 2;
5252: else if ( obpe < 3 ) nd_bpe = 3;
5253: else if ( obpe < 4 ) nd_bpe = 4;
5254: else if ( obpe < 5 ) nd_bpe = 5;
5255: else if ( obpe < 6 ) nd_bpe = 6;
5256: else if ( obpe < 8 ) nd_bpe = 8;
5257: else if ( obpe < 10 ) nd_bpe = 10;
5258: else if ( obpe < 16 ) nd_bpe = 16;
5259: else if ( obpe < 32 ) nd_bpe = 32;
5260: else error("nd_det_reconstruct : exponent too large");
5261:
5262: nd_setup_parameters(nd_nvar,0);
5263: prev_nm_free_list = _nm_free_list;
5264: _nm_free_list = 0;
5265: for ( k = j; k < n; k++ )
5266: for (l = j; l < n; l++ )
5267: ndv_realloc(dm[k][l],obpe,oadv,oepos);
5268: ndv_realloc(d,obpe,oadv,oepos);
5269: prev_nm_free_list = 0;
5270: #if 0
5271: GC_gcollect();
5272: #endif
5273: }
5274:
5275: UINT *nd_det_compute_bound(NDV **dm,int n,int j)
5276: {
5277: UINT *d0,*d1,*d,*t,*r;
5278: int k,l;
5279:
5280: d0 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
5281: d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
5282: for ( k = 0; k < nd_wpd; k++ ) d0[k] = 0;
5283: for ( k = j; k < n; k++ )
5284: for ( l = j; l < n; l++ )
5285: if ( dm[k][l] ) {
5286: d = ndv_compute_bound(dm[k][l]);
5287: ndl_lcm(d,d0,d1);
5288: t = d1; d1 = d0; d0 = t;
5289: }
5290: r = (UINT *)ALLOCA(nd_wpd*sizeof(UINT));
5291: for ( k = 0; k < nd_wpd; k++ ) r[k] = d0[k];
5292: return r;
1.117 noro 5293: }
5294:
5295: DL nd_separate_d(UINT *d,UINT *trans)
5296: {
1.121 noro 5297: int n,td,i,e,j;
1.117 noro 5298: DL a;
5299:
5300: ndl_zero(trans);
5301: td = 0;
1.121 noro 5302: for ( i = 0; i < nd_ntrans; i++ ) {
5303: e = GET_EXP(d,i);
5304: PUT_EXP(trans,i,e);
5305: td += MUL_WEIGHT(e,i);
5306: }
5307: if ( nd_ntrans+nd_nalg < nd_nvar ) {
5308: /* homogenized */
5309: i = nd_nvar-1;
1.117 noro 5310: e = GET_EXP(d,i);
5311: PUT_EXP(trans,i,e);
5312: td += MUL_WEIGHT(e,i);
5313: }
5314: TD(trans) = td;
5315: if ( nd_blockmask) ndl_weight_mask(trans);
5316: NEWDL(a,nd_nalg);
5317: td = 0;
1.121 noro 5318: for ( i = 0; i < nd_nalg; i++ ) {
5319: j = nd_ntrans+i;
5320: e = GET_EXP(d,j);
5321: a->d[i] = e;
1.117 noro 5322: td += e;
5323: }
5324: a->td = td;
5325: return a;
5326: }
5327:
1.118 noro 5328: int nd_monic(int mod,ND *p)
1.117 noro 5329: {
5330: UINT *trans,*t;
5331: DL alg;
5332: MP mp0,mp;
1.118 noro 5333: NM m,m0,m1,ma0,ma,mb,mr0,mr;
5334: ND r;
1.117 noro 5335: DL dl;
5336: DP nm;
5337: NDV ndv;
1.118 noro 5338: DAlg inv,cd;
1.117 noro 5339: ND s,c;
1.118 noro 5340: Q l,mul;
5341: N ln;
5342: int n,ntrans,i,e,td,is_lc,len;
5343: NumberField nf;
5344: struct oEGT eg0,eg1;
5345:
5346: if ( !(nf = get_numberfield()) )
5347: error("nd_monic : current_numberfield is not set");
1.117 noro 5348:
1.118 noro 5349: /* Q coef -> DAlg coef */
5350: NEWNM(ma0); ma = ma0;
5351: m = BDY(*p);
5352: is_lc = 1;
5353: while ( 1 ) {
5354: NEWMP(mp0); mp = mp0;
5355: mp->c = (P)CQ(m);
5356: mp->dl = nd_separate_d(DL(m),DL(ma));
5357: NEWNM(mb);
5358: for ( m = NEXT(m); m; m = NEXT(m) ) {
5359: alg = nd_separate_d(DL(m),DL(mb));
5360: if ( !ndl_equal(DL(ma),DL(mb)) )
5361: break;
5362: NEXTMP(mp0,mp); mp->c = (P)CQ(m); mp->dl = alg;
5363: }
5364: NEXT(mp) = 0;
5365: MKDP(nd_nalg,mp0,nm);
5366: MKDAlg(nm,ONE,cd);
5367: if ( is_lc == 1 ) {
5368: /* if the lc is a rational number, we have nothing to do */
5369: if ( !mp0->dl->td )
5370: return 1;
5371:
5372: get_eg(&eg0);
5373: invdalg(cd,&inv);
5374: get_eg(&eg1); add_eg(&eg_invdalg,&eg0,&eg1);
5375: /* check the validity of inv */
5376: if ( mod && !rem(NM(inv->dn),mod) )
5377: return 0;
5378: CA(ma) = nf->one;
5379: is_lc = 0;
5380: ln = ONEN;
5381: } else {
5382: muldalg(cd,inv,&CA(ma));
5383: lcmn(ln,NM(CA(ma)->dn),&ln);
5384: }
5385: if ( m ) {
5386: NEXT(ma) = mb; ma = mb;
5387: } else {
5388: NEXT(ma) = 0;
5389: break;
5390: }
5391: }
5392: /* l = lcm(denoms) */
5393: NTOQ(ln,1,l);
5394: for ( mr0 = 0, m = ma0; m; m = NEXT(m) ) {
5395: divq(l,CA(m)->dn,&mul);
5396: for ( mp = BDY(CA(m)->nm); mp; mp = NEXT(mp) ) {
5397: NEXTNM(mr0,mr);
5398: mulq((Q)mp->c,mul,&CQ(mr));
5399: dl = mp->dl;
5400: td = TD(DL(m));
5401: ndl_copy(DL(m),DL(mr));
1.121 noro 5402: for ( i = 0; i < nd_nalg; i++ ) {
5403: e = dl->d[i];
5404: PUT_EXP(DL(mr),i+nd_ntrans,e);
5405: td += MUL_WEIGHT(e,i+nd_ntrans);
1.118 noro 5406: }
5407: TD(DL(mr)) = td;
5408: if ( nd_blockmask) ndl_weight_mask(DL(mr));
5409: }
1.117 noro 5410: }
1.118 noro 5411: NEXT(mr) = 0;
5412: for ( len = 0, mr = mr0; mr; mr = NEXT(mr), len++ );
5413: MKND(NV(*p),mr0,len,r);
5414: /* XXX */
5415: SG(r) = SG(*p);
5416: nd_free(*p);
5417: *p = r;
5418: return 1;
1.59 noro 5419: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>