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