Annotation of OpenXM_contrib2/asir2000/engine/nd.c, Revision 1.50
1.50 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.49 2003/08/26 01:54:18 noro Exp $ */
1.2 noro 2:
1.1 noro 3: #include "ca.h"
4: #include "inline.h"
5:
6: #if defined(__GNUC__)
7: #define INLINE inline
8: #elif defined(VISUAL)
9: #define INLINE __inline
10: #else
11: #define INLINE
12: #endif
13:
1.47 noro 14: #define USE_GEOBUCKET 1
1.28 noro 15:
1.1 noro 16: #define REDTAB_LEN 32003
17:
1.40 noro 18: /* GeoBucket for polynomial addition */
19:
1.1 noro 20: typedef struct oPGeoBucket {
21: int m;
22: struct oND *body[32];
23: } *PGeoBucket;
24:
1.40 noro 25: /* distributed polynomial; linked list rep. */
1.1 noro 26: typedef struct oND {
27: struct oNM *body;
28: int nv;
1.31 noro 29: int len;
1.1 noro 30: int sugar;
31: } *ND;
32:
1.40 noro 33: /* distributed polynomial; array rep. */
1.3 noro 34: typedef struct oNDV {
35: struct oNMV *body;
36: int nv;
1.31 noro 37: int len;
1.3 noro 38: int sugar;
39: } *NDV;
40:
1.40 noro 41: /* monomial; linked list rep. */
1.1 noro 42: typedef struct oNM {
43: struct oNM *next;
1.14 noro 44: union {
45: int m;
46: Q z;
47: } c;
1.1 noro 48: unsigned int dl[1];
49: } *NM;
50:
1.40 noro 51: /* monomial; array rep. */
1.3 noro 52: typedef struct oNMV {
1.14 noro 53: union {
54: int m;
55: Q z;
56: } c;
1.3 noro 57: unsigned int dl[1];
58: } *NMV;
59:
1.40 noro 60: /* history of reducer */
1.13 noro 61: typedef struct oRHist {
62: struct oRHist *next;
63: int index;
1.34 noro 64: int sugar;
1.13 noro 65: unsigned int dl[1];
66: } *RHist;
67:
1.40 noro 68: /* S-pair list */
1.1 noro 69: typedef struct oND_pairs {
70: struct oND_pairs *next;
71: int i1,i2;
1.34 noro 72: int sugar;
1.1 noro 73: unsigned int lcm[1];
74: } *ND_pairs;
75:
1.42 noro 76: /* index and shift count for each exponent */
77: typedef struct oEPOS {
78: int i; /* index */
79: int s; /* shift */
80: } *EPOS;
81:
1.43 noro 82: typedef struct oBlockMask {
83: int n;
84: struct order_pair *order_pair;
85: unsigned int **mask;
86: } *BlockMask;
87:
1.45 noro 88: typedef struct oBaseSet {
89: int len;
90: NDV *ps;
91: unsigned int **bound;
92: } *BaseSet;
93:
94: int (*ndl_compare_function)(unsigned int *a1,unsigned int *a2);
1.32 noro 95:
1.42 noro 96: static double nd_scale=2;
1.1 noro 97: static unsigned int **nd_bound;
1.42 noro 98: static struct order_spec *nd_ord;
99: static EPOS nd_epos;
1.43 noro 100: static BlockMask nd_blockmask;
1.42 noro 101: static int nd_nvar;
102: static int nd_isrlex;
103: static int nd_epw,nd_bpe,nd_wpd,nd_exporigin;
104: static unsigned int nd_mask[32];
105: static unsigned int nd_mask0,nd_mask1;
106:
107: static NM _nm_free_list;
108: static ND _nd_free_list;
109: static ND_pairs _ndp_free_list;
1.20 noro 110:
111: static NDV *nd_ps;
112: static NDV *nd_psq;
1.42 noro 113: static RHist *nd_psh;
114: static int nd_psn,nd_pslen;
1.20 noro 115:
1.42 noro 116: static RHist *nd_red;
1.1 noro 117:
1.42 noro 118: static int nd_found,nd_create,nd_notfirst;
119: static int nm_adv;
120: static int nmv_adv;
121: static int nd_dcomp;
1.1 noro 122:
1.34 noro 123: extern int Top,Reverse,dp_nelim;
1.1 noro 124:
1.40 noro 125: /* fundamental macros */
1.34 noro 126: #define TD(d) (d[0])
1.1 noro 127: #define HDL(d) ((d)->body->dl)
1.34 noro 128: #define HTD(d) (TD(HDL(d)))
1.14 noro 129: #define HCM(d) ((d)->body->c.m)
1.16 noro 130: #define HCQ(d) ((d)->body->c.z)
1.14 noro 131: #define CM(a) ((a)->c.m)
1.16 noro 132: #define CQ(a) ((a)->c.z)
1.14 noro 133: #define DL(a) ((a)->dl)
134: #define SG(a) ((a)->sugar)
135: #define LEN(a) ((a)->len)
1.33 noro 136: #define LCM(a) ((a)->lcm)
1.42 noro 137: #define GET_EXP(d,a) (((d)[nd_epos[a].i]>>nd_epos[a].s)&nd_mask0)
138: #define PUT_EXP(r,a,e) ((r)[nd_epos[a].i] |= ((e)<<nd_epos[a].s))
1.45 noro 139: #define XOR_EXP(r,a,e) ((r)[nd_epos[a].i] ^= ((e)<<nd_epos[a].s))
1.1 noro 140:
1.40 noro 141: /* macros for term comparison */
1.34 noro 142: #define TD_DL_COMPARE(d1,d2)\
1.41 noro 143: (TD(d1)>TD(d2)?1:(TD(d1)<TD(d2)?-1:ndl_lex_compare(d1,d2)))
1.43 noro 144: #if 0
1.34 noro 145: #define DL_COMPARE(d1,d2)\
1.43 noro 146: (nd_dcomp>0?TD_DL_COMPARE(d1,d2)\
147: :(nd_dcomp==0?ndl_lex_compare(d1,d2)\
148: :(nd_blockmask?ndl_block_compare(d1,d2)\
1.45 noro 149: :(*ndl_compare_function)(d1,d2))))
1.43 noro 150: #else
151: #define DL_COMPARE(d1,d2)\
1.45 noro 152: (nd_dcomp>0?TD_DL_COMPARE(d1,d2):(*ndl_compare_function)(d1,d2))
1.43 noro 153: #endif
1.34 noro 154:
1.40 noro 155: /* allocators */
1.15 noro 156: #define NEWRHist(r) \
1.41 noro 157: ((r)=(RHist)MALLOC(sizeof(struct oRHist)+(nd_wpd-1)*sizeof(unsigned int)))
1.34 noro 158: #define NEWND_pairs(m) \
159: if(!_ndp_free_list)_NDP_alloc();\
160: (m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list)
161: #define NEWNM(m)\
162: if(!_nm_free_list)_NM_alloc();\
163: (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list)
164: #define MKND(n,m,len,d)\
165: if(!_nd_free_list)_ND_alloc();\
166: (d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list);\
167: NV(d)=(n); LEN(d)=(len); BDY(d)=(m)
1.40 noro 168: #define NEWNDV(d) ((d)=(NDV)MALLOC(sizeof(struct oNDV)))
169: #define MKNDV(n,m,l,d) NEWNDV(d); NV(d)=(n); BDY(d)=(m); LEN(d) = l;
1.1 noro 170:
1.40 noro 171: /* allocate and link a new object */
1.13 noro 172: #define NEXTRHist(r,c) \
173: if(!(r)){NEWRHist(r);(c)=(r);}else{NEWRHist(NEXT(c));(c)=NEXT(c);}
1.1 noro 174: #define NEXTNM(r,c) \
175: if(!(r)){NEWNM(r);(c)=(r);}else{NEWNM(NEXT(c));(c)=NEXT(c);}
176: #define NEXTNM2(r,c,s) \
177: if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);}
1.40 noro 178: #define NEXTND_pairs(r,c) \
179: if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);}
1.34 noro 180:
1.40 noro 181: /* deallocators */
1.1 noro 182: #define FREENM(m) NEXT(m)=_nm_free_list; _nm_free_list=(m)
183: #define FREENDP(m) NEXT(m)=_ndp_free_list; _ndp_free_list=(m)
184: #define FREEND(m) BDY(m)=(NM)_nd_free_list; _nd_free_list=(m)
185:
1.40 noro 186: /* macro for increasing pointer to NMV */
187: #define NMV_ADV(m) (m = (NMV)(((char *)m)+nmv_adv))
188:
189: /* external functions */
190: void GC_gcollect();
191: NODE append_one(NODE,int);
1.1 noro 192:
1.40 noro 193: /* manipulation of coefficients */
1.20 noro 194: void nd_removecont(int mod,ND p);
1.21 noro 195: void nd_removecont2(ND p1,ND p2);
1.40 noro 196: void removecont_array(Q *c,int n);
197:
198: /* GeoBucket functions */
1.25 noro 199: ND normalize_pbucket(int mod,PGeoBucket g);
200: int head_pbucket(int mod,PGeoBucket g);
1.26 noro 201: int head_pbucket_q(PGeoBucket g);
1.31 noro 202: void add_pbucket(int mod,PGeoBucket g,ND d);
1.25 noro 203: void free_pbucket(PGeoBucket b);
1.26 noro 204: void mulq_pbucket(PGeoBucket g,Q c);
1.25 noro 205: PGeoBucket create_pbucket();
1.20 noro 206:
1.40 noro 207: /* manipulation of pairs and bases */
1.39 noro 208: int nd_newps(int mod,ND a,ND aq);
1.40 noro 209: ND_pairs nd_newpairs( NODE g, int t );
1.1 noro 210: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest );
211: NODE update_base(NODE nd,int ndp);
1.40 noro 212: ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t);
213: ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest );
214: ND_pairs crit_B( ND_pairs d, int s );
215: ND_pairs crit_M( ND_pairs d1 );
216: ND_pairs crit_F( ND_pairs d1 );
1.1 noro 217: int crit_2( int dp1, int dp2 );
1.40 noro 218:
219: /* top level functions */
220: void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp);
221: void nd_gr_trace(LIST f,LIST v,int m,int homo,struct order_spec *ord,LIST *rp);
1.27 noro 222: NODE nd_gb(int m,int checkonly);
1.23 noro 223: NODE nd_gb_trace(int m);
1.40 noro 224:
225: /* ndl functions */
1.39 noro 226: int ndl_weight(unsigned int *d);
1.43 noro 227: int ndl_weight_mask(unsigned int *d,int i);
1.34 noro 228: void ndl_dehomogenize(unsigned int *p);
1.43 noro 229: void ndl_reconstruct(int obpe,EPOS oepos,unsigned int *d,unsigned int *r);
1.40 noro 230: INLINE int ndl_reducible(unsigned int *d1,unsigned int *d2);
231: INLINE int ndl_lex_compare(unsigned int *d1,unsigned int *d2);
1.43 noro 232: INLINE int ndl_block_compare(unsigned int *d1,unsigned int *d2);
1.40 noro 233: INLINE int ndl_equal(unsigned int *d1,unsigned int *d2);
234: INLINE void ndl_copy(unsigned int *d1,unsigned int *d2);
235: INLINE void ndl_add(unsigned int *d1,unsigned int *d2,unsigned int *d);
236: INLINE void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d);
237: INLINE int ndl_hash_value(unsigned int *d);
1.45 noro 238:
239: /* normal forms */
1.40 noro 240: INLINE int nd_find_reducer(ND g);
241: INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len);
1.16 noro 242: int nd_sp(int mod,ND_pairs p,ND *nf);
243: int nd_nf(int mod,ND g,int full,ND *nf);
1.30 noro 244: int nd_nf_pbucket(int mod,ND g,int full,ND *nf);
1.45 noro 245: int nd_nf_direct(int mod,ND g,BaseSet base,int full,ND *rp);
1.40 noro 246:
247: /* finalizers */
248: NODE nd_reducebase(NODE x);
1.23 noro 249: NODE nd_reduceall(int m,NODE f);
1.27 noro 250: int nd_gbcheck(int m,NODE f);
251: int nd_membercheck(int m,NODE f);
1.40 noro 252:
253: /* allocators */
254: void nd_free_private_storage();
255: void _NM_alloc();
256: void _ND_alloc();
1.1 noro 257: void nd_free(ND p);
1.40 noro 258: void nd_free_redlist();
259:
260: /* printing */
1.1 noro 261: void ndl_print(unsigned int *dl);
262: void nd_print(ND p);
1.16 noro 263: void nd_print_q(ND p);
1.1 noro 264: void ndp_print(ND_pairs d);
1.40 noro 265:
266:
267: /* setup, reconstruct */
268: void nd_init_ord(struct order_spec *spec);
269: ND_pairs nd_reconstruct(int mod,int trace,ND_pairs ndp);
270: void nd_reconstruct_direct(int mod,NDV *ps,int len);
271: void nd_setup(int mod,int trace,NODE f);
272: void nd_setup_parameters();
1.43 noro 273: BlockMask nd_create_blockmask(struct order_spec *ord);
1.48 noro 274: int nd_get_exporigin(struct order_spec *ord);
1.40 noro 275:
276: /* ND functions */
277: int nd_check_candidate(NODE input,NODE cand);
278: void nd_mul_c(int mod,ND p,int mul);
279: void nd_mul_c_q(ND p,Q mul);
280: ND nd_remove_head(ND p);
1.1 noro 281: int nd_length(ND p);
1.34 noro 282: void nd_append_red(unsigned int *d,int i);
1.45 noro 283: unsigned int *ndv_compute_bound(NDV p);
1.5 noro 284: unsigned int *dp_compute_bound(DP p);
1.6 noro 285: ND nd_copy(ND p);
1.40 noro 286: ND nd_add(int mod,ND p1,ND p2);
287: ND nd_add_q(ND p1,ND p2);
1.41 noro 288: INLINE int nd_length(ND p);
1.4 noro 289:
1.40 noro 290: /* NDV functions */
1.19 noro 291: void ndv_mul_c(int mod,NDV p,int mul);
1.40 noro 292: void ndv_mul_c_q(NDV p,Q mul);
1.43 noro 293: void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos);
1.40 noro 294: ND ndv_mul_nm(int mod,NDV p,NM m0);
1.45 noro 295: void ndv_dehomogenize(NDV p,struct order_spec *spec);
1.40 noro 296: void ndv_removecont(int mod,NDV p);
297: void ndv_print(NDV p);
298: void ndv_print_q(NDV p);
299: void ndv_free(NDV p);
300:
301: /* converters */
1.16 noro 302: NDV ndtondv(int mod,ND p);
1.23 noro 303: ND ndvtond(int mod,NDV p);
1.16 noro 304: NDV dptondv(int,DP);
305: DP ndvtodp(int,NDV);
1.17 noro 306: ND dptond(int,DP);
307: DP ndtodp(int,ND);
1.1 noro 308:
309: void nd_free_private_storage()
310: {
311: _nd_free_list = 0;
312: _nm_free_list = 0;
1.5 noro 313: _ndp_free_list = 0;
1.13 noro 314: bzero(nd_red,sizeof(REDTAB_LEN*sizeof(RHist)));
1.1 noro 315: GC_gcollect();
316: }
317:
318: void _NM_alloc()
319: {
320: NM p;
321: int i;
322:
1.11 noro 323: for ( i = 0; i < 1024; i++ ) {
1.41 noro 324: p = (NM)GC_malloc(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int));
1.1 noro 325: p->next = _nm_free_list; _nm_free_list = p;
326: }
327: }
328:
329: void _ND_alloc()
330: {
331: ND p;
332: int i;
333:
334: for ( i = 0; i < 1024; i++ ) {
335: p = (ND)GC_malloc(sizeof(struct oND));
336: p->body = (NM)_nd_free_list; _nd_free_list = p;
337: }
338: }
339:
340: void _NDP_alloc()
341: {
342: ND_pairs p;
343: int i;
344:
1.11 noro 345: for ( i = 0; i < 1024; i++ ) {
1.1 noro 346: p = (ND_pairs)GC_malloc(sizeof(struct oND_pairs)
1.41 noro 347: +(nd_wpd-1)*sizeof(unsigned int));
1.1 noro 348: p->next = _ndp_free_list; _ndp_free_list = p;
349: }
350: }
351:
1.30 noro 352: INLINE int nd_length(ND p)
1.1 noro 353: {
354: NM m;
355: int i;
356:
357: if ( !p )
358: return 0;
359: else {
360: for ( i = 0, m = BDY(p); m; m = NEXT(m), i++ );
361: return i;
362: }
363: }
364:
1.35 noro 365: INLINE int ndl_reducible(unsigned int *d1,unsigned int *d2)
1.1 noro 366: {
367: unsigned int u1,u2;
368: int i,j;
369:
1.34 noro 370: if ( TD(d1) < TD(d2) ) return 0;
1.1 noro 371: switch ( nd_bpe ) {
372: case 4:
1.41 noro 373: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 374: u1 = d1[i]; u2 = d2[i];
375: if ( (u1&0xf0000000) < (u2&0xf0000000) ) return 0;
376: if ( (u1&0xf000000) < (u2&0xf000000) ) return 0;
377: if ( (u1&0xf00000) < (u2&0xf00000) ) return 0;
378: if ( (u1&0xf0000) < (u2&0xf0000) ) return 0;
379: if ( (u1&0xf000) < (u2&0xf000) ) return 0;
380: if ( (u1&0xf00) < (u2&0xf00) ) return 0;
381: if ( (u1&0xf0) < (u2&0xf0) ) return 0;
382: if ( (u1&0xf) < (u2&0xf) ) return 0;
383: }
384: return 1;
385: break;
386: case 6:
1.41 noro 387: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 388: u1 = d1[i]; u2 = d2[i];
389: if ( (u1&0x3f000000) < (u2&0x3f000000) ) return 0;
390: if ( (u1&0xfc0000) < (u2&0xfc0000) ) return 0;
391: if ( (u1&0x3f000) < (u2&0x3f000) ) return 0;
392: if ( (u1&0xfc0) < (u2&0xfc0) ) return 0;
393: if ( (u1&0x3f) < (u2&0x3f) ) return 0;
394: }
395: return 1;
396: break;
397: case 8:
1.41 noro 398: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 399: u1 = d1[i]; u2 = d2[i];
400: if ( (u1&0xff000000) < (u2&0xff000000) ) return 0;
401: if ( (u1&0xff0000) < (u2&0xff0000) ) return 0;
402: if ( (u1&0xff00) < (u2&0xff00) ) return 0;
403: if ( (u1&0xff) < (u2&0xff) ) return 0;
404: }
405: return 1;
406: break;
407: case 16:
1.41 noro 408: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 409: u1 = d1[i]; u2 = d2[i];
410: if ( (u1&0xffff0000) < (u2&0xffff0000) ) return 0;
411: if ( (u1&0xffff) < (u2&0xffff) ) return 0;
412: }
413: return 1;
414: break;
415: case 32:
1.41 noro 416: for ( i = nd_exporigin; i < nd_wpd; i++ )
1.1 noro 417: if ( d1[i] < d2[i] ) return 0;
418: return 1;
419: break;
420: default:
1.41 noro 421: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 422: u1 = d1[i]; u2 = d2[i];
423: for ( j = 0; j < nd_epw; j++ )
424: if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0;
425: }
426: return 1;
427: }
428: }
429:
1.34 noro 430: void ndl_dehomogenize(unsigned int *d)
1.23 noro 431: {
432: unsigned int mask;
433: unsigned int h;
1.31 noro 434: int i,bits;
1.23 noro 435:
1.44 noro 436: if ( nd_blockmask ) {
437: h = GET_EXP(d,nd_nvar-1);
1.45 noro 438: XOR_EXP(d,nd_nvar-1,h);
1.44 noro 439: TD(d) -= h;
440: d[nd_exporigin-1] -= h;
441: } else {
442: if ( nd_isrlex ) {
443: if ( nd_bpe == 32 ) {
444: h = d[nd_exporigin];
445: for ( i = nd_exporigin+1; i < nd_wpd; i++ )
446: d[i-1] = d[i];
447: d[i-1] = 0;
448: TD(d) -= h;
449: } else {
450: bits = nd_epw*nd_bpe;
451: mask = bits==32?0xffffffff:((1<<(nd_epw*nd_bpe))-1);
452: h = (d[nd_exporigin]>>((nd_epw-1)*nd_bpe))&nd_mask0;
453: for ( i = nd_exporigin; i < nd_wpd; i++ )
454: d[i] = ((d[i]<<nd_bpe)&mask)
455: |(i+1<nd_wpd?((d[i+1]>>((nd_epw-1)*nd_bpe))&nd_mask0):0);
456: TD(d) -= h;
457: }
1.45 noro 458: } else {
459: h = GET_EXP(d,nd_nvar-1);
460: XOR_EXP(d,nd_nvar-1,h);
461: TD(d) -= h;
462: }
1.44 noro 463: }
1.23 noro 464: }
465:
1.1 noro 466: void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned int *d)
467: {
468: unsigned int t1,t2,u,u1,u2;
1.43 noro 469: int i,j,l;
1.1 noro 470:
471: switch ( nd_bpe ) {
472: case 4:
1.41 noro 473: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 474: u1 = d1[i]; u2 = d2[i];
475: t1 = (u1&0xf0000000); t2 = (u2&0xf0000000); u = t1>t2?t1:t2;
476: t1 = (u1&0xf000000); t2 = (u2&0xf000000); u |= t1>t2?t1:t2;
477: t1 = (u1&0xf00000); t2 = (u2&0xf00000); u |= t1>t2?t1:t2;
478: t1 = (u1&0xf0000); t2 = (u2&0xf0000); u |= t1>t2?t1:t2;
479: t1 = (u1&0xf000); t2 = (u2&0xf000); u |= t1>t2?t1:t2;
480: t1 = (u1&0xf00); t2 = (u2&0xf00); u |= t1>t2?t1:t2;
481: t1 = (u1&0xf0); t2 = (u2&0xf0); u |= t1>t2?t1:t2;
482: t1 = (u1&0xf); t2 = (u2&0xf); u |= t1>t2?t1:t2;
483: d[i] = u;
484: }
485: break;
486: case 6:
1.41 noro 487: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 488: u1 = d1[i]; u2 = d2[i];
489: t1 = (u1&0x3f000000); t2 = (u2&0x3f000000); u = t1>t2?t1:t2;
490: t1 = (u1&0xfc0000); t2 = (u2&0xfc0000); u |= t1>t2?t1:t2;
491: t1 = (u1&0x3f000); t2 = (u2&0x3f000); u |= t1>t2?t1:t2;
492: t1 = (u1&0xfc0); t2 = (u2&0xfc0); u |= t1>t2?t1:t2;
493: t1 = (u1&0x3f); t2 = (u2&0x3f); u |= t1>t2?t1:t2;
494: d[i] = u;
495: }
496: break;
497: case 8:
1.41 noro 498: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 499: u1 = d1[i]; u2 = d2[i];
500: t1 = (u1&0xff000000); t2 = (u2&0xff000000); u = t1>t2?t1:t2;
501: t1 = (u1&0xff0000); t2 = (u2&0xff0000); u |= t1>t2?t1:t2;
502: t1 = (u1&0xff00); t2 = (u2&0xff00); u |= t1>t2?t1:t2;
503: t1 = (u1&0xff); t2 = (u2&0xff); u |= t1>t2?t1:t2;
504: d[i] = u;
505: }
506: break;
507: case 16:
1.41 noro 508: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 509: u1 = d1[i]; u2 = d2[i];
510: t1 = (u1&0xffff0000); t2 = (u2&0xffff0000); u = t1>t2?t1:t2;
511: t1 = (u1&0xffff); t2 = (u2&0xffff); u |= t1>t2?t1:t2;
512: d[i] = u;
513: }
514: break;
515: case 32:
1.41 noro 516: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 517: u1 = d1[i]; u2 = d2[i];
518: d[i] = u1>u2?u1:u2;
519: }
520: break;
521: default:
1.41 noro 522: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 523: u1 = d1[i]; u2 = d2[i];
524: for ( j = 0, u = 0; j < nd_epw; j++ ) {
525: t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2;
526: }
527: d[i] = u;
528: }
529: break;
530: }
1.39 noro 531: TD(d) = ndl_weight(d);
1.43 noro 532: if ( nd_blockmask ) {
533: l = nd_blockmask->n;
534: for ( j = 0; j < l; j++ )
535: d[j+1] = ndl_weight_mask(d,j);
536: }
1.1 noro 537: }
538:
1.39 noro 539: int ndl_weight(unsigned int *d)
1.1 noro 540: {
541: unsigned int t,u;
542: int i,j;
543:
1.41 noro 544: for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 545: u = d[i];
546: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
547: t += (u&nd_mask0);
548: }
549: return t;
550: }
551:
1.43 noro 552: int ndl_weight_mask(unsigned int *d,int index)
553: {
554: unsigned int t,u;
555: unsigned int *mask;
556: int i,j;
557:
558: mask = nd_blockmask->mask[index];
559: for ( t = 0, i = nd_exporigin; i < nd_wpd; i++ ) {
560: u = d[i]&mask[i];
561: for ( j = 0; j < nd_epw; j++, u>>=nd_bpe )
562: t += (u&nd_mask0);
563: }
564: return t;
565: }
566:
567: int ndl_lex_compare(unsigned int *d1,unsigned int *d2)
1.1 noro 568: {
569: int i;
570:
1.41 noro 571: d1 += nd_exporigin;
572: d2 += nd_exporigin;
573: for ( i = nd_exporigin; i < nd_wpd; i++, d1++, d2++ )
1.1 noro 574: if ( *d1 > *d2 )
1.32 noro 575: return nd_isrlex ? -1 : 1;
1.1 noro 576: else if ( *d1 < *d2 )
1.32 noro 577: return nd_isrlex ? 1 : -1;
1.1 noro 578: return 0;
579: }
580:
1.43 noro 581: int ndl_block_compare(unsigned int *d1,unsigned int *d2)
582: {
583: int i,l,j,ord_o,ord_l;
584: struct order_pair *op;
1.44 noro 585: unsigned int t1,t2,m;
1.43 noro 586: unsigned int *mask;
587:
588: l = nd_blockmask->n;
589: op = nd_blockmask->order_pair;
590: for ( j = 0; j < l; j++ ) {
591: mask = nd_blockmask->mask[j];
592: ord_o = op[j].order;
593: if ( ord_o < 2 )
1.44 noro 594: if ( (t1=d1[j+1]) > (t2=d2[j+1]) ) return 1;
595: else if ( t1 < t2 ) return -1;
1.43 noro 596: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.44 noro 597: m = mask[i];
598: t1 = d1[i]&m;
599: t2 = d2[i]&m;
1.43 noro 600: if ( t1 > t2 )
601: return !ord_o ? -1 : 1;
602: else if ( t1 < t2 )
603: return !ord_o ? 1 : -1;
604: }
605: }
606: return 0;
607: }
608:
1.1 noro 609: INLINE int ndl_equal(unsigned int *d1,unsigned int *d2)
610: {
611: int i;
612:
1.41 noro 613: for ( i = 0; i < nd_wpd; i++ )
1.34 noro 614: if ( *d1++ != *d2++ )
1.1 noro 615: return 0;
616: return 1;
617: }
618:
1.6 noro 619: INLINE void ndl_copy(unsigned int *d1,unsigned int *d2)
620: {
621: int i;
622:
623: switch ( nd_wpd ) {
1.41 noro 624: case 2:
1.34 noro 625: TD(d2) = TD(d1);
626: d2[1] = d1[1];
1.6 noro 627: break;
1.41 noro 628: case 3:
1.34 noro 629: TD(d2) = TD(d1);
1.6 noro 630: d2[1] = d1[1];
1.34 noro 631: d2[2] = d1[2];
1.6 noro 632: break;
633: default:
1.41 noro 634: for ( i = 0; i < nd_wpd; i++ )
1.6 noro 635: d2[i] = d1[i];
636: break;
637: }
638: }
639:
1.1 noro 640: INLINE void ndl_add(unsigned int *d1,unsigned int *d2,unsigned int *d)
641: {
642: int i;
643:
1.43 noro 644: #if 1
1.6 noro 645: switch ( nd_wpd ) {
1.41 noro 646: case 2:
647: TD(d) = TD(d1)+TD(d2);
1.34 noro 648: d[1] = d1[1]+d2[1];
1.6 noro 649: break;
1.41 noro 650: case 3:
651: TD(d) = TD(d1)+TD(d2);
1.6 noro 652: d[1] = d1[1]+d2[1];
1.34 noro 653: d[2] = d1[2]+d2[2];
1.6 noro 654: break;
655: default:
1.43 noro 656: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i];
1.6 noro 657: break;
658: }
1.43 noro 659: #else
660: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]+d2[i];
661: #endif
1.6 noro 662: }
663:
1.34 noro 664: INLINE void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d)
1.6 noro 665: {
666: int i;
667:
1.43 noro 668: for ( i = 0; i < nd_wpd; i++ ) d[i] = d1[i]-d2[i];
1.1 noro 669: }
670:
671: int ndl_disjoint(unsigned int *d1,unsigned int *d2)
672: {
673: unsigned int t1,t2,u,u1,u2;
674: int i,j;
675:
676: switch ( nd_bpe ) {
677: case 4:
1.41 noro 678: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 679: u1 = d1[i]; u2 = d2[i];
680: t1 = u1&0xf0000000; t2 = u2&0xf0000000; if ( t1&&t2 ) return 0;
681: t1 = u1&0xf000000; t2 = u2&0xf000000; if ( t1&&t2 ) return 0;
682: t1 = u1&0xf00000; t2 = u2&0xf00000; if ( t1&&t2 ) return 0;
683: t1 = u1&0xf0000; t2 = u2&0xf0000; if ( t1&&t2 ) return 0;
684: t1 = u1&0xf000; t2 = u2&0xf000; if ( t1&&t2 ) return 0;
685: t1 = u1&0xf00; t2 = u2&0xf00; if ( t1&&t2 ) return 0;
686: t1 = u1&0xf0; t2 = u2&0xf0; if ( t1&&t2 ) return 0;
687: t1 = u1&0xf; t2 = u2&0xf; if ( t1&&t2 ) return 0;
688: }
689: return 1;
690: break;
691: case 6:
1.41 noro 692: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 693: u1 = d1[i]; u2 = d2[i];
694: t1 = u1&0x3f000000; t2 = u2&0x3f000000; if ( t1&&t2 ) return 0;
695: t1 = u1&0xfc0000; t2 = u2&0xfc0000; if ( t1&&t2 ) return 0;
696: t1 = u1&0x3f000; t2 = u2&0x3f000; if ( t1&&t2 ) return 0;
697: t1 = u1&0xfc0; t2 = u2&0xfc0; if ( t1&&t2 ) return 0;
698: t1 = u1&0x3f; t2 = u2&0x3f; if ( t1&&t2 ) return 0;
699: }
700: return 1;
701: break;
702: case 8:
1.41 noro 703: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 704: u1 = d1[i]; u2 = d2[i];
705: t1 = u1&0xff000000; t2 = u2&0xff000000; if ( t1&&t2 ) return 0;
706: t1 = u1&0xff0000; t2 = u2&0xff0000; if ( t1&&t2 ) return 0;
707: t1 = u1&0xff00; t2 = u2&0xff00; if ( t1&&t2 ) return 0;
708: t1 = u1&0xff; t2 = u2&0xff; if ( t1&&t2 ) return 0;
709: }
710: return 1;
711: break;
712: case 16:
1.41 noro 713: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 714: u1 = d1[i]; u2 = d2[i];
715: t1 = u1&0xffff0000; t2 = u2&0xffff0000; if ( t1&&t2 ) return 0;
716: t1 = u1&0xffff; t2 = u2&0xffff; if ( t1&&t2 ) return 0;
717: }
718: return 1;
719: break;
720: case 32:
1.41 noro 721: for ( i = nd_exporigin; i < nd_wpd; i++ )
1.1 noro 722: if ( d1[i] && d2[i] ) return 0;
723: return 1;
724: break;
725: default:
1.41 noro 726: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.1 noro 727: u1 = d1[i]; u2 = d2[i];
728: for ( j = 0; j < nd_epw; j++ ) {
729: if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0;
730: u1 >>= nd_bpe; u2 >>= nd_bpe;
731: }
732: }
733: return 1;
734: break;
735: }
736: }
737:
1.5 noro 738: int ndl_check_bound2(int index,unsigned int *d2)
1.1 noro 739: {
1.5 noro 740: unsigned int u2;
741: unsigned int *d1;
742: int i,j,ind,k;
1.1 noro 743:
1.5 noro 744: d1 = nd_bound[index];
745: ind = 0;
746: switch ( nd_bpe ) {
747: case 4:
1.41 noro 748: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 749: u2 = d2[i];
750: if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1;
751: if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1;
752: if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1;
753: if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1;
754: if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1;
755: if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1;
756: if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1;
757: if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1;
758: }
759: return 0;
760: break;
761: case 6:
1.41 noro 762: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 763: u2 = d2[i];
764: if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1;
765: if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1;
766: if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1;
767: if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1;
768: if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1;
769: }
770: return 0;
771: break;
772: case 8:
1.41 noro 773: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 774: u2 = d2[i];
775: if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1;
776: if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1;
777: if ( d1[ind++]+((u2>>8)&0xff) >= 0x100 ) return 1;
778: if ( d1[ind++]+(u2&0xff) >= 0x100 ) return 1;
779: }
780: return 0;
781: break;
782: case 16:
1.41 noro 783: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 784: u2 = d2[i];
785: if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1;
786: if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1;
787: }
788: return 0;
789: break;
790: case 32:
1.41 noro 791: for ( i = nd_exporigin; i < nd_wpd; i++ )
1.5 noro 792: if ( d1[i]+d2[i]<d1[i] ) return 1;
793: return 0;
794: break;
795: default:
1.41 noro 796: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.5 noro 797: u2 = d2[i];
798: k = (nd_epw-1)*nd_bpe;
799: for ( j = 0; j < nd_epw; j++, k -= nd_bpe )
800: if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1;
801: }
802: return 0;
803: break;
804: }
1.1 noro 805: }
806:
1.23 noro 807: int ndl_check_bound2_direct(unsigned int *d1,unsigned int *d2)
808: {
1.45 noro 809: unsigned int u2;
810: int i,j,ind,k;
1.23 noro 811:
1.45 noro 812: ind = 0;
1.23 noro 813: switch ( nd_bpe ) {
814: case 4:
1.41 noro 815: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.45 noro 816: u2 = d2[i];
817: if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1;
818: if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1;
819: if ( d1[ind++]+((u2>>20)&0xf) >= 0x10 ) return 1;
820: if ( d1[ind++]+((u2>>16)&0xf) >= 0x10 ) return 1;
821: if ( d1[ind++]+((u2>>12)&0xf) >= 0x10 ) return 1;
822: if ( d1[ind++]+((u2>>8)&0xf) >= 0x10 ) return 1;
823: if ( d1[ind++]+((u2>>4)&0xf) >= 0x10 ) return 1;
824: if ( d1[ind++]+(u2&0xf) >= 0x10 ) return 1;
1.23 noro 825: }
826: return 0;
827: break;
828: case 6:
1.41 noro 829: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.45 noro 830: u2 = d2[i];
831: if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1;
832: if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1;
833: if ( d1[ind++]+((u2>>12)&0x3f) >= 0x40 ) return 1;
834: if ( d1[ind++]+((u2>>6)&0x3f) >= 0x40 ) return 1;
835: if ( d1[ind++]+(u2&0x3f) >= 0x40 ) return 1;
1.23 noro 836: }
837: return 0;
838: break;
839: case 8:
1.41 noro 840: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.45 noro 841: u2 = d2[i];
842: if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1;
843: if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1;
844: if ( d1[ind++]+((u2>>8)&0xff) >= 0x100 ) return 1;
845: if ( d1[ind++]+(u2&0xff) >= 0x100 ) return 1;
1.23 noro 846: }
847: return 0;
848: break;
849: case 16:
1.41 noro 850: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.45 noro 851: u2 = d2[i];
852: if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1;
853: if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1;
1.23 noro 854: }
855: return 0;
856: break;
857: case 32:
1.41 noro 858: for ( i = nd_exporigin; i < nd_wpd; i++ )
1.23 noro 859: if ( d1[i]+d2[i]<d1[i] ) return 1;
860: return 0;
861: break;
862: default:
1.41 noro 863: for ( i = nd_exporigin; i < nd_wpd; i++ ) {
1.45 noro 864: u2 = d2[i];
1.23 noro 865: k = (nd_epw-1)*nd_bpe;
866: for ( j = 0; j < nd_epw; j++, k -= nd_bpe )
1.45 noro 867: if ( d1[ind++]+((u2>>k)&nd_mask0) > nd_mask0 ) return 1;
1.23 noro 868: }
869: return 0;
870: break;
871: }
872: }
873:
1.34 noro 874: INLINE int ndl_hash_value(unsigned int *d)
1.1 noro 875: {
876: int i;
877: int r;
878:
1.34 noro 879: r = 0;
1.41 noro 880: for ( i = 0; i < nd_wpd; i++ )
1.1 noro 881: r = ((r<<16)+d[i])%REDTAB_LEN;
882: return r;
883: }
884:
1.9 noro 885: INLINE int nd_find_reducer(ND g)
1.1 noro 886: {
1.13 noro 887: RHist r;
1.34 noro 888: unsigned int *dg;
1.6 noro 889: int d,k,i;
1.1 noro 890:
1.34 noro 891: dg = HDL(g);
1.39 noro 892: #if 1
1.34 noro 893: d = ndl_hash_value(HDL(g));
1.13 noro 894: for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) {
1.34 noro 895: if ( ndl_equal(dg,DL(r)) ) {
1.1 noro 896: if ( k > 0 ) nd_notfirst++;
897: nd_found++;
1.13 noro 898: return r->index;
1.1 noro 899: }
900: }
1.39 noro 901: #endif
1.13 noro 902: if ( Reverse )
903: for ( i = nd_psn-1; i >= 0; i-- ) {
904: r = nd_psh[i];
1.34 noro 905: if ( ndl_reducible(dg,DL(r)) ) {
1.13 noro 906: nd_create++;
1.34 noro 907: nd_append_red(dg,i);
1.13 noro 908: return i;
909: }
910: }
911: else
912: for ( i = 0; i < nd_psn; i++ ) {
913: r = nd_psh[i];
1.34 noro 914: if ( ndl_reducible(dg,DL(r)) ) {
1.13 noro 915: nd_create++;
1.34 noro 916: nd_append_red(dg,i);
1.13 noro 917: return i;
918: }
1.1 noro 919: }
1.6 noro 920: return -1;
1.1 noro 921: }
922:
1.23 noro 923: INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len)
924: {
925: NDV r;
1.31 noro 926: RHist s;
927: int d,k,i;
1.23 noro 928:
929: if ( Reverse )
930: for ( i = len-1; i >= 0; i-- ) {
931: r = ps[i];
1.45 noro 932: if ( ndl_reducible(HDL(g),HDL(r)) )
1.23 noro 933: return i;
934: }
935: else
936: for ( i = 0; i < len; i++ ) {
937: r = ps[i];
1.45 noro 938: if ( ndl_reducible(HDL(g),HDL(r)) )
1.23 noro 939: return i;
940: }
941: return -1;
942: }
943:
1.31 noro 944: ND nd_add(int mod,ND p1,ND p2)
1.1 noro 945: {
946: int n,c;
1.34 noro 947: int t,can,td1,td2;
1.1 noro 948: ND r;
949: NM m1,m2,mr0,mr,s;
950:
1.34 noro 951: if ( !p1 ) return p2;
952: else if ( !p2 ) return p1;
953: else if ( !mod ) return nd_add_q(p1,p2);
1.1 noro 954: else {
1.30 noro 955: can = 0;
1.1 noro 956: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1.34 noro 957: c = DL_COMPARE(DL(m1),DL(m2));
1.1 noro 958: switch ( c ) {
959: case 0:
1.19 noro 960: t = ((CM(m1))+(CM(m2))) - mod;
1.34 noro 961: if ( t < 0 ) t += mod;
1.1 noro 962: s = m1; m1 = NEXT(m1);
963: if ( t ) {
1.34 noro 964: can++; NEXTNM2(mr0,mr,s); CM(mr) = (t);
1.1 noro 965: } else {
1.34 noro 966: can += 2; FREENM(s);
1.1 noro 967: }
968: s = m2; m2 = NEXT(m2); FREENM(s);
969: break;
970: case 1:
971: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
972: break;
973: case -1:
974: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
975: break;
976: }
977: }
978: if ( !mr0 )
1.34 noro 979: if ( m1 ) mr0 = m1;
980: else if ( m2 ) mr0 = m2;
981: else return 0;
982: else if ( m1 ) NEXT(mr) = m1;
983: else if ( m2 ) NEXT(mr) = m2;
984: else NEXT(mr) = 0;
1.1 noro 985: BDY(p1) = mr0;
1.14 noro 986: SG(p1) = MAX(SG(p1),SG(p2));
1.31 noro 987: LEN(p1) = LEN(p1)+LEN(p2)-can;
1.1 noro 988: FREEND(p2);
989: return p1;
990: }
991: }
992:
1.31 noro 993: ND nd_add_q(ND p1,ND p2)
1.17 noro 994: {
1.30 noro 995: int n,c,can;
1.17 noro 996: ND r;
997: NM m1,m2,mr0,mr,s;
998: Q t;
999:
1.34 noro 1000: if ( !p1 ) return p2;
1001: else if ( !p2 ) return p1;
1.31 noro 1002: else {
1.30 noro 1003: can = 0;
1.17 noro 1004: for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) {
1.34 noro 1005: c = DL_COMPARE(DL(m1),DL(m2));
1.17 noro 1006: switch ( c ) {
1007: case 0:
1008: addq(CQ(m1),CQ(m2),&t);
1009: s = m1; m1 = NEXT(m1);
1010: if ( t ) {
1.34 noro 1011: can++; NEXTNM2(mr0,mr,s); CQ(mr) = (t);
1.17 noro 1012: } else {
1.34 noro 1013: can += 2; FREENM(s);
1.17 noro 1014: }
1015: s = m2; m2 = NEXT(m2); FREENM(s);
1016: break;
1017: case 1:
1018: s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s);
1019: break;
1020: case -1:
1021: s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s);
1022: break;
1023: }
1024: }
1025: if ( !mr0 )
1.34 noro 1026: if ( m1 ) mr0 = m1;
1027: else if ( m2 ) mr0 = m2;
1028: else return 0;
1029: else if ( m1 ) NEXT(mr) = m1;
1030: else if ( m2 ) NEXT(mr) = m2;
1031: else NEXT(mr) = 0;
1.17 noro 1032: BDY(p1) = mr0;
1033: SG(p1) = MAX(SG(p1),SG(p2));
1.31 noro 1034: LEN(p1) = LEN(p1)+LEN(p2)-can;
1.17 noro 1035: FREEND(p2);
1036: return p1;
1037: }
1038: }
1039:
1.1 noro 1040: /* ret=1 : success, ret=0 : overflow */
1.16 noro 1041: int nd_nf(int mod,ND g,int full,ND *rp)
1.1 noro 1042: {
1.11 noro 1043: ND d;
1.1 noro 1044: NM m,mrd,tail;
1.7 noro 1045: NM mul;
1.10 noro 1046: int n,sugar,psugar,sugar0,stat,index;
1.30 noro 1047: int c,c1,c2,dummy;
1.17 noro 1048: RHist h;
1.11 noro 1049: NDV p,red;
1.16 noro 1050: Q cg,cred,gcd;
1.21 noro 1051: double hmag;
1.1 noro 1052:
1053: if ( !g ) {
1054: *rp = 0;
1055: return 1;
1056: }
1.34 noro 1057: if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1.21 noro 1058:
1.14 noro 1059: sugar0 = sugar = SG(g);
1.1 noro 1060: n = NV(g);
1.41 noro 1061: mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int));
1.1 noro 1062: for ( d = 0; g; ) {
1.6 noro 1063: index = nd_find_reducer(g);
1064: if ( index >= 0 ) {
1.17 noro 1065: h = nd_psh[index];
1066: ndl_sub(HDL(g),DL(h),DL(mul));
1.14 noro 1067: if ( ndl_check_bound2(index,DL(mul)) ) {
1.6 noro 1068: nd_free(g); nd_free(d);
1069: return 0;
1070: }
1.16 noro 1071: if ( mod ) {
1.17 noro 1072: p = nd_ps[index];
1.19 noro 1073: c1 = invm(HCM(p),mod); c2 = mod-HCM(g);
1074: DMAR(c1,c2,0,mod,c); CM(mul) = c;
1.16 noro 1075: } else {
1.20 noro 1076: p = nd_psq[index];
1.17 noro 1077: igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);
1.16 noro 1078: chsgnq(cg,&CQ(mul));
1.20 noro 1079: nd_mul_c_q(d,cred); nd_mul_c_q(g,cred);
1.16 noro 1080: }
1.31 noro 1081: g = nd_add(mod,g,ndv_mul_nm(mod,p,mul));
1.34 noro 1082: sugar = MAX(sugar,SG(p)+TD(DL(mul)));
1.22 noro 1083: if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) {
1.21 noro 1084: nd_removecont2(d,g);
1085: hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1086: }
1.1 noro 1087: } else if ( !full ) {
1088: *rp = g;
1089: return 1;
1090: } else {
1091: m = BDY(g);
1092: if ( NEXT(m) ) {
1.34 noro 1093: BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--;
1.1 noro 1094: } else {
1095: FREEND(g); g = 0;
1096: }
1097: if ( d ) {
1.34 noro 1098: NEXT(tail)=m; tail=m; LEN(d)++;
1.1 noro 1099: } else {
1.34 noro 1100: MKND(n,m,1,d); tail = BDY(d);
1.1 noro 1101: }
1102: }
1103: }
1.34 noro 1104: if ( d ) SG(d) = sugar;
1.1 noro 1105: *rp = d;
1106: return 1;
1107: }
1.28 noro 1108:
1.30 noro 1109: int nd_nf_pbucket(int mod,ND g,int full,ND *rp)
1.25 noro 1110: {
1111: int hindex,index;
1112: NDV p;
1113: ND u,d,red;
1114: NODE l;
1.31 noro 1115: NM mul,m,mrd,tail;
1.25 noro 1116: int sugar,psugar,n,h_reducible;
1117: PGeoBucket bucket;
1118: int c,c1,c2;
1.26 noro 1119: Q cg,cred,gcd,zzz;
1.25 noro 1120: RHist h;
1.28 noro 1121: double hmag,gmag;
1.25 noro 1122:
1123: if ( !g ) {
1124: *rp = 0;
1125: return 1;
1126: }
1127: sugar = SG(g);
1128: n = NV(g);
1.34 noro 1129: if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1.25 noro 1130: bucket = create_pbucket();
1.31 noro 1131: add_pbucket(mod,bucket,g);
1.25 noro 1132: d = 0;
1.41 noro 1133: mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int));
1.25 noro 1134: while ( 1 ) {
1.26 noro 1135: hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket);
1.25 noro 1136: if ( hindex < 0 ) {
1.34 noro 1137: if ( d ) SG(d) = sugar;
1.25 noro 1138: *rp = d;
1139: return 1;
1140: }
1141: g = bucket->body[hindex];
1142: index = nd_find_reducer(g);
1143: if ( index >= 0 ) {
1144: h = nd_psh[index];
1145: ndl_sub(HDL(g),DL(h),DL(mul));
1146: if ( ndl_check_bound2(index,DL(mul)) ) {
1.26 noro 1147: nd_free(d);
1.25 noro 1148: free_pbucket(bucket);
1149: *rp = 0;
1150: return 0;
1151: }
1152: if ( mod ) {
1153: p = nd_ps[index];
1154: c1 = invm(HCM(p),mod); c2 = mod-HCM(g);
1155: DMAR(c1,c2,0,mod,c); CM(mul) = c;
1156: } else {
1157: p = nd_psq[index];
1158: igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);
1159: chsgnq(cg,&CQ(mul));
1.26 noro 1160: nd_mul_c_q(d,cred);
1161: mulq_pbucket(bucket,cred);
1162: g = bucket->body[hindex];
1.28 noro 1163: gmag = (double)p_mag((P)HCQ(g));
1.25 noro 1164: }
1165: red = ndv_mul_nm(mod,p,mul);
1166: bucket->body[hindex] = nd_remove_head(g);
1167: red = nd_remove_head(red);
1.31 noro 1168: add_pbucket(mod,bucket,red);
1.34 noro 1169: psugar = SG(p)+TD(DL(mul));
1170: sugar = MAX(sugar,psugar);
1.28 noro 1171: if ( !mod && hmag && (gmag > hmag) ) {
1172: g = normalize_pbucket(mod,bucket);
1173: if ( !g ) {
1.34 noro 1174: if ( d ) SG(d) = sugar;
1.28 noro 1175: *rp = d;
1176: return 1;
1177: }
1178: nd_removecont2(d,g);
1179: hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1.31 noro 1180: add_pbucket(mod,bucket,g);
1.28 noro 1181: }
1.25 noro 1182: } else if ( !full ) {
1183: g = normalize_pbucket(mod,bucket);
1.34 noro 1184: if ( g ) SG(g) = sugar;
1.25 noro 1185: *rp = g;
1186: return 1;
1187: } else {
1188: m = BDY(g);
1189: if ( NEXT(m) ) {
1.34 noro 1190: BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--;
1.25 noro 1191: } else {
1192: FREEND(g); g = 0;
1193: }
1194: bucket->body[hindex] = g;
1195: NEXT(m) = 0;
1196: if ( d ) {
1.34 noro 1197: NEXT(tail)=m; tail=m; LEN(d)++;
1.25 noro 1198: } else {
1.34 noro 1199: MKND(n,m,1,d); tail = BDY(d);
1.25 noro 1200: }
1201: }
1202: }
1203: }
1.27 noro 1204:
1.45 noro 1205: int nd_nf_direct(int mod,ND g,BaseSet base,int full,ND *rp)
1.23 noro 1206: {
1.30 noro 1207: ND d;
1208: NM m,mrd,tail;
1209: NM mul;
1.45 noro 1210: NDV *ps;
1211: int n,sugar,psugar,sugar0,stat,index,len;
1.31 noro 1212: int c,c1,c2;
1.45 noro 1213: unsigned int **bound;
1.30 noro 1214: RHist h;
1215: NDV p,red;
1216: Q cg,cred,gcd;
1217: double hmag;
1218:
1219: if ( !g ) {
1220: *rp = 0;
1221: return 1;
1222: }
1223: #if 0
1224: if ( !mod )
1225: hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1226: #else
1227: /* XXX */
1228: hmag = 0;
1229: #endif
1230:
1.45 noro 1231: ps = base->ps;
1232: bound = base->bound;
1233: len = base->len;
1.30 noro 1234: sugar0 = sugar = SG(g);
1235: n = NV(g);
1.41 noro 1236: mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int));
1.30 noro 1237: for ( d = 0; g; ) {
1238: index = nd_find_reducer_direct(g,ps,len);
1239: if ( index >= 0 ) {
1240: p = ps[index];
1241: ndl_sub(HDL(g),HDL(p),DL(mul));
1.45 noro 1242: if ( ndl_check_bound2_direct(bound[index],DL(mul)) ) {
1.30 noro 1243: nd_free(g); nd_free(d);
1244: return 0;
1245: }
1246: if ( mod ) {
1247: c1 = invm(HCM(p),mod); c2 = mod-HCM(g);
1248: DMAR(c1,c2,0,mod,c); CM(mul) = c;
1249: } else {
1250: igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred);
1251: chsgnq(cg,&CQ(mul));
1252: nd_mul_c_q(d,cred); nd_mul_c_q(g,cred);
1253: }
1.31 noro 1254: g = nd_add(mod,g,ndv_mul_nm(mod,p,mul));
1.34 noro 1255: sugar = MAX(sugar,SG(p)+TD(DL(mul)));
1.30 noro 1256: if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) {
1257: nd_removecont2(d,g);
1258: hmag = ((double)p_mag((P)HCQ(g)))*nd_scale;
1259: }
1260: } else if ( !full ) {
1261: *rp = g;
1262: return 1;
1263: } else {
1264: m = BDY(g);
1265: if ( NEXT(m) ) {
1.34 noro 1266: BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--;
1.30 noro 1267: } else {
1268: FREEND(g); g = 0;
1269: }
1270: if ( d ) {
1.34 noro 1271: NEXT(tail)=m; tail=m; LEN(d)++;
1.30 noro 1272: } else {
1.34 noro 1273: MKND(n,m,1,d); tail = BDY(d);
1.30 noro 1274: }
1275: }
1276: }
1.34 noro 1277: if ( d ) SG(d) = sugar;
1.30 noro 1278: *rp = d;
1279: return 1;
1280: }
1281:
1.28 noro 1282: /* input : list of DP, cand : list of DP */
1283:
1284: int nd_check_candidate(NODE input,NODE cand)
1285: {
1286: int n,i,stat;
1287: ND nf,d;
1.45 noro 1288: NODE t,s;
1289:
1290: #if 0
1291: for ( t = 0; cand; cand = NEXT(cand) ) {
1292: MKNODE(s,BDY(cand),t); t = s;
1293: }
1294: cand = t;
1295: #endif
1.28 noro 1296:
1.39 noro 1297: nd_setup(0,0,cand);
1.31 noro 1298: n = length(cand);
1.28 noro 1299:
1300: /* membercheck : list is a subset of Id(cand) ? */
1301: for ( t = input; t; t = NEXT(t) ) {
1.45 noro 1302: again:
1.28 noro 1303: d = dptond(0,(DP)BDY(t));
1.45 noro 1304: stat = nd_nf(0,d,0,&nf);
1305: if ( !stat ) {
1306: nd_reconstruct(0,0,0);
1307: goto again;
1308: } else if ( nf ) return 0;
1309: printf("."); fflush(stdout);
1.28 noro 1310: }
1.45 noro 1311: printf("\n");
1.28 noro 1312: /* gbcheck : cand is a GB of Id(cand) ? */
1.34 noro 1313: if ( !nd_gb(0,1) ) return 0;
1.28 noro 1314: /* XXX */
1.23 noro 1315: return 1;
1316: }
1.1 noro 1317:
1318: ND nd_remove_head(ND p)
1319: {
1320: NM m;
1321:
1322: m = BDY(p);
1323: if ( !NEXT(m) ) {
1.34 noro 1324: FREEND(p); p = 0;
1.31 noro 1325: } else {
1.34 noro 1326: BDY(p) = NEXT(m); LEN(p)--;
1.31 noro 1327: }
1.1 noro 1328: FREENM(m);
1329: return p;
1330: }
1331:
1332: PGeoBucket create_pbucket()
1333: {
1334: PGeoBucket g;
1335:
1336: g = CALLOC(1,sizeof(struct oPGeoBucket));
1337: g->m = -1;
1338: return g;
1339: }
1340:
1.25 noro 1341: void free_pbucket(PGeoBucket b) {
1342: int i;
1343:
1.26 noro 1344: for ( i = 0; i <= b->m; i++ )
1.25 noro 1345: if ( b->body[i] ) {
1346: nd_free(b->body[i]);
1347: b->body[i] = 0;
1348: }
1349: GC_free(b);
1350: }
1351:
1.31 noro 1352: void add_pbucket(int mod,PGeoBucket g,ND d)
1.1 noro 1353: {
1.31 noro 1354: int l,i,k,m;
1.1 noro 1355:
1.31 noro 1356: if ( !d )
1357: return;
1358: l = LEN(d);
1.29 noro 1359: for ( k = 0, m = 1; l > m; k++, m <<= 1 );
1360: /* 2^(k-1) < l <= 2^k (=m) */
1.31 noro 1361: d = nd_add(mod,g->body[k],d);
1362: for ( ; d && LEN(d) > m; k++, m <<= 1 ) {
1.1 noro 1363: g->body[k] = 0;
1.31 noro 1364: d = nd_add(mod,g->body[k+1],d);
1.1 noro 1365: }
1366: g->body[k] = d;
1367: g->m = MAX(g->m,k);
1368: }
1369:
1.26 noro 1370: void mulq_pbucket(PGeoBucket g,Q c)
1371: {
1372: int k;
1373:
1374: for ( k = 0; k <= g->m; k++ )
1375: nd_mul_c_q(g->body[k],c);
1376: }
1377:
1.19 noro 1378: int head_pbucket(int mod,PGeoBucket g)
1.1 noro 1379: {
1380: int j,i,c,k,nv,sum;
1381: unsigned int *di,*dj;
1382: ND gi,gj;
1383:
1384: k = g->m;
1385: while ( 1 ) {
1386: j = -1;
1387: for ( i = 0; i <= k; i++ ) {
1388: if ( !(gi = g->body[i]) )
1389: continue;
1390: if ( j < 0 ) {
1391: j = i;
1392: gj = g->body[j];
1393: dj = HDL(gj);
1.14 noro 1394: sum = HCM(gj);
1.1 noro 1395: } else {
1.34 noro 1396: c = DL_COMPARE(HDL(gi),dj);
1.1 noro 1397: if ( c > 0 ) {
1.34 noro 1398: if ( sum ) HCM(gj) = sum;
1399: else g->body[j] = nd_remove_head(gj);
1.1 noro 1400: j = i;
1401: gj = g->body[j];
1402: dj = HDL(gj);
1.14 noro 1403: sum = HCM(gj);
1.1 noro 1404: } else if ( c == 0 ) {
1.19 noro 1405: sum = sum+HCM(gi)-mod;
1.34 noro 1406: if ( sum < 0 ) sum += mod;
1.1 noro 1407: g->body[i] = nd_remove_head(gi);
1408: }
1409: }
1410: }
1.34 noro 1411: if ( j < 0 ) return -1;
1.1 noro 1412: else if ( sum ) {
1.14 noro 1413: HCM(gj) = sum;
1.26 noro 1414: return j;
1.31 noro 1415: } else
1.26 noro 1416: g->body[j] = nd_remove_head(gj);
1417: }
1418: }
1419:
1420: int head_pbucket_q(PGeoBucket g)
1421: {
1422: int j,i,c,k,nv;
1423: Q sum,t;
1424: ND gi,gj;
1425:
1426: k = g->m;
1427: while ( 1 ) {
1428: j = -1;
1429: for ( i = 0; i <= k; i++ ) {
1.34 noro 1430: if ( !(gi = g->body[i]) ) continue;
1.26 noro 1431: if ( j < 0 ) {
1432: j = i;
1433: gj = g->body[j];
1434: sum = HCQ(gj);
1435: } else {
1436: nv = NV(gi);
1.34 noro 1437: c = DL_COMPARE(HDL(gi),HDL(gj));
1.26 noro 1438: if ( c > 0 ) {
1.34 noro 1439: if ( sum ) HCQ(gj) = sum;
1440: else g->body[j] = nd_remove_head(gj);
1.26 noro 1441: j = i;
1442: gj = g->body[j];
1443: sum = HCQ(gj);
1444: } else if ( c == 0 ) {
1445: addq(sum,HCQ(gi),&t);
1446: sum = t;
1447: g->body[i] = nd_remove_head(gi);
1448: }
1449: }
1450: }
1.34 noro 1451: if ( j < 0 ) return -1;
1.26 noro 1452: else if ( sum ) {
1453: HCQ(gj) = sum;
1.1 noro 1454: return j;
1.31 noro 1455: } else
1.1 noro 1456: g->body[j] = nd_remove_head(gj);
1457: }
1458: }
1459:
1.25 noro 1460: ND normalize_pbucket(int mod,PGeoBucket g)
1.1 noro 1461: {
1.31 noro 1462: int i;
1.1 noro 1463: ND r,t;
1464:
1465: r = 0;
1.28 noro 1466: for ( i = 0; i <= g->m; i++ ) {
1.31 noro 1467: r = nd_add(mod,r,g->body[i]);
1.28 noro 1468: g->body[i] = 0;
1469: }
1470: g->m = -1;
1.1 noro 1471: return r;
1472: }
1473:
1.27 noro 1474: /* return value = 0 => input is not a GB */
1475:
1476: NODE nd_gb(int m,int checkonly)
1.1 noro 1477: {
1478: int i,nh,sugar,stat;
1.23 noro 1479: NODE r,g,t;
1.1 noro 1480: ND_pairs d;
1481: ND_pairs l;
1482: ND h,nf;
1483:
1.23 noro 1484: g = 0; d = 0;
1485: for ( i = 0; i < nd_psn; i++ ) {
1.1 noro 1486: d = update_pairs(d,g,i);
1487: g = update_base(g,i);
1488: }
1489: sugar = 0;
1490: while ( d ) {
1491: again:
1492: l = nd_minp(d,&d);
1.14 noro 1493: if ( SG(l) != sugar ) {
1494: sugar = SG(l);
1.1 noro 1495: fprintf(asir_out,"%d",sugar);
1496: }
1.16 noro 1497: stat = nd_sp(m,l,&h);
1.1 noro 1498: if ( !stat ) {
1499: NEXT(l) = d; d = l;
1.20 noro 1500: d = nd_reconstruct(m,0,d);
1.1 noro 1501: goto again;
1502: }
1.41 noro 1503: #if USE_GEOBUCKET
1.30 noro 1504: stat = m?nd_nf_pbucket(m,h,!Top,&nf):nd_nf(m,h,!Top,&nf);
1.41 noro 1505: #else
1506: stat = nd_nf(m,h,!Top,&nf);
1507: #endif
1.1 noro 1508: if ( !stat ) {
1509: NEXT(l) = d; d = l;
1.20 noro 1510: d = nd_reconstruct(m,0,d);
1.1 noro 1511: goto again;
1512: } else if ( nf ) {
1.27 noro 1513: if ( checkonly ) return 0;
1.1 noro 1514: printf("+"); fflush(stdout);
1.39 noro 1515: nh = m?nd_newps(m,nf,0):nd_newps(m,0,nf);
1.1 noro 1516: d = update_pairs(d,g,nh);
1517: g = update_base(g,nh);
1518: FREENDP(l);
1519: } else {
1520: printf("."); fflush(stdout);
1521: FREENDP(l);
1522: }
1523: }
1.23 noro 1524: if ( m )
1.34 noro 1525: for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_ps[(int)BDY(t)];
1.23 noro 1526: else
1.34 noro 1527: for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_psq[(int)BDY(t)];
1.1 noro 1528: return g;
1529: }
1530:
1.23 noro 1531: NODE nd_gb_trace(int m)
1.20 noro 1532: {
1533: int i,nh,sugar,stat;
1.23 noro 1534: NODE r,g,t;
1.20 noro 1535: ND_pairs d;
1536: ND_pairs l;
1537: ND h,nf,nfq;
1538:
1.23 noro 1539: g = 0; d = 0;
1540: for ( i = 0; i < nd_psn; i++ ) {
1.20 noro 1541: d = update_pairs(d,g,i);
1542: g = update_base(g,i);
1543: }
1544: sugar = 0;
1545: while ( d ) {
1546: again:
1547: l = nd_minp(d,&d);
1548: if ( SG(l) != sugar ) {
1549: sugar = SG(l);
1550: fprintf(asir_out,"%d",sugar);
1551: }
1552: stat = nd_sp(m,l,&h);
1553: if ( !stat ) {
1554: NEXT(l) = d; d = l;
1555: d = nd_reconstruct(m,1,d);
1556: goto again;
1557: }
1.41 noro 1558: #if USE_GEOBUCKET
1.30 noro 1559: stat = nd_nf_pbucket(m,h,!Top,&nf);
1.41 noro 1560: #else
1561: stat = nd_nf(m,h,!Top,&nf);
1562: #endif
1.20 noro 1563: if ( !stat ) {
1564: NEXT(l) = d; d = l;
1565: d = nd_reconstruct(m,1,d);
1566: goto again;
1567: } else if ( nf ) {
1568: /* overflow does not occur */
1569: nd_sp(0,l,&h);
1570: nd_nf(0,h,!Top,&nfq);
1571: if ( nfq ) {
1572: printf("+"); fflush(stdout);
1.39 noro 1573: nh = nd_newps(m,nf,nfq);
1.27 noro 1574: /* failure; m|HC(nfq) */
1.38 noro 1575: if ( nh < 0 ) return 0;
1.20 noro 1576: d = update_pairs(d,g,nh);
1577: g = update_base(g,nh);
1578: } else {
1579: printf("*"); fflush(stdout);
1580: }
1581: } else {
1582: printf("."); fflush(stdout);
1583: }
1584: FREENDP(l);
1585: }
1.23 noro 1586: for ( t = g; t; t = NEXT(t) )
1587: BDY(t) = (pointer)nd_psq[(int)BDY(t)];
1.20 noro 1588: return g;
1589: }
1590:
1.23 noro 1591: int ndv_compare(NDV *p1,NDV *p2)
1592: {
1.34 noro 1593: return DL_COMPARE(HDL(*p1),HDL(*p2));
1.23 noro 1594: }
1595:
1596: int ndv_compare_rev(NDV *p1,NDV *p2)
1597: {
1.34 noro 1598: return -DL_COMPARE(HDL(*p1),HDL(*p2));
1.23 noro 1599: }
1600:
1601: NODE nd_reduceall(int m,NODE f)
1602: {
1603: int i,j,n,stat;
1604: NDV *w,*ps;
1605: ND nf,g;
1606: NODE t,a0,a;
1.45 noro 1607: struct oBaseSet base;
1608: unsigned int **bound;
1.23 noro 1609:
1610: for ( n = 0, t = f; t; t = NEXT(t), n++ );
1611: ps = (NDV *)ALLOCA(n*sizeof(NDV));
1.45 noro 1612: bound = (unsigned int **)ALLOCA(n*sizeof(unsigned int *));
1613: for ( i = 0, t = f; i < n; i++, t = NEXT(t) ) {
1.23 noro 1614: ps[i] = (NDV)BDY(t);
1.45 noro 1615: bound[i] = ndv_compute_bound(ps[i]);
1616: }
1.23 noro 1617: qsort(ps,n,sizeof(NDV),(int (*)(const void *,const void *))ndv_compare);
1.45 noro 1618: base.ps = (NDV *)ALLOCA((n-1)*sizeof(NDV));
1619: base.bound = (unsigned int **)ALLOCA((n-1)*sizeof(unsigned int *));
1620: base.len = n-1;
1.50 ! noro 1621: i = 0;
! 1622: while ( i < n ) {
1.45 noro 1623: for ( j = 0; j < i; j++ ) {
1624: base.ps[j] = ps[j]; base.bound[j] = bound[j];
1625: }
1626: for ( j = i+1; j < n; j++ ) {
1627: base.ps[j-1] = ps[j]; base.bound[j-1] = bound[j];
1628: }
1.23 noro 1629: g = ndvtond(m,ps[i]);
1.45 noro 1630: stat = nd_nf_direct(m,g,&base,1,&nf);
1.50 ! noro 1631: if ( !stat )
1.23 noro 1632: nd_reconstruct_direct(m,ps,n);
1633: else if ( !nf ) {
1634: printf("."); fflush(stdout);
1635: ndv_free(ps[i]);
1.50 ! noro 1636: for ( j = i+1; j < n; j++ ) {
! 1637: ps[j-1] = ps[j]; bound[j-1] = bound[j];
! 1638: }
1.23 noro 1639: n--;
1.50 ! noro 1640: base.len = n-1;
1.23 noro 1641: } else {
1642: printf("."); fflush(stdout);
1643: ndv_free(ps[i]);
1.24 noro 1644: nd_removecont(m,nf);
1.23 noro 1645: ps[i] = ndtondv(m,nf);
1.45 noro 1646: bound[i] = ndv_compute_bound(ps[i]);
1.23 noro 1647: nd_free(nf);
1.50 ! noro 1648: i++;
1.23 noro 1649: }
1650: }
1.45 noro 1651: printf("\n");
1.23 noro 1652: for ( a0 = 0, i = 0; i < n; i++ ) {
1653: NEXTNODE(a0,a);
1654: BDY(a) = (pointer)ps[i];
1655: }
1656: NEXT(a) = 0;
1657: return a0;
1658: }
1659:
1.1 noro 1660: ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t)
1661: {
1662: ND_pairs d1,nd,cur,head,prev,remove;
1663:
1664: if ( !g ) return d;
1665: d = crit_B(d,t);
1666: d1 = nd_newpairs(g,t);
1667: d1 = crit_M(d1);
1668: d1 = crit_F(d1);
1669: prev = 0; cur = head = d1;
1670: while ( cur ) {
1671: if ( crit_2( cur->i1,cur->i2 ) ) {
1672: remove = cur;
1.34 noro 1673: if ( !prev ) head = cur = NEXT(cur);
1674: else cur = NEXT(prev) = NEXT(cur);
1.1 noro 1675: FREENDP(remove);
1676: } else {
1.34 noro 1677: prev = cur; cur = NEXT(cur);
1.1 noro 1678: }
1679: }
1680: if ( !d )
1681: return head;
1682: else {
1683: nd = d;
1.34 noro 1684: while ( NEXT(nd) ) nd = NEXT(nd);
1.1 noro 1685: NEXT(nd) = head;
1686: return d;
1687: }
1688: }
1689:
1690: ND_pairs nd_newpairs( NODE g, int t )
1691: {
1692: NODE h;
1693: unsigned int *dl;
1.34 noro 1694: int ts,s;
1.1 noro 1695: ND_pairs r,r0;
1696:
1.20 noro 1697: dl = DL(nd_psh[t]);
1.34 noro 1698: ts = SG(nd_psh[t]) - TD(dl);
1.1 noro 1699: for ( r0 = 0, h = g; h; h = NEXT(h) ) {
1700: NEXTND_pairs(r0,r);
1701: r->i1 = (int)BDY(h);
1702: r->i2 = t;
1.20 noro 1703: ndl_lcm(DL(nd_psh[r->i1]),dl,r->lcm);
1.34 noro 1704: s = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1]));
1705: SG(r) = MAX(s,ts) + TD(LCM(r));
1.1 noro 1706: }
1707: NEXT(r) = 0;
1708: return r0;
1709: }
1710:
1711: ND_pairs crit_B( ND_pairs d, int s )
1712: {
1713: ND_pairs cur,head,prev,remove;
1714: unsigned int *t,*tl,*lcm;
1715: int td,tdl;
1716:
1717: if ( !d ) return 0;
1.20 noro 1718: t = DL(nd_psh[s]);
1.1 noro 1719: prev = 0;
1720: head = cur = d;
1.41 noro 1721: lcm = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
1.1 noro 1722: while ( cur ) {
1723: tl = cur->lcm;
1724: if ( ndl_reducible(tl,t)
1.20 noro 1725: && (ndl_lcm(DL(nd_psh[cur->i1]),t,lcm),!ndl_equal(lcm,tl))
1726: && (ndl_lcm(DL(nd_psh[cur->i2]),t,lcm),!ndl_equal(lcm,tl)) ) {
1.1 noro 1727: remove = cur;
1728: if ( !prev ) {
1729: head = cur = NEXT(cur);
1730: } else {
1731: cur = NEXT(prev) = NEXT(cur);
1732: }
1733: FREENDP(remove);
1734: } else {
1.34 noro 1735: prev = cur; cur = NEXT(cur);
1.1 noro 1736: }
1737: }
1738: return head;
1739: }
1740:
1.34 noro 1741: /* XXX : check is necessary */
1742:
1.1 noro 1743: ND_pairs crit_M( ND_pairs d1 )
1744: {
1745: ND_pairs e,d2,d3,dd,p;
1746: unsigned int *id,*jd;
1747:
1748: for ( dd = 0, e = d1; e; e = d3 ) {
1749: if ( !(d2 = NEXT(e)) ) {
1750: NEXT(e) = dd;
1751: return e;
1752: }
1.34 noro 1753: id = LCM(e);
1.1 noro 1754: for ( d3 = 0; d2; d2 = p ) {
1.34 noro 1755: p = NEXT(d2);
1756: jd = LCM(d2);
1757: if ( ndl_equal(jd,id) )
1758: ;
1759: else if ( TD(jd) > TD(id) )
1.1 noro 1760: if ( ndl_reducible(jd,id) ) continue;
1761: else ;
1.34 noro 1762: else if ( ndl_reducible(id,jd) ) goto delit;
1.1 noro 1763: NEXT(d2) = d3;
1764: d3 = d2;
1765: }
1766: NEXT(e) = dd;
1767: dd = e;
1768: continue;
1769: /**/
1770: delit: NEXT(d2) = d3;
1771: d3 = d2;
1772: for ( ; p; p = d2 ) {
1773: d2 = NEXT(p);
1774: NEXT(p) = d3;
1775: d3 = p;
1776: }
1777: FREENDP(e);
1778: }
1779: return dd;
1780: }
1781:
1782: ND_pairs crit_F( ND_pairs d1 )
1783: {
1784: ND_pairs rest, head,remove;
1785: ND_pairs last, p, r, w;
1786: int s;
1787:
1788: for ( head = last = 0, p = d1; NEXT(p); ) {
1789: r = w = equivalent_pairs(p,&rest);
1.14 noro 1790: s = SG(r);
1.1 noro 1791: w = NEXT(w);
1792: while ( w ) {
1793: if ( crit_2(w->i1,w->i2) ) {
1794: r = w;
1795: w = NEXT(w);
1796: while ( w ) {
1797: remove = w;
1798: w = NEXT(w);
1799: FREENDP(remove);
1800: }
1801: break;
1.14 noro 1802: } else if ( SG(w) < s ) {
1.1 noro 1803: FREENDP(r);
1804: r = w;
1.14 noro 1805: s = SG(r);
1.1 noro 1806: w = NEXT(w);
1807: } else {
1808: remove = w;
1809: w = NEXT(w);
1810: FREENDP(remove);
1811: }
1812: }
1813: if ( last ) NEXT(last) = r;
1814: else head = r;
1815: NEXT(last = r) = 0;
1816: p = rest;
1817: if ( !p ) return head;
1818: }
1819: if ( !last ) return p;
1820: NEXT(last) = p;
1821: return head;
1822: }
1823:
1824: int crit_2( int dp1, int dp2 )
1825: {
1.20 noro 1826: return ndl_disjoint(DL(nd_psh[dp1]),DL(nd_psh[dp2]));
1.1 noro 1827: }
1828:
1.40 noro 1829: ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest )
1.1 noro 1830: {
1831: ND_pairs w,p,r,s;
1832: unsigned int *d;
1833:
1834: w = d1;
1.34 noro 1835: d = LCM(w);
1.1 noro 1836: s = NEXT(w);
1837: NEXT(w) = 0;
1838: for ( r = 0; s; s = p ) {
1839: p = NEXT(s);
1.34 noro 1840: if ( ndl_equal(d,LCM(s)) ) {
1.39 noro 1841: NEXT(s) = w; w = s;
1.1 noro 1842: } else {
1.39 noro 1843: NEXT(s) = r; r = s;
1.1 noro 1844: }
1845: }
1846: *prest = r;
1847: return w;
1848: }
1849:
1850: NODE update_base(NODE nd,int ndp)
1851: {
1852: unsigned int *dl, *dln;
1853: NODE last, p, head;
1854:
1.20 noro 1855: dl = DL(nd_psh[ndp]);
1.1 noro 1856: for ( head = last = 0, p = nd; p; ) {
1.20 noro 1857: dln = DL(nd_psh[(int)BDY(p)]);
1.34 noro 1858: if ( ndl_reducible( dln, dl ) ) {
1.1 noro 1859: p = NEXT(p);
1860: if ( last ) NEXT(last) = p;
1861: } else {
1862: if ( !last ) head = p;
1863: p = NEXT(last = p);
1864: }
1865: }
1866: head = append_one(head,ndp);
1867: return head;
1868: }
1869:
1870: ND_pairs nd_minp( ND_pairs d, ND_pairs *prest )
1871: {
1872: ND_pairs m,ml,p,l;
1873: unsigned int *lcm;
1.33 noro 1874: int s,td,len,tlen,c,c1;
1.1 noro 1875:
1876: if ( !(p = NEXT(m = d)) ) {
1877: *prest = p;
1878: NEXT(m) = 0;
1879: return m;
1880: }
1.14 noro 1881: s = SG(m);
1.33 noro 1882: for ( ml = 0, l = m; p; p = NEXT(l = p) )
1.34 noro 1883: if ( (SG(p) < s)
1884: || ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) {
1.39 noro 1885: ml = l; m = p; s = SG(m);
1.1 noro 1886: }
1887: if ( !ml ) *prest = NEXT(m);
1888: else {
1889: NEXT(ml) = NEXT(m);
1890: *prest = d;
1891: }
1892: NEXT(m) = 0;
1893: return m;
1894: }
1895:
1.39 noro 1896: int nd_newps(int mod,ND a,ND aq)
1.1 noro 1897: {
1.3 noro 1898: int len;
1.13 noro 1899: RHist r;
1.20 noro 1900: NDV b;
1.3 noro 1901:
1.1 noro 1902: if ( nd_psn == nd_pslen ) {
1903: nd_pslen *= 2;
1.11 noro 1904: nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV));
1.20 noro 1905: nd_psq = (NDV *)REALLOC((char *)nd_psq,nd_pslen*sizeof(NDV));
1.13 noro 1906: nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist));
1.1 noro 1907: nd_bound = (unsigned int **)
1908: REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *));
1909: }
1.39 noro 1910: if ( a && aq ) {
1911: /* trace lifting */
1.46 noro 1912: if ( !rem(NM(HCQ(aq)),mod) )
1913: return -1;
1.39 noro 1914: }
1915: NEWRHist(r); nd_psh[nd_psn] = r;
1916: if ( aq ) {
1917: nd_removecont(0,aq);
1918: nd_psq[nd_psn] = ndtondv(0,aq);
1.45 noro 1919: nd_bound[nd_psn] = ndv_compute_bound(nd_psq[nd_psn]);
1.39 noro 1920: SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r));
1921: }
1922: if ( a ) {
1923: nd_removecont(mod,a);
1924: nd_ps[nd_psn] = ndtondv(mod,a);
1925: if ( !aq ) {
1.45 noro 1926: nd_bound[nd_psn] = ndv_compute_bound(nd_ps[nd_psn]);
1.39 noro 1927: SG(r) = SG(a); ndl_copy(HDL(a),DL(r));
1928: }
1.20 noro 1929: }
1.39 noro 1930: nd_free(a); nd_free(aq);
1.1 noro 1931: return nd_psn++;
1932: }
1933:
1.39 noro 1934: void nd_setup(int mod,int trace,NODE f)
1.1 noro 1935: {
1.5 noro 1936: int i,j,td,len,max;
1.1 noro 1937: NODE s,s0,f0;
1.5 noro 1938: unsigned int *d;
1.13 noro 1939: RHist r;
1.20 noro 1940: NDV a;
1.11 noro 1941:
1942: nd_found = 0; nd_notfirst = 0; nd_create = 0;
1.1 noro 1943:
1944: nd_psn = length(f); nd_pslen = 2*nd_psn;
1.11 noro 1945: nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.20 noro 1946: nd_psq = (NDV *)MALLOC(nd_pslen*sizeof(NDV));
1.13 noro 1947: nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist));
1.1 noro 1948: nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *));
1.5 noro 1949: for ( max = 0, i = 0, s = f; i < nd_psn; i++, s = NEXT(s) ) {
1950: nd_bound[i] = d = dp_compute_bound((DP)BDY(s));
1951: for ( j = 0; j < nd_nvar; j++ )
1952: max = MAX(d[j],max);
1953: }
1.11 noro 1954: if ( !nd_red )
1.13 noro 1955: nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist));
1956: bzero(nd_red,REDTAB_LEN*sizeof(RHist));
1.5 noro 1957:
1.34 noro 1958: if ( max < 2 ) nd_bpe = 2;
1959: else if ( max < 4 ) nd_bpe = 4;
1960: else if ( max < 64 ) nd_bpe = 6;
1961: else if ( max < 256 ) nd_bpe = 8;
1962: else if ( max < 65536 ) nd_bpe = 16;
1963: else nd_bpe = 32;
1.13 noro 1964:
1.1 noro 1965: nd_setup_parameters();
1966: nd_free_private_storage();
1967: for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) {
1.20 noro 1968: NEWRHist(r);
1.39 noro 1969: a = dptondv(mod,(DP)BDY(f)); ndv_removecont(mod,a);
1.34 noro 1970: SG(r) = HTD(a); ndl_copy(HDL(a),DL(r));
1.1 noro 1971:
1.39 noro 1972: if ( trace ) {
1973: nd_ps[i] = a;
1974: a = dptondv(0,(DP)BDY(f)); ndv_removecont(0,a);
1975: nd_psq[i] = a;
1976: } else {
1977: if ( mod ) nd_ps[i] = a;
1978: else nd_psq[i] = a;
1979: }
1.20 noro 1980: nd_psh[i] = r;
1981: }
1982: }
1983:
1.1 noro 1984: void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp)
1985: {
1986: struct order_spec ord1;
1987: VL fv,vv,vc;
1988: NODE fd,fd0,r,r0,t,x,s,xx;
1989: DP a,b,c;
1990:
1991: get_vars((Obj)f,&fv); pltovl(v,&vv);
1992: nd_nvar = length(vv);
1.32 noro 1993: nd_init_ord(ord);
1994: /* XXX for DP */
1.1 noro 1995: initd(ord);
1996: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
1997: ptod(CO,vv,(P)BDY(t),&b);
1.20 noro 1998: NEXTNODE(fd0,fd); BDY(fd) = (pointer)b;
1.1 noro 1999: }
2000: if ( fd0 ) NEXT(fd) = 0;
1.39 noro 2001: nd_setup(m,0,fd0);
1.27 noro 2002: x = nd_gb(m,0);
1.25 noro 2003: fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n",
2004: nd_found,nd_notfirst,nd_create);
1.50 ! noro 2005: x = nd_reducebase(x);
1.23 noro 2006: x = nd_reduceall(m,x);
2007: for ( r0 = 0, t = x; t; t = NEXT(t) ) {
1.1 noro 2008: NEXTNODE(r0,r);
1.20 noro 2009: if ( m ) {
1.23 noro 2010: a = ndvtodp(m,BDY(t));
1.16 noro 2011: _dtop_mod(CO,vv,a,(P *)&BDY(r));
1.20 noro 2012: } else {
1.23 noro 2013: a = ndvtodp(m,BDY(t));
1.16 noro 2014: dtop(CO,vv,a,(P *)&BDY(r));
1.20 noro 2015: }
2016: }
2017: if ( r0 ) NEXT(r) = 0;
2018: MKLIST(*rp,r0);
2019: }
2020:
1.23 noro 2021: void nd_gr_trace(LIST f,LIST v,int m,int homo,struct order_spec *ord,LIST *rp)
1.20 noro 2022: {
2023: struct order_spec ord1;
2024: VL fv,vv,vc;
1.27 noro 2025: NODE fd,fd0,in0,in,r,r0,t,s,cand;
1.23 noro 2026: DP a,b,c,h;
1.27 noro 2027: P p;
1.20 noro 2028:
2029: get_vars((Obj)f,&fv); pltovl(v,&vv);
2030: nd_nvar = length(vv);
2031: initd(ord);
1.23 noro 2032: if ( homo ) {
2033: homogenize_order(ord,nd_nvar,&ord1);
1.27 noro 2034: for ( fd0 = 0, in0 = 0, t = BDY(f); t; t = NEXT(t) ) {
1.23 noro 2035: ptod(CO,vv,(P)BDY(t),&c);
2036: if ( c ) {
2037: dp_homo(c,&h); NEXTNODE(fd0,fd); BDY(fd) = (pointer)h;
1.27 noro 2038: NEXTNODE(in0,in); BDY(in) = (pointer)c;
1.23 noro 2039: }
2040: }
2041: if ( fd0 ) NEXT(fd) = 0;
1.27 noro 2042: if ( in0 ) NEXT(in) = 0;
1.32 noro 2043: nd_init_ord(&ord1);
1.23 noro 2044: initd(&ord1);
2045: nd_nvar++;
1.25 noro 2046: } else {
2047: for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {
2048: ptod(CO,vv,(P)BDY(t),&c);
2049: if ( c ) {
2050: NEXTNODE(fd0,fd); BDY(fd) = (pointer)c;
1.23 noro 2051: }
2052: }
1.25 noro 2053: if ( fd0 ) NEXT(fd) = 0;
1.27 noro 2054: in0 = fd0;
1.33 noro 2055: nd_init_ord(ord);
1.27 noro 2056: }
2057: do {
1.39 noro 2058: nd_setup(m,1,fd0);
1.27 noro 2059: cand = nd_gb_trace(m);
2060: if ( !cand ) continue;
2061: if ( homo ) {
2062: /* dehomogenization */
2063: for ( t = cand; t; t = NEXT(t) )
1.45 noro 2064: ndv_dehomogenize((NDV)BDY(t),ord);
1.27 noro 2065: nd_nvar--;
1.45 noro 2066: initd(ord);
2067: nd_init_ord(ord);
1.27 noro 2068: nd_setup_parameters();
2069: }
1.50 ! noro 2070: cand = nd_reducebase(cand);
1.27 noro 2071: fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n",
2072: nd_found,nd_notfirst,nd_create);
2073: cand = nd_reduceall(0,cand);
2074: initd(ord);
2075: for ( r0 = 0; cand; cand = NEXT(cand) ) {
2076: NEXTNODE(r0,r);
2077: BDY(r) = (pointer)ndvtodp(0,(NDV)BDY(cand));
2078: }
2079: if ( r0 ) NEXT(r) = 0;
2080: cand = r0;
2081: } while ( !nd_check_candidate(in0,cand) );
2082: /* dp->p */
2083: for ( r = cand; r; r = NEXT(r) ) {
2084: dtop(CO,vv,BDY(r),&p);
2085: BDY(r) = (pointer)p;
1.23 noro 2086: }
1.27 noro 2087: MKLIST(*rp,cand);
1.1 noro 2088: }
2089:
2090: void dltondl(int n,DL dl,unsigned int *r)
2091: {
2092: unsigned int *d;
1.43 noro 2093: int i,j,l,s,ord_l,ord_o;
2094: struct order_pair *op;
1.1 noro 2095:
2096: d = dl->d;
1.41 noro 2097: for ( i = 0; i < nd_wpd; i++ ) r[i] = 0;
1.43 noro 2098: if ( nd_blockmask ) {
2099: l = nd_blockmask->n;
2100: op = nd_blockmask->order_pair;
2101: for ( j = 0, s = 0; j < l; j++ ) {
2102: ord_o = op[j].order;
2103: ord_l = op[j].length;
2104: if ( !ord_o )
2105: for ( i = 0; i < ord_l; i++ )
2106: PUT_EXP(r,s+ord_l-i-1,d[s+i]);
2107: else
2108: for ( i = 0; i < ord_l; i++ )
2109: PUT_EXP(r,s+i,d[s+i]);
2110: s += ord_l;
2111: }
2112: TD(r) = ndl_weight(r);
2113: for ( j = 0; j < l; j++ )
2114: r[j+1] = ndl_weight_mask(r,j);
2115: } else {
2116: if ( nd_isrlex )
2117: for ( i = 0; i < n; i++ ) PUT_EXP(r,n-1-i,d[i]);
2118: else
2119: for ( i = 0; i < n; i++ ) PUT_EXP(r,i,d[i]);
2120: TD(r) = ndl_weight(r);
2121: }
1.1 noro 2122: }
2123:
1.34 noro 2124: DL ndltodl(int n,unsigned int *ndl)
1.1 noro 2125: {
2126: DL dl;
2127: int *d;
1.43 noro 2128: int i,j,l,s,ord_l,ord_o;
2129: struct order_pair *op;
1.1 noro 2130:
2131: NEWDL(dl,n);
1.34 noro 2132: dl->td = TD(ndl);
1.1 noro 2133: d = dl->d;
1.43 noro 2134: if ( nd_blockmask ) {
2135: l = nd_blockmask->n;
2136: op = nd_blockmask->order_pair;
2137: for ( j = 0, s = 0; j < l; j++ ) {
2138: ord_o = op[j].order;
2139: ord_l = op[j].length;
2140: if ( !ord_o )
2141: for ( i = 0; i < ord_l; i++ )
2142: d[s+i] = GET_EXP(ndl,s+ord_l-i-1);
2143: else
2144: for ( i = 0; i < ord_l; i++ )
2145: d[s+i] = GET_EXP(ndl,s+i);
2146: s += ord_l;
2147: }
2148: } else {
2149: if ( nd_isrlex )
2150: for ( i = 0; i < n; i++ )
2151: d[i] = GET_EXP(ndl,n-1-i);
2152: else
2153: for ( i = 0; i < n; i++ )
2154: d[i] = GET_EXP(ndl,i);
2155: }
1.1 noro 2156: return dl;
2157: }
2158:
1.17 noro 2159: ND dptond(int mod,DP p)
1.1 noro 2160: {
2161: ND d;
2162: NM m0,m;
2163: MP t;
1.31 noro 2164: int n,l;
1.1 noro 2165:
2166: if ( !p )
2167: return 0;
2168: n = NV(p);
2169: m0 = 0;
1.31 noro 2170: for ( t = BDY(p), l = 0; t; t = NEXT(t), l++ ) {
1.1 noro 2171: NEXTNM(m0,m);
1.34 noro 2172: if ( mod ) CM(m) = ITOS(C(t));
2173: else CQ(m) = (Q)C(t);
1.14 noro 2174: dltondl(n,DL(t),DL(m));
1.1 noro 2175: }
2176: NEXT(m) = 0;
1.31 noro 2177: MKND(n,m0,l,d);
1.14 noro 2178: SG(d) = SG(p);
1.1 noro 2179: return d;
2180: }
2181:
1.17 noro 2182: DP ndtodp(int mod,ND p)
1.1 noro 2183: {
2184: DP d;
2185: MP m0,m;
2186: NM t;
2187: int n;
2188:
2189: if ( !p )
2190: return 0;
2191: n = NV(p);
2192: m0 = 0;
2193: for ( t = BDY(p); t; t = NEXT(t) ) {
2194: NEXTMP(m0,m);
1.34 noro 2195: if ( mod ) C(m) = STOI(CM(t));
2196: else C(m) = (P)CQ(t);
2197: DL(m) = ndltodl(n,DL(t));
1.1 noro 2198: }
2199: NEXT(m) = 0;
2200: MKDP(n,m0,d);
1.14 noro 2201: SG(d) = SG(p);
1.1 noro 2202: return d;
2203: }
2204:
2205: void ndl_print(unsigned int *dl)
2206: {
2207: int n;
1.43 noro 2208: int i,j,l,ord_o,ord_l,s,s0;
2209: struct order_pair *op;
1.1 noro 2210:
2211: n = nd_nvar;
2212: printf("<<");
1.43 noro 2213: if ( nd_blockmask ) {
2214: l = nd_blockmask->n;
2215: op = nd_blockmask->order_pair;
2216: for ( j = 0, s = s0 = 0; j < l; j++ ) {
2217: ord_o = op[j].order;
2218: ord_l = op[j].length;
2219: if ( !ord_o )
2220: for ( i = 0, s0 += ord_l; i < ord_l; i++, s++ )
2221: printf(s==n-1?"%d":"%d,",GET_EXP(dl,s0-i-1));
2222: else
2223: for ( i = 0; i < ord_l; i++, s++ )
2224: printf(s==n-1?"%d":"%d,",GET_EXP(dl,s));
2225: }
2226: } else {
2227: if ( nd_isrlex )
2228: for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,n-1-i));
2229: else
2230: for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,i));
2231: }
1.1 noro 2232: printf(">>");
2233: }
2234:
2235: void nd_print(ND p)
2236: {
2237: NM m;
2238:
2239: if ( !p )
2240: printf("0\n");
2241: else {
2242: for ( m = BDY(p); m; m = NEXT(m) ) {
1.14 noro 2243: printf("+%d*",CM(m));
2244: ndl_print(DL(m));
1.1 noro 2245: }
2246: printf("\n");
2247: }
2248: }
2249:
1.16 noro 2250: void nd_print_q(ND p)
2251: {
2252: NM m;
2253:
2254: if ( !p )
2255: printf("0\n");
2256: else {
2257: for ( m = BDY(p); m; m = NEXT(m) ) {
2258: printf("+");
2259: printexpr(CO,CQ(m));
2260: printf("*");
2261: ndl_print(DL(m));
2262: }
2263: printf("\n");
2264: }
2265: }
2266:
1.1 noro 2267: void ndp_print(ND_pairs d)
2268: {
2269: ND_pairs t;
2270:
1.34 noro 2271: for ( t = d; t; t = NEXT(t) ) printf("%d,%d ",t->i1,t->i2);
1.1 noro 2272: printf("\n");
2273: }
2274:
1.20 noro 2275: void nd_removecont(int mod,ND p)
1.16 noro 2276: {
2277: int i,n;
2278: Q *w;
2279: Q dvr,t;
2280: NM m;
1.21 noro 2281: struct oVECT v;
2282: N q,r;
1.16 noro 2283:
1.34 noro 2284: if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod));
1.20 noro 2285: else {
2286: for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ );
2287: w = (Q *)ALLOCA(n*sizeof(Q));
1.21 noro 2288: v.len = n;
2289: v.body = (pointer *)w;
1.34 noro 2290: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
1.21 noro 2291: removecont_array(w,n);
2292: for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
1.16 noro 2293: }
2294: }
2295:
1.21 noro 2296: void nd_removecont2(ND p1,ND p2)
2297: {
2298: int i,n1,n2,n;
2299: Q *w;
2300: Q dvr,t;
2301: NM m;
2302: struct oVECT v;
2303: N q,r;
2304:
2305: if ( !p1 ) {
2306: nd_removecont(0,p2); return;
2307: } else if ( !p2 ) {
2308: nd_removecont(0,p1); return;
2309: }
2310: n1 = nd_length(p1);
2311: n2 = nd_length(p2);
2312: n = n1+n2;
2313: w = (Q *)ALLOCA(n*sizeof(Q));
2314: v.len = n;
2315: v.body = (pointer *)w;
1.34 noro 2316: for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) w[i] = CQ(m);
2317: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m);
1.21 noro 2318: removecont_array(w,n);
2319: for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) CQ(m) = w[i];
2320: for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i];
2321: }
2322:
1.20 noro 2323: void ndv_removecont(int mod,NDV p)
1.16 noro 2324: {
2325: int i,len;
2326: Q *w;
2327: Q dvr,t;
2328: NMV m;
2329:
1.20 noro 2330: if ( mod )
2331: ndv_mul_c(mod,p,invm(HCM(p),mod));
2332: else {
2333: len = p->len;
2334: w = (Q *)ALLOCA(len*sizeof(Q));
1.34 noro 2335: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) w[i] = CQ(m);
1.20 noro 2336: sortbynm(w,len);
2337: qltozl(w,len,&dvr);
2338: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) {
2339: divq(CQ(m),dvr,&t); CQ(m) = t;
2340: }
1.16 noro 2341: }
1.21 noro 2342: }
2343:
1.45 noro 2344: void ndv_dehomogenize(NDV p,struct order_spec *ord)
1.23 noro 2345: {
1.45 noro 2346: int i,j,adj,len,newnvar,newwpd,newadv,newexporigin;
1.23 noro 2347: Q *w;
2348: Q dvr,t;
2349: NMV m,r;
2350: #define NEWADV(m) (m = (NMV)(((char *)m)+newadv))
2351:
2352: len = p->len;
2353: newnvar = nd_nvar-1;
1.48 noro 2354: newexporigin = nd_get_exporigin(ord);
1.45 noro 2355: newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0)+newexporigin;
1.23 noro 2356: for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ )
1.34 noro 2357: ndl_dehomogenize(DL(m));
1.23 noro 2358: if ( newwpd != nd_wpd ) {
1.41 noro 2359: newadv = sizeof(struct oNMV)+(newwpd-1)*sizeof(unsigned int);
1.23 noro 2360: for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NEWADV(r), i++ ) {
1.45 noro 2361: CQ(r) = CQ(m);
2362: for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j];
2363: adj = nd_exporigin-newexporigin;
2364: for ( ; j < newwpd; j++ ) DL(r)[j] = DL(m)[j+adj];
1.23 noro 2365: }
2366: }
2367: NV(p)--;
2368: }
2369:
1.21 noro 2370: void removecont_array(Q *c,int n)
2371: {
2372: struct oVECT v;
2373: Q d0,d1,a,u,u1,gcd;
2374: int i;
2375: N qn,rn,gn;
2376: Q *q,*r;
2377:
2378: q = (Q *)ALLOCA(n*sizeof(Q));
2379: r = (Q *)ALLOCA(n*sizeof(Q));
2380: v.id = O_VECT; v.len = n; v.body = (pointer *)c;
2381: igcdv_estimate(&v,&d0);
2382: for ( i = 0; i < n; i++ ) {
2383: divn(NM(c[i]),NM(d0),&qn,&rn);
2384: NTOQ(qn,SGN(c[i])*SGN(d0),q[i]);
2385: NTOQ(rn,SGN(c[i]),r[i]);
2386: }
1.34 noro 2387: for ( i = 0; i < n; i++ ) if ( r[i] ) break;
1.21 noro 2388: if ( i < n ) {
2389: v.id = O_VECT; v.len = n; v.body = (pointer *)r;
2390: igcdv(&v,&d1);
2391: gcdn(NM(d0),NM(d1),&gn); NTOQ(gn,1,gcd);
2392: divsn(NM(d0),gn,&qn); NTOQ(qn,1,a);
2393: for ( i = 0; i < n; i++ ) {
2394: mulq(a,q[i],&u);
2395: if ( r[i] ) {
2396: divsn(NM(r[i]),gn,&qn); NTOQ(qn,SGN(r[i]),u1);
2397: addq(u,u1,&q[i]);
2398: } else
2399: q[i] = u;
2400: }
2401: }
1.34 noro 2402: for ( i = 0; i < n; i++ ) c[i] = q[i];
1.16 noro 2403: }
2404:
1.19 noro 2405: void nd_mul_c(int mod,ND p,int mul)
1.1 noro 2406: {
2407: NM m;
2408: int c,c1;
2409:
1.34 noro 2410: if ( !p ) return;
1.1 noro 2411: for ( m = BDY(p); m; m = NEXT(m) ) {
1.14 noro 2412: c1 = CM(m);
1.19 noro 2413: DMAR(c1,mul,0,mod,c);
1.14 noro 2414: CM(m) = c;
1.1 noro 2415: }
2416: }
2417:
1.16 noro 2418: void nd_mul_c_q(ND p,Q mul)
2419: {
2420: NM m;
2421: Q c;
2422:
1.34 noro 2423: if ( !p ) return;
1.16 noro 2424: for ( m = BDY(p); m; m = NEXT(m) ) {
2425: mulq(CQ(m),mul,&c); CQ(m) = c;
2426: }
2427: }
2428:
1.1 noro 2429: void nd_free(ND p)
2430: {
2431: NM t,s;
2432:
1.34 noro 2433: if ( !p ) return;
1.1 noro 2434: t = BDY(p);
2435: while ( t ) {
2436: s = NEXT(t);
2437: FREENM(t);
2438: t = s;
2439: }
2440: FREEND(p);
2441: }
2442:
1.23 noro 2443: void ndv_free(NDV p)
2444: {
2445: GC_free(BDY(p));
2446: }
2447:
1.34 noro 2448: void nd_append_red(unsigned int *d,int i)
1.1 noro 2449: {
1.13 noro 2450: RHist m,m0;
1.1 noro 2451: int h;
2452:
1.13 noro 2453: NEWRHist(m);
1.34 noro 2454: h = ndl_hash_value(d);
1.13 noro 2455: m->index = i;
1.14 noro 2456: ndl_copy(d,DL(m));
1.1 noro 2457: NEXT(m) = nd_red[h];
2458: nd_red[h] = m;
2459: }
2460:
1.5 noro 2461: unsigned int *dp_compute_bound(DP p)
2462: {
2463: unsigned int *d,*d1,*d2,*t;
2464: MP m;
1.7 noro 2465: int i,l;
1.5 noro 2466:
2467: if ( !p )
2468: return 0;
2469: d1 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int));
2470: d2 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int));
2471: m = BDY(p);
1.35 noro 2472: d = DL(m)->d;
2473: for ( i = 0; i < nd_nvar; i++ ) d1[i] = d[i];
1.5 noro 2474: for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) {
1.14 noro 2475: d = DL(m)->d;
1.5 noro 2476: for ( i = 0; i < nd_nvar; i++ )
2477: d2[i] = d[i] > d1[i] ? d[i] : d1[i];
2478: t = d1; d1 = d2; d2 = t;
2479: }
1.13 noro 2480: l = (nd_nvar+31);
1.7 noro 2481: t = (unsigned int *)MALLOC_ATOMIC(l*sizeof(unsigned int));
1.35 noro 2482: for ( i = 0; i < nd_nvar; i++ ) t[i] = d1[i];
2483: for ( ; i < l; i++ ) t[i] = 0;
1.5 noro 2484: return t;
2485: }
2486:
1.45 noro 2487: unsigned int *ndv_compute_bound(NDV p)
1.1 noro 2488: {
2489: unsigned int *d1,*d2,*t;
1.45 noro 2490: int i,l,len;
2491: NMV m;
1.1 noro 2492:
2493: if ( !p )
2494: return 0;
2495: d1 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
2496: d2 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int));
1.45 noro 2497: len = LEN(p);
2498: m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m);
2499: for ( i = 1; i < len; i++, NMV_ADV(m) ) {
1.14 noro 2500: ndl_lcm(DL(m),d1,d2);
1.1 noro 2501: t = d1; d1 = d2; d2 = t;
2502: }
1.12 noro 2503: l = nd_nvar+31;
1.9 noro 2504: t = (unsigned int *)MALLOC_ATOMIC(l*sizeof(unsigned int));
1.42 noro 2505: for ( i = 0; i < nd_nvar; i++ ) t[i] = GET_EXP(d1,i);
1.35 noro 2506: for ( ; i < l; i++ ) t[i] = 0;
1.1 noro 2507: return t;
2508: }
2509:
1.48 noro 2510: int nd_get_exporigin(struct order_spec *ord)
2511: {
1.41 noro 2512: switch ( nd_ord->id ) {
2513: case 0:
1.48 noro 2514: return 1;
1.41 noro 2515: case 1:
2516: /* block order */
1.43 noro 2517: /* d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */
1.48 noro 2518: return ord->ord.block.length+1;
1.41 noro 2519: case 2:
2520: error("nd_setup_parameters : matrix order is not supported yet.");
2521: }
1.48 noro 2522: }
2523:
2524: void nd_setup_parameters() {
2525: int i,n,elen;
2526:
2527: nd_epw = (sizeof(unsigned int)*8)/nd_bpe;
2528: elen = nd_nvar/nd_epw+(nd_nvar%nd_epw?1:0);
2529:
2530: nd_exporigin = nd_get_exporigin(nd_ord);
1.43 noro 2531: nd_wpd = nd_exporigin+elen;
2532: nd_epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS));
2533: for ( i = 0; i < nd_nvar; i++ ) {
2534: nd_epos[i].i = nd_exporigin + i/nd_epw;
2535: nd_epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe;
2536: }
1.1 noro 2537: if ( nd_bpe < 32 ) {
2538: nd_mask0 = (1<<nd_bpe)-1;
2539: } else {
2540: nd_mask0 = 0xffffffff;
2541: }
2542: bzero(nd_mask,sizeof(nd_mask));
2543: nd_mask1 = 0;
2544: for ( i = 0; i < nd_epw; i++ ) {
2545: nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe));
2546: nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe);
2547: }
1.41 noro 2548: nm_adv = sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int);
2549: nmv_adv = sizeof(struct oNMV)+(nd_wpd-1)*sizeof(unsigned int);
1.43 noro 2550: nd_blockmask = nd_create_blockmask(nd_ord);
1.1 noro 2551: }
2552:
1.20 noro 2553: ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d)
1.1 noro 2554: {
1.37 noro 2555: int i,obpe,oadv,h;
1.13 noro 2556: NM prev_nm_free_list;
2557: RHist mr0,mr;
2558: RHist r;
1.37 noro 2559: RHist *old_red;
1.1 noro 2560: ND_pairs s0,s,t,prev_ndp_free_list;
1.43 noro 2561: EPOS oepos;
1.15 noro 2562:
1.1 noro 2563: obpe = nd_bpe;
1.11 noro 2564: oadv = nmv_adv;
1.43 noro 2565: oepos = nd_epos;
1.34 noro 2566: if ( obpe < 4 ) nd_bpe = 4;
2567: else if ( obpe < 6 ) nd_bpe = 6;
2568: else if ( obpe < 8 ) nd_bpe = 8;
2569: else if ( obpe < 16 ) nd_bpe = 16;
2570: else if ( obpe < 32 ) nd_bpe = 32;
2571: else error("nd_reconstruct : exponent too large");
1.5 noro 2572:
1.1 noro 2573: nd_setup_parameters();
2574: prev_nm_free_list = _nm_free_list;
2575: prev_ndp_free_list = _ndp_free_list;
2576: _nm_free_list = 0;
2577: _ndp_free_list = 0;
1.20 noro 2578: if ( mod != 0 )
1.43 noro 2579: for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos);
1.20 noro 2580: if ( !mod || trace )
1.43 noro 2581: for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_psq[i],obpe,oadv,oepos);
1.1 noro 2582: s0 = 0;
2583: for ( t = d; t; t = NEXT(t) ) {
2584: NEXTND_pairs(s0,s);
2585: s->i1 = t->i1;
2586: s->i2 = t->i2;
1.14 noro 2587: SG(s) = SG(t);
1.43 noro 2588: ndl_reconstruct(obpe,oepos,LCM(t),LCM(s));
1.1 noro 2589: }
1.37 noro 2590:
2591: old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist));
1.6 noro 2592: for ( i = 0; i < REDTAB_LEN; i++ ) {
1.37 noro 2593: old_red[i] = nd_red[i];
2594: nd_red[i] = 0;
2595: }
2596: for ( i = 0; i < REDTAB_LEN; i++ )
2597: for ( r = old_red[i]; r; r = NEXT(r) ) {
2598: NEWRHist(mr);
1.13 noro 2599: mr->index = r->index;
1.20 noro 2600: SG(mr) = SG(r);
1.43 noro 2601: ndl_reconstruct(obpe,oepos,DL(r),DL(mr));
1.37 noro 2602: h = ndl_hash_value(DL(mr));
2603: NEXT(mr) = nd_red[h];
2604: nd_red[h] = mr;
1.6 noro 2605: }
1.37 noro 2606: for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0;
2607: old_red = 0;
1.11 noro 2608: for ( i = 0; i < nd_psn; i++ ) {
1.20 noro 2609: NEWRHist(r); SG(r) = SG(nd_psh[i]);
1.43 noro 2610: ndl_reconstruct(obpe,oepos,DL(nd_psh[i]),DL(r));
1.13 noro 2611: nd_psh[i] = r;
1.11 noro 2612: }
1.1 noro 2613: if ( s0 ) NEXT(s) = 0;
2614: prev_nm_free_list = 0;
2615: prev_ndp_free_list = 0;
2616: GC_gcollect();
2617: return s0;
2618: }
2619:
1.23 noro 2620: void nd_reconstruct_direct(int mod,NDV *ps,int len)
2621: {
1.37 noro 2622: int i,obpe,oadv,h;
1.45 noro 2623: unsigned int **bound;
1.23 noro 2624: NM prev_nm_free_list;
2625: RHist mr0,mr;
2626: RHist r;
1.37 noro 2627: RHist *old_red;
1.23 noro 2628: ND_pairs s0,s,t,prev_ndp_free_list;
1.43 noro 2629: EPOS oepos;
1.23 noro 2630:
2631: obpe = nd_bpe;
2632: oadv = nmv_adv;
1.43 noro 2633: oepos = nd_epos;
1.34 noro 2634: if ( obpe < 4 ) nd_bpe = 4;
2635: else if ( obpe < 6 ) nd_bpe = 6;
2636: else if ( obpe < 8 ) nd_bpe = 8;
2637: else if ( obpe < 16 ) nd_bpe = 16;
2638: else if ( obpe < 32 ) nd_bpe = 32;
2639: else error("nd_reconstruct_direct : exponent too large");
1.23 noro 2640:
2641: nd_setup_parameters();
2642: prev_nm_free_list = _nm_free_list;
2643: prev_ndp_free_list = _ndp_free_list;
1.34 noro 2644: _nm_free_list = 0; _ndp_free_list = 0;
1.43 noro 2645: for ( i = len-1; i >= 0; i-- ) ndv_realloc(ps[i],obpe,oadv,oepos);
1.23 noro 2646: prev_nm_free_list = 0;
2647: prev_ndp_free_list = 0;
2648: GC_gcollect();
2649: }
2650:
1.43 noro 2651: void ndl_reconstruct(int obpe,EPOS oepos,unsigned int *d,unsigned int *r)
1.1 noro 2652: {
1.43 noro 2653: int n,i,ei,oepw,omask0,j,s,ord_l,ord_o,l;
2654: struct order_pair *op;
2655: #define GET_EXP_OLD(d,a) (((d)[oepos[a].i]>>oepos[a].s)&omask0)
2656: #define PUT_EXP_OLD(r,a,e) ((r)[oepos[a].i] |= ((e)<<oepos[a].s))
1.1 noro 2657:
2658: n = nd_nvar;
2659: oepw = (sizeof(unsigned int)*8)/obpe;
1.43 noro 2660: omask0 = (1<<obpe)-1;
1.34 noro 2661: TD(r) = TD(d);
1.41 noro 2662: for ( i = nd_exporigin; i < nd_wpd; i++ ) r[i] = 0;
1.43 noro 2663: if ( nd_blockmask ) {
2664: l = nd_blockmask->n;
2665: op = nd_blockmask->order_pair;
2666: for ( i = 1; i < nd_exporigin; i++ )
2667: r[i] = d[i];
2668: for ( j = 0, s = 0; j < l; j++ ) {
2669: ord_o = op[j].order;
2670: ord_l = op[j].length;
2671: if ( !ord_o )
2672: for ( i = 0; i < ord_l; i++ ) {
2673: ei = GET_EXP_OLD(d,s+ord_l-i-1);
2674: PUT_EXP(r,s+ord_l-i-1,ei);
2675: }
2676: else
2677: for ( i = 0; i < ord_l; i++ ) {
2678: ei = GET_EXP_OLD(d,s+i);
2679: PUT_EXP(r,s+i,ei);
2680: }
2681: s += ord_l;
1.1 noro 2682: }
1.43 noro 2683: } else {
2684: if ( nd_isrlex )
2685: for ( i = 0; i < n; i++ ) {
2686: ei = GET_EXP_OLD(d,n-1-i);
2687: PUT_EXP(r,n-1-i,ei);
2688: }
2689: else
2690: for ( i = 0; i < n; i++ ) {
2691: ei = GET_EXP_OLD(d,i);
2692: PUT_EXP(r,i,ei);
2693: }
1.1 noro 2694: }
2695: }
1.3 noro 2696:
1.6 noro 2697: ND nd_copy(ND p)
2698: {
2699: NM m,mr,mr0;
1.41 noro 2700: int c,n;
1.6 noro 2701: ND r;
2702:
2703: if ( !p )
2704: return 0;
2705: else {
2706: for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
2707: NEXTNM(mr0,mr);
1.14 noro 2708: CM(mr) = CM(m);
2709: ndl_copy(DL(m),DL(mr));
1.6 noro 2710: }
2711: NEXT(mr) = 0;
1.31 noro 2712: MKND(NV(p),mr0,LEN(p),r);
1.14 noro 2713: SG(r) = SG(p);
1.6 noro 2714: return r;
2715: }
2716: }
2717:
1.16 noro 2718: int nd_sp(int mod,ND_pairs p,ND *rp)
1.11 noro 2719: {
2720: NM m;
2721: NDV p1,p2;
2722: ND t1,t2;
2723: unsigned int *lcm;
1.31 noro 2724: int td;
1.11 noro 2725:
1.20 noro 2726: if ( mod ) {
2727: p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2];
2728: } else {
2729: p1 = nd_psq[p->i1]; p2 = nd_psq[p->i2];
2730: }
1.34 noro 2731: lcm = LCM(p);
1.11 noro 2732: NEWNM(m);
1.20 noro 2733: CQ(m) = HCQ(p2);
1.34 noro 2734: ndl_sub(lcm,HDL(p1),DL(m));
2735: if ( ndl_check_bound2(p->i1,DL(m)) ) return 0;
1.25 noro 2736: t1 = ndv_mul_nm(mod,p1,m);
1.34 noro 2737: if ( mod ) CM(m) = mod-HCM(p1);
2738: else chsgnq(HCQ(p1),&CQ(m));
2739: ndl_sub(lcm,HDL(p2),DL(m));
1.14 noro 2740: if ( ndl_check_bound2(p->i2,DL(m)) ) {
1.11 noro 2741: nd_free(t1);
2742: return 0;
2743: }
1.25 noro 2744: t2 = ndv_mul_nm(mod,p2,m);
1.31 noro 2745: *rp = nd_add(mod,t1,t2);
1.11 noro 2746: FREENM(m);
2747: return 1;
2748: }
2749:
1.19 noro 2750: void ndv_mul_c(int mod,NDV p,int mul)
1.11 noro 2751: {
2752: NMV m;
2753: int c,c1,len,i;
2754:
1.34 noro 2755: if ( !p ) return;
1.14 noro 2756: len = LEN(p);
1.11 noro 2757: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
1.34 noro 2758: c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c;
1.11 noro 2759: }
2760: }
2761:
1.16 noro 2762: void ndv_mul_c_q(NDV p,Q mul)
2763: {
2764: NMV m;
2765: Q c;
2766: int len,i;
2767:
1.34 noro 2768: if ( !p ) return;
1.16 noro 2769: len = LEN(p);
2770: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
2771: mulq(CQ(m),mul,&c); CQ(m) = c;
2772: }
2773: }
2774:
1.25 noro 2775: ND ndv_mul_nm(int mod,NDV p,NM m0)
1.9 noro 2776: {
2777: NM mr,mr0;
2778: NMV m;
2779: unsigned int *d,*dt,*dm;
2780: int c,n,td,i,c1,c2,len;
1.16 noro 2781: Q q;
1.9 noro 2782: ND r;
2783:
1.34 noro 2784: if ( !p ) return 0;
1.9 noro 2785: else {
2786: n = NV(p); m = BDY(p);
1.34 noro 2787: d = DL(m0);
1.14 noro 2788: len = LEN(p);
1.9 noro 2789: mr0 = 0;
1.34 noro 2790: td = TD(d);
1.16 noro 2791: if ( mod ) {
2792: c = CM(m0);
2793: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
2794: NEXTNM(mr0,mr);
2795: c1 = CM(m);
1.19 noro 2796: DMAR(c1,c,0,mod,c2);
1.16 noro 2797: CM(mr) = c2;
2798: ndl_add(DL(m),d,DL(mr));
2799: }
2800: } else {
2801: q = CQ(m0);
2802: for ( i = 0; i < len; i++, NMV_ADV(m) ) {
2803: NEXTNM(mr0,mr);
2804: mulq(CQ(m),q,&CQ(mr));
2805: ndl_add(DL(m),d,DL(mr));
2806: }
1.4 noro 2807: }
1.9 noro 2808: NEXT(mr) = 0;
1.31 noro 2809: MKND(NV(p),mr0,len,r);
1.34 noro 2810: SG(r) = SG(p) + TD(d);
1.9 noro 2811: return r;
1.4 noro 2812: }
2813: }
2814:
1.43 noro 2815: void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos)
1.11 noro 2816: {
1.13 noro 2817: NMV m,mr,mr0,t;
2818: int len,i,k;
1.11 noro 2819:
1.13 noro 2820: #define NMV_OPREV(m) (m = (NMV)(((char *)m)-oadv))
2821: #define NMV_PREV(m) (m = (NMV)(((char *)m)-nmv_adv))
1.11 noro 2822:
2823: if ( p ) {
1.14 noro 2824: m = BDY(p); len = LEN(p);
1.34 noro 2825: mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p);
1.13 noro 2826: m = (NMV)((char *)mr0+(len-1)*oadv);
2827: mr = (NMV)((char *)mr0+(len-1)*nmv_adv);
2828: t = (NMV)ALLOCA(nmv_adv);
2829: for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) {
1.16 noro 2830: CQ(t) = CQ(m);
1.14 noro 2831: for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0;
1.43 noro 2832: ndl_reconstruct(obpe,oepos,DL(m),DL(t));
1.16 noro 2833: CQ(mr) = CQ(t);
1.14 noro 2834: ndl_copy(DL(t),DL(mr));
1.11 noro 2835: }
2836: BDY(p) = mr0;
2837: }
2838: }
2839:
1.16 noro 2840: NDV ndtondv(int mod,ND p)
1.3 noro 2841: {
2842: NDV d;
2843: NMV m,m0;
2844: NM t;
2845: int i,len;
2846:
1.34 noro 2847: if ( !p ) return 0;
1.31 noro 2848: len = LEN(p);
1.34 noro 2849: m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv));
1.3 noro 2850: for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) {
1.14 noro 2851: ndl_copy(DL(t),DL(m));
1.16 noro 2852: CQ(m) = CQ(t);
1.3 noro 2853: }
2854: MKNDV(NV(p),m0,len,d);
1.23 noro 2855: SG(d) = SG(p);
2856: return d;
2857: }
2858:
2859: ND ndvtond(int mod,NDV p)
2860: {
2861: ND d;
2862: NM m,m0;
2863: NMV t;
2864: int i,len;
2865:
1.34 noro 2866: if ( !p ) return 0;
1.23 noro 2867: m0 = 0;
2868: len = p->len;
2869: for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) {
2870: NEXTNM(m0,m);
2871: ndl_copy(DL(t),DL(m));
2872: CQ(m) = CQ(t);
2873: }
2874: NEXT(m) = 0;
1.31 noro 2875: MKND(NV(p),m0,len,d);
1.14 noro 2876: SG(d) = SG(p);
1.3 noro 2877: return d;
2878: }
2879:
1.16 noro 2880: NDV dptondv(int mod,DP p)
1.11 noro 2881: {
2882: NDV d;
2883: NMV m0,m;
2884: MP t;
1.20 noro 2885: DP q;
1.11 noro 2886: int l,i,n;
2887:
1.46 noro 2888: if ( mod ) {
2889: _dp_mod(p,mod,0,&q); p = q;
2890: }
1.34 noro 2891: if ( !p ) return 0;
1.11 noro 2892: for ( t = BDY(p), l = 0; t; t = NEXT(t), l++ );
1.46 noro 2893: if ( mod )
1.16 noro 2894: m0 = m = (NMV)MALLOC_ATOMIC(l*nmv_adv);
1.46 noro 2895: else
1.16 noro 2896: m0 = m = (NMV)MALLOC(l*nmv_adv);
1.11 noro 2897: n = NV(p);
1.46 noro 2898: for ( t = BDY(p); t; t = NEXT(t), NMV_ADV(m) ) {
1.34 noro 2899: if ( mod ) CM(m) = ITOS(C(t));
2900: else CQ(m) = (Q)C(t);
1.17 noro 2901: dltondl(n,DL(t),DL(m));
1.11 noro 2902: }
2903: MKNDV(n,m0,l,d);
1.14 noro 2904: SG(d) = SG(p);
1.11 noro 2905: return d;
2906: }
2907:
1.16 noro 2908: DP ndvtodp(int mod,NDV p)
1.11 noro 2909: {
2910: DP d;
2911: MP m0,m;
2912: NMV t;
2913: int len,i,n;
2914:
1.34 noro 2915: if ( !p ) return 0;
1.11 noro 2916: m0 = 0;
1.14 noro 2917: len = LEN(p);
1.11 noro 2918: n = NV(p);
1.17 noro 2919: for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) {
2920: NEXTMP(m0,m);
1.34 noro 2921: if ( mod ) C(m) = STOI(CM(t));
2922: else C(m) = (P)CQ(t);
2923: DL(m) = ndltodl(n,DL(t));
1.11 noro 2924: }
2925: NEXT(m) = 0;
2926: MKDP(NV(p),m0,d);
1.14 noro 2927: SG(d) = SG(p);
1.11 noro 2928: return d;
2929: }
2930:
1.3 noro 2931: void ndv_print(NDV p)
2932: {
2933: NMV m;
2934: int i,len;
2935:
1.34 noro 2936: if ( !p ) printf("0\n");
1.3 noro 2937: else {
1.14 noro 2938: len = LEN(p);
1.3 noro 2939: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
1.14 noro 2940: printf("+%d*",CM(m));
1.16 noro 2941: ndl_print(DL(m));
2942: }
2943: printf("\n");
2944: }
2945: }
2946:
2947: void ndv_print_q(NDV p)
2948: {
2949: NMV m;
2950: int i,len;
2951:
1.34 noro 2952: if ( !p ) printf("0\n");
1.16 noro 2953: else {
2954: len = LEN(p);
2955: for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) {
2956: printf("+");
2957: printexpr(CO,CQ(m));
2958: printf("*");
1.14 noro 2959: ndl_print(DL(m));
1.3 noro 2960: }
2961: printf("\n");
2962: }
1.25 noro 2963: }
2964:
1.27 noro 2965: NODE nd_reducebase(NODE x)
2966: {
2967: int len,i,j;
2968: NDV *w;
2969: NODE t,t0;
2970:
2971: len = length(x);
2972: w = (NDV *)ALLOCA(len*sizeof(NDV));
2973: for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t);
2974: for ( i = 0; i < len; i++ ) {
2975: for ( j = 0; j < i; j++ ) {
2976: if ( w[i] && w[j] )
2977: if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0;
2978: else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0;
2979: }
2980: }
2981: for ( i = len-1, t0 = 0; i >= 0; i-- ) {
2982: if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; }
2983: }
2984: NEXT(t) = 0; x = t0;
2985: return x;
1.11 noro 2986: }
1.32 noro 2987:
1.43 noro 2988: /* XXX incomplete */
2989:
1.32 noro 2990: void nd_init_ord(struct order_spec *ord)
2991: {
1.43 noro 2992: switch ( ord->id ) {
1.32 noro 2993: case 0:
1.43 noro 2994: switch ( ord->ord.simple ) {
2995: case 0:
2996: nd_dcomp = 1;
2997: nd_isrlex = 1;
2998: break;
2999: case 1:
3000: nd_dcomp = 1;
3001: nd_isrlex = 0;
3002: break;
3003: case 2:
3004: nd_dcomp = 0;
3005: nd_isrlex = 0;
1.45 noro 3006: ndl_compare_function = ndl_lex_compare;
1.43 noro 3007: break;
3008: default:
3009: error("nd_gr : unsupported order");
3010: }
1.32 noro 3011: break;
3012: case 1:
1.43 noro 3013: /* XXX */
3014: nd_dcomp = -1;
1.32 noro 3015: nd_isrlex = 0;
1.45 noro 3016: ndl_compare_function = ndl_block_compare;
1.34 noro 3017: break;
1.43 noro 3018: case 2:
3019: error("nd_init_ord : matrix order is not supported yet.");
1.32 noro 3020: break;
3021: }
1.41 noro 3022: nd_ord = ord;
1.32 noro 3023: }
3024:
1.43 noro 3025: BlockMask nd_create_blockmask(struct order_spec *ord)
3026: {
3027: int n,i,j,s,l;
3028: unsigned int *t;
3029: BlockMask bm;
3030:
3031: if ( !ord->id )
3032: return 0;
3033: n = ord->ord.block.length;
3034: bm = (BlockMask)MALLOC(sizeof(struct oBlockMask));
3035: bm->n = n;
3036: bm->order_pair = ord->ord.block.order_pair;
3037: bm->mask = (unsigned int **)MALLOC(n*sizeof(unsigned int *));
3038: for ( i = 0, s = 0; i < n; i++ ) {
3039: bm->mask[i] = t
3040: = (unsigned int *)MALLOC_ATOMIC(nd_wpd*sizeof(unsigned int));
3041: for ( j = 0; j < nd_wpd; j++ ) t[j] = 0;
3042: l = bm->order_pair[i].length;
3043: for ( j = 0; j < l; j++, s++ ) PUT_EXP(t,s,nd_mask0);
3044: }
3045: return bm;
3046: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to nd.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / engine