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