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