=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/engine/nd.c,v retrieving revision 1.13 retrieving revision 1.37 diff -u -p -r1.13 -r1.37 --- OpenXM_contrib2/asir2000/engine/nd.c 2003/07/30 00:55:41 1.13 +++ OpenXM_contrib2/asir2000/engine/nd.c 2003/08/20 08:38:20 1.37 @@ -1,10 +1,8 @@ -/* $OpenXM$ */ +/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.36 2003/08/20 07:55:45 noro Exp $ */ #include "ca.h" #include "inline.h" -#define USE_NDV 1 - #if defined(__GNUC__) #define INLINE inline #elif defined(VISUAL) @@ -13,6 +11,8 @@ #define INLINE #endif +#define USE_GEOBUCKET 1 + #define REDTAB_LEN 32003 typedef struct oPGeoBucket { @@ -23,81 +23,116 @@ typedef struct oPGeoBucket { typedef struct oND { struct oNM *body; int nv; + int len; int sugar; } *ND; typedef struct oNDV { struct oNMV *body; int nv; - int sugar; int len; + int sugar; } *NDV; typedef struct oNM { struct oNM *next; - int c; - int td; + union { + int m; + Q z; + } c; unsigned int dl[1]; } *NM; typedef struct oNMV { - int c; - int td; + union { + int m; + Q z; + } c; unsigned int dl[1]; } *NMV; typedef struct oRHist { struct oRHist *next; int index; - int td; + int sugar; unsigned int dl[1]; } *RHist; typedef struct oND_pairs { struct oND_pairs *next; int i1,i2; - int td,sugar; + int sugar; unsigned int lcm[1]; } *ND_pairs; +int (*nd_compare_function)(unsigned int *a1,unsigned int *a2); + +double nd_scale=2; static unsigned int **nd_bound; -int nd_mod,nd_nvar; -int is_rlex; +int nd_nvar; +int nd_isrlex; int nd_epw,nd_bpe,nd_wpd; unsigned int nd_mask[32]; unsigned int nd_mask0,nd_mask1; + NM _nm_free_list; ND _nd_free_list; ND_pairs _ndp_free_list; + +static NDV *nd_ps; +static NDV *nd_psq; +RHist *nd_psh; +int nd_psn,nd_pslen; + RHist *nd_red; int nd_red_len; -extern int Top,Reverse; -int nd_psn,nd_pslen; int nd_found,nd_create,nd_notfirst; -int *nd_psl; -RHist *nd_psh; int nm_adv; -#define NM_ADV(m) (m = (NM)(((char *)m)+nm_adv)) +int nmv_adv; +int nd_dcomp; -void GC_gcollect(); -NODE append_one(NODE,int); +extern int Top,Reverse,dp_nelim; -#define HTD(d) ((d)->body->td) +#define TD(d) (d[0]) #define HDL(d) ((d)->body->dl) -#define HC(d) ((d)->body->c) +#define HTD(d) (TD(HDL(d))) +#define HCM(d) ((d)->body->c.m) +#define HCQ(d) ((d)->body->c.z) +#define CM(a) ((a)->c.m) +#define CQ(a) ((a)->c.z) +#define DL(a) ((a)->dl) +#define SG(a) ((a)->sugar) +#define LEN(a) ((a)->len) +#define LCM(a) ((a)->lcm) -#define NEWRHist(r) ((r)=(RHist)MALLOC(sizeof(struct oRHist))) -#define NEWND_pairs(m) if(!_ndp_free_list)_NDP_alloc(); (m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list) -#define NEWNM(m) if(!_nm_free_list)_NM_alloc(); (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list) -#define MKND(n,m,d) if(!_nd_free_list)_ND_alloc(); (d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list); (d)->nv=(n); BDY(d)=(m) +#define TD_DL_COMPARE(d1,d2)\ +(TD(d1)>TD(d2)?1:(TD(d1)nv=(n); BDY(d)=(m); (d)->len = l; - -int nmv_adv; -int nmv_len; -NDV ndv_red; - -void ndv_mul_c(NDV p,int mul); -ND ndv_add(ND p1,NDV p2); -NDV ndtondv(ND p); -void ndv_mul_nm(NDV pv,NM m,NDV r); -ND ndv_mul_nm_create(NDV p,NM m0); +#define MKNDV(n,m,l,d) NEWNDV(d); NV(d)=(n); BDY(d)=(m); LEN(d) = l; +void ndv_mul_c(int mod,NDV p,int mul); +NDV ndtondv(int mod,ND p); +ND ndvtond(int mod,NDV p); +ND ndv_mul_nm(int mod,NDV p,NM m0); void ndv_realloc(NDV p,int obpe,int oadv); -NDV dptondv(DP); -DP ndvtodp(NDV); -#else -static ND *nd_ps; -ND dptond(DP); -DP ndtodp(ND); -#endif +NDV dptondv(int,DP); +DP ndvtodp(int,NDV); +ND dptond(int,DP); +DP ndtodp(int,ND); void nd_free_private_storage() { @@ -188,7 +247,7 @@ void _NM_alloc() int i; for ( i = 0; i < 1024; i++ ) { - p = (NM)GC_malloc(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); + p = (NM)GC_malloc(sizeof(struct oNM)+nd_wpd*sizeof(unsigned int)); p->next = _nm_free_list; _nm_free_list = p; } } @@ -211,12 +270,12 @@ void _NDP_alloc() for ( i = 0; i < 1024; i++ ) { p = (ND_pairs)GC_malloc(sizeof(struct oND_pairs) - +(nd_wpd-1)*sizeof(unsigned int)); + +nd_wpd*sizeof(unsigned int)); p->next = _ndp_free_list; _ndp_free_list = p; } } -INLINE nd_length(ND p) +INLINE int nd_length(ND p) { NM m; int i; @@ -234,9 +293,10 @@ INLINE int ndl_reducible(unsigned int *d1,unsigned int unsigned int u1,u2; int i,j; + if ( TD(d1) < TD(d2) ) return 0; switch ( nd_bpe ) { case 4: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; if ( (u1&0xf0000000) < (u2&0xf0000000) ) return 0; if ( (u1&0xf000000) < (u2&0xf000000) ) return 0; @@ -250,7 +310,7 @@ INLINE int ndl_reducible(unsigned int *d1,unsigned int return 1; break; case 6: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; if ( (u1&0x3f000000) < (u2&0x3f000000) ) return 0; if ( (u1&0xfc0000) < (u2&0xfc0000) ) return 0; @@ -261,7 +321,7 @@ INLINE int ndl_reducible(unsigned int *d1,unsigned int return 1; break; case 8: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; if ( (u1&0xff000000) < (u2&0xff000000) ) return 0; if ( (u1&0xff0000) < (u2&0xff0000) ) return 0; @@ -271,7 +331,7 @@ INLINE int ndl_reducible(unsigned int *d1,unsigned int return 1; break; case 16: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; if ( (u1&0xffff0000) < (u2&0xffff0000) ) return 0; if ( (u1&0xffff) < (u2&0xffff) ) return 0; @@ -279,12 +339,12 @@ INLINE int ndl_reducible(unsigned int *d1,unsigned int return 1; break; case 32: - for ( i = 0; i < nd_wpd; i++ ) + for ( i = 1; i <= nd_wpd; i++ ) if ( d1[i] < d2[i] ) return 0; return 1; break; default: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; for ( j = 0; j < nd_epw; j++ ) if ( (u1&nd_mask[j]) < (u2&nd_mask[j]) ) return 0; @@ -293,6 +353,33 @@ INLINE int ndl_reducible(unsigned int *d1,unsigned int } } +void ndl_dehomogenize(unsigned int *d) +{ + unsigned int mask; + unsigned int h; + int i,bits; + + if ( nd_isrlex ) { + if ( nd_bpe == 32 ) { + h = d[1]; + for ( i = 2; i <= nd_wpd; i++ ) + d[i-1] = d[i]; + d[i-1] = 0; + TD(d) -= h; + } else { + bits = nd_epw*nd_bpe; + mask = bits==32?0xffffffff:((1<<(nd_epw*nd_bpe))-1); + h = (d[1]>>((nd_epw-1)*nd_bpe))&nd_mask0; + for ( i = 1; i <= nd_wpd; i++ ) + d[i] = ((d[i]<>((nd_epw-1)*nd_bpe))&nd_mask0):0); + TD(d) -= h; + } + } else + TD(d) -= ((d[(nd_nvar-1)/nd_epw+1]>> + ((nd_epw-((nd_nvar-1)%nd_epw)-1)*nd_bpe))&((1<t2?t1:t2; t1 = (u1&0xf000000); t2 = (u2&0xf000000); u |= t1>t2?t1:t2; @@ -314,7 +401,7 @@ void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in } break; case 6: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; t1 = (u1&0x3f000000); t2 = (u2&0x3f000000); u = t1>t2?t1:t2; t1 = (u1&0xfc0000); t2 = (u2&0xfc0000); u |= t1>t2?t1:t2; @@ -325,7 +412,7 @@ void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in } break; case 8: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; t1 = (u1&0xff000000); t2 = (u2&0xff000000); u = t1>t2?t1:t2; t1 = (u1&0xff0000); t2 = (u2&0xff0000); u |= t1>t2?t1:t2; @@ -335,7 +422,7 @@ void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in } break; case 16: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; t1 = (u1&0xffff0000); t2 = (u2&0xffff0000); u = t1>t2?t1:t2; t1 = (u1&0xffff); t2 = (u2&0xffff); u |= t1>t2?t1:t2; @@ -343,13 +430,13 @@ void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in } break; case 32: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; d[i] = u1>u2?u1:u2; } break; default: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; for ( j = 0, u = 0; j < nd_epw; j++ ) { t1 = (u1&nd_mask[j]); t2 = (u2&nd_mask[j]); u |= t1>t2?t1:t2; @@ -358,6 +445,7 @@ void ndl_lcm(unsigned int *d1,unsigned *d2,unsigned in } break; } + TD(d) = ndl_td(d); } int ndl_td(unsigned int *d) @@ -365,7 +453,7 @@ int ndl_td(unsigned int *d) unsigned int t,u; int i,j; - for ( t = 0, i = 0; i < nd_wpd; i++ ) { + for ( t = 0, i = 1; i <= nd_wpd; i++ ) { u = d[i]; for ( j = 0; j < nd_epw; j++, u>>=nd_bpe ) t += (u&nd_mask0); @@ -373,15 +461,15 @@ int ndl_td(unsigned int *d) return t; } -INLINE int ndl_compare(unsigned int *d1,unsigned int *d2) +INLINE int ndl_lex_compare(unsigned int *d1,unsigned int *d2) { int i; for ( i = 0; i < nd_wpd; i++, d1++, d2++ ) if ( *d1 > *d2 ) - return is_rlex ? -1 : 1; + return nd_isrlex ? -1 : 1; else if ( *d1 < *d2 ) - return is_rlex ? 1 : -1; + return nd_isrlex ? 1 : -1; return 0; } @@ -389,8 +477,9 @@ INLINE int ndl_equal(unsigned int *d1,unsigned int *d2 { int i; - for ( i = 0; i < nd_wpd; i++ ) - if ( d1[i] != d2[i] ) + if ( *d1++ != *d2++ ) return 0; + for ( i = 1; i <= nd_wpd; i++ ) + if ( *d1++ != *d2++ ) return 0; return 1; } @@ -401,14 +490,16 @@ INLINE void ndl_copy(unsigned int *d1,unsigned int *d2 switch ( nd_wpd ) { case 1: - d2[0] = d1[0]; + TD(d2) = TD(d1); + d2[1] = d1[1]; break; case 2: - d2[0] = d1[0]; + TD(d2) = TD(d1); d2[1] = d1[1]; + d2[2] = d1[2]; break; default: - for ( i = 0; i < nd_wpd; i++ ) + for ( i = 0; i <= nd_wpd; i++ ) d2[i] = d1[i]; break; } @@ -418,45 +509,27 @@ INLINE void ndl_add(unsigned int *d1,unsigned int *d2, { int i; + TD(d) = TD(d1)+TD(d2); switch ( nd_wpd ) { case 1: - d[0] = d1[0]+d2[0]; + d[1] = d1[1]+d2[1]; break; case 2: - d[0] = d1[0]+d2[0]; d[1] = d1[1]+d2[1]; + d[2] = d1[2]+d2[2]; break; default: - for ( i = 0; i < nd_wpd; i++ ) + for ( i = 1; i <= nd_wpd; i++ ) d[i] = d1[i]+d2[i]; break; } } -INLINE void ndl_add2(unsigned int *d1,unsigned int *d2) +INLINE void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d) { int i; - switch ( nd_wpd ) { - case 1: - d2[0] += d1[0]; - break; - case 2: - d2[0] += d1[0]; - d2[1] += d1[1]; - break; - default: - for ( i = 0; i < nd_wpd; i++ ) - d2[i] += d1[i]; - break; - } -} - -void ndl_sub(unsigned int *d1,unsigned int *d2,unsigned int *d) -{ - int i; - - for ( i = 0; i < nd_wpd; i++ ) + for ( i = 0; i <= nd_wpd; i++ ) d[i] = d1[i]-d2[i]; } @@ -467,7 +540,7 @@ int ndl_disjoint(unsigned int *d1,unsigned int *d2) switch ( nd_bpe ) { case 4: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; t1 = u1&0xf0000000; t2 = u2&0xf0000000; if ( t1&&t2 ) return 0; t1 = u1&0xf000000; t2 = u2&0xf000000; if ( t1&&t2 ) return 0; @@ -481,7 +554,7 @@ int ndl_disjoint(unsigned int *d1,unsigned int *d2) return 1; break; case 6: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; t1 = u1&0x3f000000; t2 = u2&0x3f000000; if ( t1&&t2 ) return 0; t1 = u1&0xfc0000; t2 = u2&0xfc0000; if ( t1&&t2 ) return 0; @@ -492,7 +565,7 @@ int ndl_disjoint(unsigned int *d1,unsigned int *d2) return 1; break; case 8: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; t1 = u1&0xff000000; t2 = u2&0xff000000; if ( t1&&t2 ) return 0; t1 = u1&0xff0000; t2 = u2&0xff0000; if ( t1&&t2 ) return 0; @@ -502,7 +575,7 @@ int ndl_disjoint(unsigned int *d1,unsigned int *d2) return 1; break; case 16: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; t1 = u1&0xffff0000; t2 = u2&0xffff0000; if ( t1&&t2 ) return 0; t1 = u1&0xffff; t2 = u2&0xffff; if ( t1&&t2 ) return 0; @@ -510,12 +583,12 @@ int ndl_disjoint(unsigned int *d1,unsigned int *d2) return 1; break; case 32: - for ( i = 0; i < nd_wpd; i++ ) + for ( i = 1; i <= nd_wpd; i++ ) if ( d1[i] && d2[i] ) return 0; return 1; break; default: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u1 = d1[i]; u2 = d2[i]; for ( j = 0; j < nd_epw; j++ ) { if ( (u1&nd_mask0) && (u2&nd_mask0) ) return 0; @@ -527,205 +600,6 @@ int ndl_disjoint(unsigned int *d1,unsigned int *d2) } } -ND nd_reduce(ND p1,ND p2) -{ - int c,c1,c2,t,td,td2,mul; - NM m2,prev,head,cur,new; - unsigned int *d; - - if ( !p1 ) - return 0; - else { - c2 = invm(HC(p2),nd_mod); - c1 = nd_mod-HC(p1); - DMAR(c1,c2,0,nd_mod,mul); - td = HTD(p1)-HTD(p2); - d = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); - ndl_sub(HDL(p1),HDL(p2),d); - prev = 0; head = cur = BDY(p1); - NEWNM(new); - for ( m2 = BDY(p2); m2; ) { - td2 = new->td = m2->td+td; - ndl_add(m2->dl,d,new->dl); - if ( !cur ) { - c1 = C(m2); - DMAR(c1,mul,0,nd_mod,c2); - C(new) = c2; - if ( !prev ) { - prev = new; - NEXT(prev) = 0; - head = prev; - } else { - NEXT(prev) = new; - NEXT(new) = 0; - prev = new; - } - m2 = NEXT(m2); - NEWNM(new); - continue; - } - if ( cur->td > td2 ) - c = 1; - else if ( cur->td < td2 ) - c = -1; - else - c = ndl_compare(cur->dl,new->dl); - switch ( c ) { - case 0: - c2 = C(m2); - c1 = C(cur); - DMAR(c2,mul,c1,nd_mod,t); - if ( t ) - C(cur) = t; - else if ( !prev ) { - head = NEXT(cur); - FREENM(cur); - cur = head; - } else { - NEXT(prev) = NEXT(cur); - FREENM(cur); - cur = NEXT(prev); - } - m2 = NEXT(m2); - break; - case 1: - prev = cur; - cur = NEXT(cur); - break; - case -1: - if ( !prev ) { - /* cur = head */ - prev = new; - c2 = C(m2); - DMAR(c2,mul,0,nd_mod,c1); - C(prev) = c1; - NEXT(prev) = head; - head = prev; - } else { - c2 = C(m2); - DMAR(c2,mul,0,nd_mod,c1); - C(new) = c1; - NEXT(prev) = new; - NEXT(new) = cur; - prev = new; - } - NEWNM(new); - m2 = NEXT(m2); - break; - } - } - FREENM(new); - if ( head ) { - BDY(p1) = head; - p1->sugar = MAX(p1->sugar,p2->sugar+td); - return p1; - } else { - FREEND(p1); - return 0; - } - - } -} - -/* HDL(p1) = HDL(p2) */ - -ND nd_reduce_special(ND p1,ND p2) -{ - int c,c1,c2,t,td,td2,mul; - NM m2,prev,head,cur,new; - - if ( !p1 ) - return 0; - else { - c2 = invm(HC(p2),nd_mod); - c1 = nd_mod-HC(p1); - DMAR(c1,c2,0,nd_mod,mul); - prev = 0; head = cur = BDY(p1); - NEWNM(new); - for ( m2 = BDY(p2); m2; ) { - td2 = new->td = m2->td; - if ( !cur ) { - c1 = C(m2); - DMAR(c1,mul,0,nd_mod,c2); - C(new) = c2; - bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); - if ( !prev ) { - prev = new; - NEXT(prev) = 0; - head = prev; - } else { - NEXT(prev) = new; - NEXT(new) = 0; - prev = new; - } - m2 = NEXT(m2); - NEWNM(new); - continue; - } - if ( cur->td > td2 ) - c = 1; - else if ( cur->td < td2 ) - c = -1; - else - c = ndl_compare(cur->dl,m2->dl); - switch ( c ) { - case 0: - c2 = C(m2); - c1 = C(cur); - DMAR(c2,mul,c1,nd_mod,t); - if ( t ) - C(cur) = t; - else if ( !prev ) { - head = NEXT(cur); - FREENM(cur); - cur = head; - } else { - NEXT(prev) = NEXT(cur); - FREENM(cur); - cur = NEXT(prev); - } - m2 = NEXT(m2); - break; - case 1: - prev = cur; - cur = NEXT(cur); - break; - case -1: - bcopy(m2->dl,new->dl,nd_wpd*sizeof(unsigned int)); - if ( !prev ) { - /* cur = head */ - prev = new; - c2 = C(m2); - DMAR(c2,mul,0,nd_mod,c1); - C(prev) = c1; - NEXT(prev) = head; - head = prev; - } else { - c2 = C(m2); - DMAR(c2,mul,0,nd_mod,c1); - C(new) = c1; - NEXT(prev) = new; - NEXT(new) = cur; - prev = new; - } - NEWNM(new); - m2 = NEXT(m2); - break; - } - } - FREENM(new); - if ( head ) { - BDY(p1) = head; - p1->sugar = MAX(p1->sugar,p2->sugar+td); - return p1; - } else { - FREEND(p1); - return 0; - } - - } -} - int ndl_check_bound2(int index,unsigned int *d2) { unsigned int u2; @@ -736,7 +610,7 @@ int ndl_check_bound2(int index,unsigned int *d2) ind = 0; switch ( nd_bpe ) { case 4: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u2 = d2[i]; if ( d1[ind++]+((u2>>28)&0xf) >= 0x10 ) return 1; if ( d1[ind++]+((u2>>24)&0xf) >= 0x10 ) return 1; @@ -750,7 +624,7 @@ int ndl_check_bound2(int index,unsigned int *d2) return 0; break; case 6: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u2 = d2[i]; if ( d1[ind++]+((u2>>24)&0x3f) >= 0x40 ) return 1; if ( d1[ind++]+((u2>>18)&0x3f) >= 0x40 ) return 1; @@ -761,7 +635,7 @@ int ndl_check_bound2(int index,unsigned int *d2) return 0; break; case 8: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u2 = d2[i]; if ( d1[ind++]+((u2>>24)&0xff) >= 0x100 ) return 1; if ( d1[ind++]+((u2>>16)&0xff) >= 0x100 ) return 1; @@ -771,7 +645,7 @@ int ndl_check_bound2(int index,unsigned int *d2) return 0; break; case 16: - for ( i = 0; i < nd_wpd; i++ ) { + for ( i = 1; i <= nd_wpd; i++ ) { u2 = d2[i]; if ( d1[ind++]+((u2>>16)&0xffff) > 0x10000 ) return 1; if ( d1[ind++]+(u2&0xffff) > 0x10000 ) return 1; @@ -779,12 +653,12 @@ int ndl_check_bound2(int index,unsigned int *d2) return 0; break; case 32: - for ( i = 0; i < nd_wpd; i++ ) + for ( i = 1; i <= nd_wpd; i++ ) if ( d1[i]+d2[i]>28)&0xf)+((u2>>28)&0xf) >= 0x10 ) return 1; + if ( ((u1>>24)&0xf)+((u2>>24)&0xf) >= 0x10 ) return 1; + if ( ((u1>>20)&0xf)+((u2>>20)&0xf) >= 0x10 ) return 1; + if ( ((u1>>16)&0xf)+((u2>>16)&0xf) >= 0x10 ) return 1; + if ( ((u1>>12)&0xf)+((u2>>12)&0xf) >= 0x10 ) return 1; + if ( ((u1>>8)&0xf)+((u2>>8)&0xf) >= 0x10 ) return 1; + if ( ((u1>>4)&0xf)+((u2>>4)&0xf) >= 0x10 ) return 1; + if ( (u1&0xf)+(u2&0xf) >= 0x10 ) return 1; + } + return 0; + break; + case 6: + for ( i = 1; i <= nd_wpd; i++ ) { + u1 = d1[i]; u2 = d2[i]; + if ( ((u1>>24)&0x3f)+((u2>>24)&0x3f) >= 0x40 ) return 1; + if ( ((u1>>18)&0x3f)+((u2>>18)&0x3f) >= 0x40 ) return 1; + if ( ((u1>>12)&0x3f)+((u2>>12)&0x3f) >= 0x40 ) return 1; + if ( ((u1>>6)&0x3f)+((u2>>6)&0x3f) >= 0x40 ) return 1; + if ( (u1&0x3f)+(u2&0x3f) >= 0x40 ) return 1; + } + return 0; + break; + case 8: + for ( i = 1; i <= nd_wpd; i++ ) { + u1 = d1[i]; u2 = d2[i]; + if ( ((u1>>24)&0xff)+((u2>>24)&0xff) >= 0x100 ) return 1; + if ( ((u1>>16)&0xff)+((u2>>16)&0xff) >= 0x100 ) return 1; + if ( ((u1>>8)&0xff)+((u2>>8)&0xff) >= 0x100 ) return 1; + if ( (u1&0xff)+(u2&0xff) >= 0x100 ) return 1; + } + return 0; + break; + case 16: + for ( i = 1; i <= nd_wpd; i++ ) { + u1 = d1[i]; u2 = d2[i]; + if ( ((u1>>16)&0xffff)+((u2>>16)&0xffff) > 0x10000 ) return 1; + if ( (u2&0xffff)+(u2&0xffff) > 0x10000 ) return 1; + } + return 0; + break; + case 32: + for ( i = 1; i <= nd_wpd; i++ ) + if ( d1[i]+d2[i]>k)&nd_mask0)+((u2>>k)&nd_mask0) > nd_mask0 ) + return 1; + } + return 0; + break; + } +} + +INLINE int ndl_hash_value(unsigned int *d) +{ int i; int r; - r = td; - for ( i = 0; i < nd_wpd; i++ ) + r = 0; + for ( i = 0; i <= nd_wpd; i++ ) r = ((r<<16)+d[i])%REDTAB_LEN; return r; } @@ -809,67 +750,134 @@ INLINE int ndl_hash_value(int td,unsigned int *d) INLINE int nd_find_reducer(ND g) { RHist r; + unsigned int *dg; int d,k,i; - d = ndl_hash_value(HTD(g),HDL(g)); + dg = HDL(g); + d = ndl_hash_value(HDL(g)); for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) { - if ( HTD(g) == r->td && ndl_equal(HDL(g),r->dl) ) { + if ( ndl_equal(dg,DL(r)) ) { if ( k > 0 ) nd_notfirst++; nd_found++; return r->index; } } - if ( Reverse ) for ( i = nd_psn-1; i >= 0; i-- ) { r = nd_psh[i]; - if ( HTD(g) >= r->td && ndl_reducible(HDL(g),r->dl) ) { + if ( ndl_reducible(dg,DL(r)) ) { nd_create++; - nd_append_red(HDL(g),HTD(g),i); + nd_append_red(dg,i); return i; } } else for ( i = 0; i < nd_psn; i++ ) { r = nd_psh[i]; - if ( HTD(g) >= r->td && ndl_reducible(HDL(g),r->dl) ) { + if ( ndl_reducible(dg,DL(r)) ) { nd_create++; - nd_append_red(HDL(g),HTD(g),i); + nd_append_red(dg,i); return i; } } return -1; } -ND nd_add(ND p1,ND p2) +INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len) { + NDV r; + RHist s; + int d,k,i; + + if ( Reverse ) + for ( i = len-1; i >= 0; i-- ) { + r = ps[i]; + if ( ndl_reducible(HDL(g),HDL(r)) ) { + nd_append_red(HDL(g),i); + return i; + } + } + else + for ( i = 0; i < len; i++ ) { + r = ps[i]; + if ( ndl_reducible(HDL(g),HDL(r)) ) { + nd_append_red(HDL(g),i); + return i; + } + } + return -1; +} + +ND nd_add(int mod,ND p1,ND p2) +{ int n,c; - int t; + int t,can,td1,td2; ND r; NM m1,m2,mr0,mr,s; - if ( !p1 ) - return p2; - else if ( !p2 ) + if ( !p1 ) return p2; + else if ( !p2 ) return p1; + else if ( !mod ) return nd_add_q(p1,p2); + else { + can = 0; + for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { + c = DL_COMPARE(DL(m1),DL(m2)); + switch ( c ) { + case 0: + t = ((CM(m1))+(CM(m2))) - mod; + if ( t < 0 ) t += mod; + s = m1; m1 = NEXT(m1); + if ( t ) { + can++; NEXTNM2(mr0,mr,s); CM(mr) = (t); + } else { + can += 2; FREENM(s); + } + s = m2; m2 = NEXT(m2); FREENM(s); + break; + case 1: + s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s); + break; + case -1: + s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s); + break; + } + } + if ( !mr0 ) + if ( m1 ) mr0 = m1; + else if ( m2 ) mr0 = m2; + else return 0; + else if ( m1 ) NEXT(mr) = m1; + else if ( m2 ) NEXT(mr) = m2; + else NEXT(mr) = 0; + BDY(p1) = mr0; + SG(p1) = MAX(SG(p1),SG(p2)); + LEN(p1) = LEN(p1)+LEN(p2)-can; + FREEND(p2); return p1; + } +} + +ND nd_add_q(ND p1,ND p2) +{ + int n,c,can; + ND r; + NM m1,m2,mr0,mr,s; + Q t; + + if ( !p1 ) return p2; + else if ( !p2 ) return p1; else { + can = 0; for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { - if ( m1->td > m2->td ) - c = 1; - else if ( m1->td < m2->td ) - c = -1; - else - c = ndl_compare(m1->dl,m2->dl); + c = DL_COMPARE(DL(m1),DL(m2)); switch ( c ) { case 0: - t = ((C(m1))+(C(m2))) - nd_mod; - if ( t < 0 ) - t += nd_mod; + addq(CQ(m1),CQ(m2),&t); s = m1; m1 = NEXT(m1); if ( t ) { - NEXTNM2(mr0,mr,s); C(mr) = (t); + can++; NEXTNM2(mr0,mr,s); CQ(mr) = (t); } else { - FREENM(s); + can += 2; FREENM(s); } s = m2; m2 = NEXT(m2); FREENM(s); break; @@ -882,110 +890,391 @@ ND nd_add(ND p1,ND p2) } } if ( !mr0 ) - if ( m1 ) - mr0 = m1; - else if ( m2 ) - mr0 = m2; - else - return 0; - else if ( m1 ) - NEXT(mr) = m1; - else if ( m2 ) - NEXT(mr) = m2; - else - NEXT(mr) = 0; + if ( m1 ) mr0 = m1; + else if ( m2 ) mr0 = m2; + else return 0; + else if ( m1 ) NEXT(mr) = m1; + else if ( m2 ) NEXT(mr) = m2; + else NEXT(mr) = 0; BDY(p1) = mr0; - p1->sugar = MAX(p1->sugar,p2->sugar); + SG(p1) = MAX(SG(p1),SG(p2)); + LEN(p1) = LEN(p1)+LEN(p2)-can; FREEND(p2); return p1; } } -#if 1 /* ret=1 : success, ret=0 : overflow */ -int nd_nf(ND g,int full,ND *rp) +int nd_nf(int mod,ND g,int full,ND *rp) { ND d; NM m,mrd,tail; NM mul; int n,sugar,psugar,sugar0,stat,index; - int c,c1,c2; -#if USE_NDV + int c,c1,c2,dummy; + RHist h; NDV p,red; -#else - ND p,red; -#endif + Q cg,cred,gcd; + double hmag; if ( !g ) { *rp = 0; return 1; } - sugar0 = sugar = g->sugar; + if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; + + sugar0 = sugar = SG(g); n = NV(g); - mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); + mul = (NM)ALLOCA(sizeof(struct oNM)+nd_wpd*sizeof(unsigned int)); for ( d = 0; g; ) { index = nd_find_reducer(g); if ( index >= 0 ) { - p = nd_ps[index]; - ndl_sub(HDL(g),HDL(p),mul->dl); - mul->td = HTD(g)-HTD(p); -#if 0 - if ( d && (p->sugar+mul->td) > sugar ) { - goto afo; - } -#endif - if ( ndl_check_bound2(index,mul->dl) ) { + h = nd_psh[index]; + ndl_sub(HDL(g),DL(h),DL(mul)); + if ( ndl_check_bound2(index,DL(mul)) ) { nd_free(g); nd_free(d); return 0; } - c1 = invm(HC(p),nd_mod); c2 = nd_mod-HC(g); - DMAR(c1,c2,0,nd_mod,c); C(mul) = c; -#if USE_NDV - ndv_mul_nm(nd_ps[index],mul,ndv_red); - g = ndv_add(g,ndv_red); - sugar = MAX(sugar,ndv_red->sugar); + if ( mod ) { + p = nd_ps[index]; + c1 = invm(HCM(p),mod); c2 = mod-HCM(g); + DMAR(c1,c2,0,mod,c); CM(mul) = c; + } else { + p = nd_psq[index]; + igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); + chsgnq(cg,&CQ(mul)); + nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); + } + g = nd_add(mod,g,ndv_mul_nm(mod,p,mul)); + sugar = MAX(sugar,SG(p)+TD(DL(mul))); + if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { + nd_removecont2(d,g); + hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; + } + } else if ( !full ) { + *rp = g; + return 1; + } else { + m = BDY(g); + if ( NEXT(m) ) { + BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--; + } else { + FREEND(g); g = 0; + } + if ( d ) { + NEXT(tail)=m; tail=m; LEN(d)++; + } else { + MKND(n,m,1,d); tail = BDY(d); + } + } + } + if ( d ) SG(d) = sugar; + *rp = d; + return 1; +} + +int nd_nf_pbucket(int mod,ND g,int full,ND *rp) +{ + int hindex,index; + NDV p; + ND u,d,red; + NODE l; + NM mul,m,mrd,tail; + int sugar,psugar,n,h_reducible; + PGeoBucket bucket; + int c,c1,c2; + Q cg,cred,gcd,zzz; + RHist h; + double hmag,gmag; + + if ( !g ) { + *rp = 0; + return 1; + } + sugar = SG(g); + n = NV(g); + if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; + bucket = create_pbucket(); + add_pbucket(mod,bucket,g); + d = 0; + mul = (NM)ALLOCA(sizeof(struct oNM)+nd_wpd*sizeof(unsigned int)); + while ( 1 ) { + hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket); + if ( hindex < 0 ) { + if ( d ) SG(d) = sugar; + *rp = d; + return 1; + } + g = bucket->body[hindex]; + index = nd_find_reducer(g); + if ( index >= 0 ) { + h = nd_psh[index]; + ndl_sub(HDL(g),DL(h),DL(mul)); + if ( ndl_check_bound2(index,DL(mul)) ) { + nd_free(d); + free_pbucket(bucket); + *rp = 0; + return 0; + } + if ( mod ) { + p = nd_ps[index]; + c1 = invm(HCM(p),mod); c2 = mod-HCM(g); + DMAR(c1,c2,0,mod,c); CM(mul) = c; + } else { + p = nd_psq[index]; + igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); + chsgnq(cg,&CQ(mul)); + nd_mul_c_q(d,cred); + mulq_pbucket(bucket,cred); + g = bucket->body[hindex]; + gmag = (double)p_mag((P)HCQ(g)); + } + red = ndv_mul_nm(mod,p,mul); + bucket->body[hindex] = nd_remove_head(g); + red = nd_remove_head(red); + add_pbucket(mod,bucket,red); + psugar = SG(p)+TD(DL(mul)); + sugar = MAX(sugar,psugar); + if ( !mod && hmag && (gmag > hmag) ) { + g = normalize_pbucket(mod,bucket); + if ( !g ) { + if ( d ) SG(d) = sugar; + *rp = d; + return 1; + } + nd_removecont2(d,g); + hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; + add_pbucket(mod,bucket,g); + } + } else if ( !full ) { + g = normalize_pbucket(mod,bucket); + if ( g ) SG(g) = sugar; + *rp = g; + return 1; + } else { + m = BDY(g); + if ( NEXT(m) ) { + BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--; + } else { + FREEND(g); g = 0; + } + bucket->body[hindex] = g; + NEXT(m) = 0; + if ( d ) { + NEXT(tail)=m; tail=m; LEN(d)++; + } else { + MKND(n,m,1,d); tail = BDY(d); + } + } + } +} + +int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full,ND *rp) +{ + ND d; + NM m,mrd,tail; + NM mul; + int n,sugar,psugar,sugar0,stat,index; + int c,c1,c2; + RHist h; + NDV p,red; + Q cg,cred,gcd; + double hmag; + + if ( !g ) { + *rp = 0; + return 1; + } +#if 0 + if ( !mod ) + hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; #else - red = nd_mul_ind_nm(index,mul); - g = nd_add(g,red); - sugar = MAX(sugar,red->sugar); + /* XXX */ + hmag = 0; #endif + + sugar0 = sugar = SG(g); + n = NV(g); + mul = (NM)ALLOCA(sizeof(struct oNM)+nd_wpd*sizeof(unsigned int)); + for ( d = 0; g; ) { + index = nd_find_reducer_direct(g,ps,len); + if ( index >= 0 ) { + p = ps[index]; + ndl_sub(HDL(g),HDL(p),DL(mul)); + if ( ndl_check_bound2_direct(HDL(p),DL(mul)) ) { + nd_free(g); nd_free(d); + return 0; + } + if ( mod ) { + c1 = invm(HCM(p),mod); c2 = mod-HCM(g); + DMAR(c1,c2,0,mod,c); CM(mul) = c; + } else { + igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); + chsgnq(cg,&CQ(mul)); + nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); + } + g = nd_add(mod,g,ndv_mul_nm(mod,p,mul)); + sugar = MAX(sugar,SG(p)+TD(DL(mul))); + if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { + nd_removecont2(d,g); + hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; + } } else if ( !full ) { *rp = g; return 1; } else { -afo: m = BDY(g); if ( NEXT(m) ) { - BDY(g) = NEXT(m); NEXT(m) = 0; + BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--; } else { FREEND(g); g = 0; } if ( d ) { - NEXT(tail)=m; - tail=m; + NEXT(tail)=m; tail=m; LEN(d)++; } else { - MKND(n,m,d); - tail = BDY(d); + MKND(n,m,1,d); tail = BDY(d); } } } - if ( d ) - d->sugar = sugar; + if ( d ) SG(d) = sugar; *rp = d; return 1; } + +int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,int full,ND *rp) +{ + int hindex,index; + NDV p; + ND u,d,red; + NODE l; + NM mul,m,mrd,tail; + int sugar,psugar,n,h_reducible; + PGeoBucket bucket; + int c,c1,c2; + Q cg,cred,gcd,zzz; + RHist h; + double hmag,gmag; + + if ( !g ) { + *rp = 0; + return 1; + } + sugar = SG(g); + n = NV(g); +#if 0 + if ( !mod ) + hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; #else + /* XXX */ + hmag = 0; +#endif + bucket = create_pbucket(); + add_pbucket(mod,bucket,g); + d = 0; + mul = (NM)ALLOCA(sizeof(struct oNM)+nd_wpd*sizeof(unsigned int)); + while ( 1 ) { + hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket); + if ( hindex < 0 ) { + if ( d ) + SG(d) = sugar; + *rp = d; + return 1; + } + g = bucket->body[hindex]; + index = nd_find_reducer_direct(g,ps,len); + if ( index >= 0 ) { + p = ps[index]; + ndl_sub(HDL(g),HDL(p),DL(mul)); + if ( ndl_check_bound2_direct(HDL(p),DL(mul)) ) { + nd_free(d); + free_pbucket(bucket); + *rp = 0; + return 0; + } + if ( mod ) { + c1 = invm(HCM(p),mod); c2 = mod-HCM(g); + DMAR(c1,c2,0,mod,c); CM(mul) = c; + } else { + igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); + chsgnq(cg,&CQ(mul)); + nd_mul_c_q(d,cred); + mulq_pbucket(bucket,cred); + g = bucket->body[hindex]; + gmag = (double)p_mag((P)HCQ(g)); + } + red = ndv_mul_nm(mod,p,mul); + bucket->body[hindex] = nd_remove_head(g); + red = nd_remove_head(red); + add_pbucket(mod,bucket,red); + sugar = MAX(sugar,SG(p)+TD(DL(mul))); + if ( !mod && hmag && (gmag > hmag) ) { + g = normalize_pbucket(mod,bucket); + if ( !g ) { + if ( d ) SG(d) = sugar; + *rp = d; + return 1; + } + nd_removecont2(d,g); + hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; + add_pbucket(mod,bucket,g); + } + } else if ( !full ) { + g = normalize_pbucket(mod,bucket); + if ( g ) SG(g) = sugar; + *rp = g; + return 1; + } else { + m = BDY(g); + if ( NEXT(m) ) { + BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--; + } else { + FREEND(g); g = 0; + } + bucket->body[hindex] = g; + NEXT(m) = 0; + if ( d ) { + NEXT(tail)=m; tail=m; LEN(d)++; + } else { + MKND(n,m,1,d); tail = BDY(d); + } + } + } +} +/* input : list of DP, cand : list of DP */ + +int nd_check_candidate(NODE input,NODE cand) +{ + int n,i,stat; + ND nf,d; + NODE t; + + nd_setup(0,cand); + n = length(cand); + + /* membercheck : list is a subset of Id(cand) ? */ + for ( t = input; t; t = NEXT(t) ) { + d = dptond(0,(DP)BDY(t)); + stat = nd_nf_direct(0,d,nd_psq,n,0,&nf); + if ( !stat ) nd_reconstruct_direct(0,nd_psq,n); + else if ( nf ) return 0; + } + /* gbcheck : cand is a GB of Id(cand) ? */ + if ( !nd_gb(0,1) ) return 0; + /* XXX */ + return 1; +} + ND nd_remove_head(ND p) { NM m; m = BDY(p); if ( !NEXT(m) ) { - FREEND(p); - p = 0; - } else - BDY(p) = NEXT(m); + FREEND(p); p = 0; + } else { + BDY(p) = NEXT(m); LEN(p)--; + } FREENM(m); return p; } @@ -999,24 +1288,45 @@ PGeoBucket create_pbucket() return g; } -void add_pbucket(PGeoBucket g,ND d) +void free_pbucket(PGeoBucket b) { + int i; + + for ( i = 0; i <= b->m; i++ ) + if ( b->body[i] ) { + nd_free(b->body[i]); + b->body[i] = 0; + } + GC_free(b); +} + +void add_pbucket(int mod,PGeoBucket g,ND d) { - int l,k,m; + int l,i,k,m; - l = nd_length(d); - for ( k = 0, m = 1; l > m; k++, m <<= 2 ); - /* 4^(k-1) < l <= 4^k */ - d = nd_add(g->body[k],d); - for ( ; d && nd_length(d) > 1<<(2*k); k++ ) { + if ( !d ) + return; + l = LEN(d); + for ( k = 0, m = 1; l > m; k++, m <<= 1 ); + /* 2^(k-1) < l <= 2^k (=m) */ + d = nd_add(mod,g->body[k],d); + for ( ; d && LEN(d) > m; k++, m <<= 1 ) { g->body[k] = 0; - d = nd_add(g->body[k+1],d); + d = nd_add(mod,g->body[k+1],d); } g->body[k] = d; g->m = MAX(g->m,k); } -int head_pbucket(PGeoBucket g) +void mulq_pbucket(PGeoBucket g,Q c) { + int k; + + for ( k = 0; k <= g->m; k++ ) + nd_mul_c_q(g->body[k],c); +} + +int head_pbucket(int mod,PGeoBucket g) +{ int j,i,c,k,nv,sum; unsigned int *di,*dj; ND gi,gj; @@ -1031,157 +1341,246 @@ int head_pbucket(PGeoBucket g) j = i; gj = g->body[j]; dj = HDL(gj); - sum = HC(gj); + sum = HCM(gj); } else { - di = HDL(gi); - nv = NV(gi); - if ( HTD(gi) > HTD(gj) ) - c = 1; - else if ( HTD(gi) < HTD(gj) ) - c = -1; - else - c = ndl_compare(di,dj); + c = DL_COMPARE(HDL(gi),dj); if ( c > 0 ) { - if ( sum ) - HC(gj) = sum; - else - g->body[j] = nd_remove_head(gj); + if ( sum ) HCM(gj) = sum; + else g->body[j] = nd_remove_head(gj); j = i; gj = g->body[j]; dj = HDL(gj); - sum = HC(gj); + sum = HCM(gj); } else if ( c == 0 ) { - sum = sum+HC(gi)-nd_mod; - if ( sum < 0 ) - sum += nd_mod; + sum = sum+HCM(gi)-mod; + if ( sum < 0 ) sum += mod; g->body[i] = nd_remove_head(gi); } } } - if ( j < 0 ) - return -1; + if ( j < 0 ) return -1; else if ( sum ) { - HC(gj) = sum; + HCM(gj) = sum; return j; } else g->body[j] = nd_remove_head(gj); } } -ND normalize_pbucket(PGeoBucket g) +int head_pbucket_q(PGeoBucket g) { + int j,i,c,k,nv; + Q sum,t; + ND gi,gj; + + k = g->m; + while ( 1 ) { + j = -1; + for ( i = 0; i <= k; i++ ) { + if ( !(gi = g->body[i]) ) continue; + if ( j < 0 ) { + j = i; + gj = g->body[j]; + sum = HCQ(gj); + } else { + nv = NV(gi); + c = DL_COMPARE(HDL(gi),HDL(gj)); + if ( c > 0 ) { + if ( sum ) HCQ(gj) = sum; + else g->body[j] = nd_remove_head(gj); + j = i; + gj = g->body[j]; + sum = HCQ(gj); + } else if ( c == 0 ) { + addq(sum,HCQ(gi),&t); + sum = t; + g->body[i] = nd_remove_head(gi); + } + } + } + if ( j < 0 ) return -1; + else if ( sum ) { + HCQ(gj) = sum; + return j; + } else + g->body[j] = nd_remove_head(gj); + } +} + +ND normalize_pbucket(int mod,PGeoBucket g) +{ int i; ND r,t; r = 0; - for ( i = 0; i <= g->m; i++ ) - r = nd_add(r,g->body[i]); + for ( i = 0; i <= g->m; i++ ) { + r = nd_add(mod,r,g->body[i]); + g->body[i] = 0; + } + g->m = -1; return r; } -ND nd_nf(ND g,int full) +/* return value = 0 => input is not a GB */ + +NODE nd_gb(int m,int checkonly) { - ND u,p,d,red; - NODE l; - NM m,mrd; - int sugar,psugar,n,h_reducible,h; - PGeoBucket bucket; + int i,nh,sugar,stat; + NODE r,g,t; + ND_pairs d; + ND_pairs l; + ND h,nf; - if ( !g ) { - return 0; + g = 0; d = 0; + for ( i = 0; i < nd_psn; i++ ) { + d = update_pairs(d,g,i); + g = update_base(g,i); } - sugar = g->sugar; - n = g->nv; - bucket = create_pbucket(); - add_pbucket(bucket,g); - d = 0; - while ( 1 ) { - h = head_pbucket(bucket); - if ( h < 0 ) { - if ( d ) - d->sugar = sugar; - return d; + sugar = 0; + while ( d ) { +again: + l = nd_minp(d,&d); + if ( SG(l) != sugar ) { + sugar = SG(l); + fprintf(asir_out,"%d",sugar); } - g = bucket->body[h]; - red = nd_find_reducer(g); - if ( red ) { - bucket->body[h] = nd_remove_head(g); - red = nd_remove_head(red); - add_pbucket(bucket,red); - sugar = MAX(sugar,red->sugar); - } else if ( !full ) { - g = normalize_pbucket(bucket); - if ( g ) - g->sugar = sugar; - return g; + stat = nd_sp(m,l,&h); + if ( !stat ) { + NEXT(l) = d; d = l; + d = nd_reconstruct(m,0,d); + goto again; + } + stat = m?nd_nf_pbucket(m,h,!Top,&nf):nd_nf(m,h,!Top,&nf); + if ( !stat ) { + NEXT(l) = d; d = l; + d = nd_reconstruct(m,0,d); + goto again; + } else if ( nf ) { + if ( checkonly ) return 0; + printf("+"); fflush(stdout); + nh = nd_newps(m,nf); + d = update_pairs(d,g,nh); + g = update_base(g,nh); + FREENDP(l); } else { - m = BDY(g); - if ( NEXT(m) ) { - BDY(g) = NEXT(m); NEXT(m) = 0; - } else { - FREEND(g); g = 0; - } - bucket->body[h] = g; - NEXT(m) = 0; - if ( d ) { - for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) ); - NEXT(mrd) = m; - } else { - MKND(n,m,d); - } + printf("."); fflush(stdout); + FREENDP(l); } } + if ( m ) + for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_ps[(int)BDY(t)]; + else + for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_psq[(int)BDY(t)]; + return g; } -#endif -NODE nd_gb(NODE f) +NODE nd_gb_trace(int m) { int i,nh,sugar,stat; - NODE r,g,gall; + NODE r,g,t; ND_pairs d; ND_pairs l; - ND h,nf; + ND h,nf,nfq; - for ( gall = g = 0, d = 0, r = f; r; r = NEXT(r) ) { - i = (int)BDY(r); + g = 0; d = 0; + for ( i = 0; i < nd_psn; i++ ) { d = update_pairs(d,g,i); g = update_base(g,i); - gall = append_one(gall,i); } sugar = 0; while ( d ) { again: l = nd_minp(d,&d); - if ( l->sugar != sugar ) { - sugar = l->sugar; + if ( SG(l) != sugar ) { + sugar = SG(l); fprintf(asir_out,"%d",sugar); } - stat = nd_sp(l,&h); + stat = nd_sp(m,l,&h); if ( !stat ) { NEXT(l) = d; d = l; - d = nd_reconstruct(d); + d = nd_reconstruct(m,1,d); goto again; } - stat = nd_nf(h,!Top,&nf); + stat = nd_nf_pbucket(m,h,!Top,&nf); if ( !stat ) { NEXT(l) = d; d = l; - d = nd_reconstruct(d); + d = nd_reconstruct(m,1,d); goto again; } else if ( nf ) { - printf("+"); fflush(stdout); - nh = nd_newps(nf); - d = update_pairs(d,g,nh); - g = update_base(g,nh); - gall = append_one(gall,nh); - FREENDP(l); + /* overflow does not occur */ + nd_sp(0,l,&h); + nd_nf(0,h,!Top,&nfq); + if ( nfq ) { + printf("+"); fflush(stdout); + nh = nd_newps_trace(m,nf,nfq); + /* failure; m|HC(nfq) */ + if ( nf < 0 ) return 0; + d = update_pairs(d,g,nh); + g = update_base(g,nh); + } else { + printf("*"); fflush(stdout); + } } else { printf("."); fflush(stdout); - FREENDP(l); } + FREENDP(l); } + for ( t = g; t; t = NEXT(t) ) + BDY(t) = (pointer)nd_psq[(int)BDY(t)]; return g; } +int ndv_compare(NDV *p1,NDV *p2) +{ + return DL_COMPARE(HDL(*p1),HDL(*p2)); +} + +int ndv_compare_rev(NDV *p1,NDV *p2) +{ + return -DL_COMPARE(HDL(*p1),HDL(*p2)); +} + +NODE nd_reduceall(int m,NODE f) +{ + int i,j,n,stat; + NDV *w,*ps; + ND nf,g; + NODE t,a0,a; + + for ( n = 0, t = f; t; t = NEXT(t), n++ ); + ps = (NDV *)ALLOCA(n*sizeof(NDV)); + for ( i = 0, t = f; i < n; i++, t = NEXT(t) ) + ps[i] = (NDV)BDY(t); + qsort(ps,n,sizeof(NDV),(int (*)(const void *,const void *))ndv_compare); + w = (NDV *)ALLOCA((n-1)*sizeof(NDV)); + for ( i = 0; i < n; i++ ) { + for ( j = 0; j < i; j++ ) w[j] = (NDV)ps[j]; + for ( j = i+1; j < n; j++ ) w[j-1] = ps[j]; + g = ndvtond(m,ps[i]); + stat = nd_nf_direct(m,g,w,n-1,1,&nf); + if ( !stat ) + nd_reconstruct_direct(m,ps,n); + else if ( !nf ) { + printf("."); fflush(stdout); + ndv_free(ps[i]); + for ( j = i+1; j < n; j++ ) ps[j-1] = ps[j]; + n--; + } else { + printf("."); fflush(stdout); + ndv_free(ps[i]); + nd_removecont(m,nf); + ps[i] = ndtondv(m,nf); + nd_free(nf); + } + } + for ( a0 = 0, i = 0; i < n; i++ ) { + NEXTNODE(a0,a); + BDY(a) = (pointer)ps[i]; + } + NEXT(a) = 0; + return a0; +} + ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t) { ND_pairs d1,nd,cur,head,prev,remove; @@ -1195,23 +1594,18 @@ ND_pairs update_pairs( ND_pairs d, NODE /* of index */ while ( cur ) { if ( crit_2( cur->i1,cur->i2 ) ) { remove = cur; - if ( !prev ) { - head = cur = NEXT(cur); - } else { - cur = NEXT(prev) = NEXT(cur); - } + if ( !prev ) head = cur = NEXT(cur); + else cur = NEXT(prev) = NEXT(cur); FREENDP(remove); } else { - prev = cur; - cur = NEXT(cur); + prev = cur; cur = NEXT(cur); } } if ( !d ) return head; else { nd = d; - while ( NEXT(nd) ) - nd = NEXT(nd); + while ( NEXT(nd) ) nd = NEXT(nd); NEXT(nd) = head; return d; } @@ -1221,20 +1615,18 @@ ND_pairs nd_newpairs( NODE g, int t ) { NODE h; unsigned int *dl; - int td,ts,s; + int ts,s; ND_pairs r,r0; - dl = HDL(nd_ps[t]); - td = HTD(nd_ps[t]); - ts = nd_ps[t]->sugar - td; + dl = DL(nd_psh[t]); + ts = SG(nd_psh[t]) - TD(dl); for ( r0 = 0, h = g; h; h = NEXT(h) ) { NEXTND_pairs(r0,r); r->i1 = (int)BDY(h); r->i2 = t; - ndl_lcm(HDL(nd_ps[r->i1]),dl,r->lcm); - r->td = ndl_td(r->lcm); - s = nd_ps[r->i1]->sugar-HTD(nd_ps[r->i1]); - r->sugar = MAX(s,ts) + r->td; + ndl_lcm(DL(nd_psh[r->i1]),dl,r->lcm); + s = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1])); + SG(r) = MAX(s,ts) + TD(LCM(r)); } NEXT(r) = 0; return r0; @@ -1247,15 +1639,15 @@ ND_pairs crit_B( ND_pairs d, int s ) int td,tdl; if ( !d ) return 0; - t = HDL(nd_ps[s]); + t = DL(nd_psh[s]); prev = 0; head = cur = d; - lcm = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); + lcm = (unsigned int *)ALLOCA((nd_wpd+1)*sizeof(unsigned int)); while ( cur ) { tl = cur->lcm; if ( ndl_reducible(tl,t) - && (ndl_lcm(HDL(nd_ps[cur->i1]),t,lcm),!ndl_equal(lcm,tl)) - && (ndl_lcm(HDL(nd_ps[cur->i2]),t,lcm),!ndl_equal(lcm,tl)) ) { + && (ndl_lcm(DL(nd_psh[cur->i1]),t,lcm),!ndl_equal(lcm,tl)) + && (ndl_lcm(DL(nd_psh[cur->i2]),t,lcm),!ndl_equal(lcm,tl)) ) { remove = cur; if ( !prev ) { head = cur = NEXT(cur); @@ -1264,39 +1656,34 @@ ND_pairs crit_B( ND_pairs d, int s ) } FREENDP(remove); } else { - prev = cur; - cur = NEXT(cur); + prev = cur; cur = NEXT(cur); } } return head; } +/* XXX : check is necessary */ + ND_pairs crit_M( ND_pairs d1 ) { ND_pairs e,d2,d3,dd,p; unsigned int *id,*jd; - int itd,jtd; for ( dd = 0, e = d1; e; e = d3 ) { if ( !(d2 = NEXT(e)) ) { NEXT(e) = dd; return e; } - id = e->lcm; - itd = e->td; + id = LCM(e); for ( d3 = 0; d2; d2 = p ) { - p = NEXT(d2), - jd = d2->lcm; - jtd = d2->td; - if ( jtd == itd ) - if ( id == jd ); - else if ( ndl_reducible(jd,id) ) continue; - else if ( ndl_reducible(id,jd) ) goto delit; - else ; - else if ( jtd > itd ) + p = NEXT(d2); + jd = LCM(d2); + if ( ndl_equal(jd,id) ) + ; + else if ( TD(jd) > TD(id) ) if ( ndl_reducible(jd,id) ) continue; else ; - else if ( ndl_reducible(id,jd ) ) goto delit; + else if ( ndl_reducible(id,jd) ) goto delit; NEXT(d2) = d3; d3 = d2; } @@ -1324,7 +1711,7 @@ ND_pairs crit_F( ND_pairs d1 ) for ( head = last = 0, p = d1; NEXT(p); ) { r = w = equivalent_pairs(p,&rest); - s = r->sugar; + s = SG(r); w = NEXT(w); while ( w ) { if ( crit_2(w->i1,w->i2) ) { @@ -1336,10 +1723,10 @@ ND_pairs crit_F( ND_pairs d1 ) FREENDP(remove); } break; - } else if ( w->sugar < s ) { + } else if ( SG(w) < s ) { FREENDP(r); r = w; - s = r->sugar; + s = SG(r); w = NEXT(w); } else { remove = w; @@ -1360,23 +1747,21 @@ ND_pairs crit_F( ND_pairs d1 ) int crit_2( int dp1, int dp2 ) { - return ndl_disjoint(HDL(nd_ps[dp1]),HDL(nd_ps[dp2])); + return ndl_disjoint(DL(nd_psh[dp1]),DL(nd_psh[dp2])); } static ND_pairs equivalent_pairs( ND_pairs d1, ND_pairs *prest ) { ND_pairs w,p,r,s; unsigned int *d; - int td; w = d1; - d = w->lcm; - td = w->td; + d = LCM(w); s = NEXT(w); NEXT(w) = 0; for ( r = 0; s; s = p ) { p = NEXT(s); - if ( td == s->td && ndl_equal(d,s->lcm) ) { + if ( ndl_equal(d,LCM(s)) ) { NEXT(s) = w; w = s; } else { @@ -1392,14 +1777,11 @@ NODE update_base(NODE nd,int ndp) { unsigned int *dl, *dln; NODE last, p, head; - int td,tdn; - dl = HDL(nd_ps[ndp]); - td = HTD(nd_ps[ndp]); + dl = DL(nd_psh[ndp]); for ( head = last = 0, p = nd; p; ) { - dln = HDL(nd_ps[(int)BDY(p)]); - tdn = HTD(nd_ps[(int)BDY(p)]); - if ( tdn >= td && ndl_reducible( dln, dl ) ) { + dln = DL(nd_psh[(int)BDY(p)]); + if ( ndl_reducible( dln, dl ) ) { p = NEXT(p); if ( last ) NEXT(last) = p; } else { @@ -1415,45 +1797,21 @@ ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) { ND_pairs m,ml,p,l; unsigned int *lcm; - int s,td,len,tlen,c; + int s,td,len,tlen,c,c1; if ( !(p = NEXT(m = d)) ) { *prest = p; NEXT(m) = 0; return m; } - lcm = m->lcm; - s = m->sugar; - td = m->td; - len = nd_psl[m->i1]+nd_psl[m->i2]; - for ( ml = 0, l = m; p; p = NEXT(l = p) ) { - if (p->sugar < s) - goto find; - else if ( p->sugar == s ) { - if ( p->td < td ) - goto find; - else if ( p->td == td ) { - c = ndl_compare(p->lcm,lcm); - if ( c < 0 ) - goto find; -#if 0 - else if ( c == 0 ) { - tlen = nd_psl[p->i1]+nd_psl[p->i2]; - if ( tlen < len ) - goto find; - } -#endif - } + s = SG(m); + for ( ml = 0, l = m; p; p = NEXT(l = p) ) + if ( (SG(p) < s) + || ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) { + ml = l; + m = p; + s = SG(m); } - continue; -find: - ml = l; - m = p; - lcm = m->lcm; - s = m->sugar; - td = m->td; - len = tlen; - } if ( !ml ) *prest = NEXT(m); else { NEXT(ml) = NEXT(m); @@ -1463,57 +1821,75 @@ find: return m; } -int nd_newps(ND a) +int nd_newps(int mod,ND a) { int len; RHist r; + NDV b; if ( nd_psn == nd_pslen ) { nd_pslen *= 2; - nd_psl = (int *)REALLOC((char *)nd_psl,nd_pslen*sizeof(int)); -#if USE_NDV nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV)); -#else - nd_ps = (ND *)REALLOC((char *)nd_ps,nd_pslen*sizeof(ND)); -#endif + nd_psq = (NDV *)REALLOC((char *)nd_psq,nd_pslen*sizeof(NDV)); nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist)); nd_bound = (unsigned int **) REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *)); } - nd_monic(a); + nd_removecont(mod,a); nd_bound[nd_psn] = nd_compute_bound(a); - NEWRHist(r); r->td = HTD(a); ndl_copy(HDL(a),r->dl); nd_psh[nd_psn] = r; -#if USE_NDV - nd_ps[nd_psn]= ndtondv(a); + NEWRHist(r); SG(r) = SG(a); ndl_copy(HDL(a),DL(r)); + nd_psh[nd_psn] = r; + b = ndtondv(mod,a); + len = LEN(b); + if ( mod ) + nd_ps[nd_psn] = b; + else + nd_psq[nd_psn] = b; nd_free(a); - nd_psl[nd_psn] = len = nd_ps[nd_psn]->len; - if ( len > nmv_len ) { - nmv_len = 2*len; - BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv); + return nd_psn++; +} + +int nd_newps_trace(int mod,ND nf,ND nfq) +{ + int len; + RHist r; + NDV b; + + if ( nd_psn == nd_pslen ) { + nd_pslen *= 2; + nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV)); + nd_psq = (NDV *)REALLOC((char *)nd_psq,nd_pslen*sizeof(NDV)); + nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist)); + nd_bound = (unsigned int **) + REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *)); } -#else - nd_ps[nd_psn] = a; - nd_psl[nd_psn] = nd_length(a); -#endif + if ( !rem(NM(HCQ(nfq)),mod) ) return -1; + nd_removecont(mod,nf); + nd_ps[nd_psn] = ndtondv(mod,nf); + + nd_removecont(0,nfq); + nd_psq[nd_psn] = ndtondv(0,nfq); + + nd_bound[nd_psn] = nd_compute_bound(nfq); + NEWRHist(r); SG(r) = SG(nf); ndl_copy(HDL(nf),DL(r)); + nd_psh[nd_psn] = r; + nd_free(nf); nd_free(nfq); return nd_psn++; } -NODE nd_setup(NODE f) +void nd_setup(int mod,NODE f) { int i,j,td,len,max; NODE s,s0,f0; unsigned int *d; RHist r; + NDV a; nd_found = 0; nd_notfirst = 0; nd_create = 0; nd_psn = length(f); nd_pslen = 2*nd_psn; - nd_psl = (int *)MALLOC(nd_pslen*sizeof(int)); -#if USE_NDV nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); -#else - nd_ps = (ND *)MALLOC(nd_pslen*sizeof(ND)); -#endif + nd_psq = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *)); for ( max = 0, i = 0, s = f; i < nd_psn; i++, s = NEXT(s) ) { @@ -1525,45 +1901,70 @@ NODE nd_setup(NODE f) nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); bzero(nd_red,REDTAB_LEN*sizeof(RHist)); - if ( max < 2 ) - nd_bpe = 2; - else if ( max < 4 ) - nd_bpe = 4; - else if ( max < 64 ) - nd_bpe = 6; - else if ( max < 256 ) - nd_bpe = 8; - else if ( max < 65536 ) - nd_bpe = 16; - else - nd_bpe = 32; + if ( max < 2 ) nd_bpe = 2; + else if ( max < 4 ) nd_bpe = 4; + else if ( max < 64 ) nd_bpe = 6; + else if ( max < 256 ) nd_bpe = 8; + else if ( max < 65536 ) nd_bpe = 16; + else nd_bpe = 32; nd_setup_parameters(); nd_free_private_storage(); len = 0; for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) { -#if USE_NDV - nd_ps[i] = dptondv((DP)BDY(f)); - ndv_mul_c(nd_ps[i],invm(HC(nd_ps[i]),nd_mod)); - len = MAX(len,nd_ps[i]->len); -#else - nd_ps[i] = dptond((DP)BDY(f)); - nd_mul_c(nd_ps[i],1); - nd_psl[i] = nd_length(nd_ps[i]); -#endif - NEWRHist(r); r->td = HTD(nd_ps[i]); ndl_copy(HDL(nd_ps[i]),r->dl); + NEWRHist(r); + a = dptondv(mod,(DP)BDY(f)); + ndv_removecont(mod,a); + len = MAX(len,LEN(a)); + SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); + if ( mod ) nd_ps[i] = a; + else nd_psq[i] = a; nd_psh[i] = r; } -#if USE_NDV - nmv_len = 16*len; - NEWNDV(ndv_red); - BDY(ndv_red) = (NMV)MALLOC_ATOMIC(nmv_len*nmv_adv); -#endif - for ( s0 = 0, i = 0; i < nd_psn; i++ ) { - NEXTNODE(s0,s); BDY(s) = (pointer)i; +} + +void nd_setup_trace(int mod,NODE f) +{ + int i,j,td,len,max; + NODE s,s0,f0; + unsigned int *d; + RHist r; + NDV a; + + nd_found = 0; nd_notfirst = 0; nd_create = 0; + + nd_psn = length(f); nd_pslen = 2*nd_psn; + nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); + nd_psq = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); + nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); + nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *)); + for ( max = 0, i = 0, s = f; i < nd_psn; i++, s = NEXT(s) ) { + nd_bound[i] = d = dp_compute_bound((DP)BDY(s)); + for ( j = 0; j < nd_nvar; j++ ) + max = MAX(d[j],max); } - if ( s0 ) NEXT(s) = 0; - return s0; + if ( !nd_red ) + nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); + bzero(nd_red,REDTAB_LEN*sizeof(RHist)); + + if ( max < 2 ) nd_bpe = 2; + else if ( max < 4 ) nd_bpe = 4; + else if ( max < 64 ) nd_bpe = 6; + else if ( max < 256 ) nd_bpe = 8; + else if ( max < 65536 ) nd_bpe = 16; + else nd_bpe = 32; + + nd_setup_parameters(); + nd_free_private_storage(); + len = 0; + for ( i = 0; i < nd_psn; i++, f = NEXT(f) ) { + a = dptondv(mod,(DP)BDY(f)); ndv_removecont(mod,a); nd_ps[i] = a; + a = dptondv(0,(DP)BDY(f)); ndv_removecont(0,a); nd_psq[i] = a; + NEWRHist(r); + len = MAX(len,LEN(a)); + SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); + nd_psh[i] = r; + } } void nd_gr(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp) @@ -1575,108 +1976,161 @@ void nd_gr(LIST f,LIST v,int m,struct order_spec *ord, get_vars((Obj)f,&fv); pltovl(v,&vv); nd_nvar = length(vv); - if ( ord->id ) - error("nd_gr : unsupported order"); - switch ( ord->ord.simple ) { - case 0: - is_rlex = 1; - break; - case 1: - is_rlex = 0; - break; - default: - error("nd_gr : unsupported order"); - } + nd_init_ord(ord); + /* XXX for DP */ initd(ord); - nd_mod = m; for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { ptod(CO,vv,(P)BDY(t),&b); - _dp_mod(b,m,0,&c); - if ( c ) { - NEXTNODE(fd0,fd); BDY(fd) = (pointer)c; - } + NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } if ( fd0 ) NEXT(fd) = 0; - s = nd_setup(fd0); - x = nd_gb(s); -#if 0 - x = nd_reduceall(x,m); -#endif - for ( r0 = 0; x; x = NEXT(x) ) { + nd_setup(m,fd0); + x = nd_gb(m,0); + fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n", + nd_found,nd_notfirst,nd_create); + x = nd_reduceall(m,x); + for ( r0 = 0, t = x; t; t = NEXT(t) ) { NEXTNODE(r0,r); -#if USE_NDV - a = ndvtodp(nd_ps[(int)BDY(x)]); -#else - a = ndtodp(nd_ps[(int)BDY(x)]); -#endif - _dtop_mod(CO,vv,a,(P *)&BDY(r)); + if ( m ) { + a = ndvtodp(m,BDY(t)); + _dtop_mod(CO,vv,a,(P *)&BDY(r)); + } else { + a = ndvtodp(m,BDY(t)); + dtop(CO,vv,a,(P *)&BDY(r)); + } } if ( r0 ) NEXT(r) = 0; MKLIST(*rp,r0); - fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n", - nd_found,nd_notfirst,nd_create); } +void nd_gr_trace(LIST f,LIST v,int m,int homo,struct order_spec *ord,LIST *rp) +{ + struct order_spec ord1; + VL fv,vv,vc; + NODE fd,fd0,in0,in,r,r0,t,s,cand; + DP a,b,c,h; + P p; + + get_vars((Obj)f,&fv); pltovl(v,&vv); + nd_nvar = length(vv); + initd(ord); + if ( homo ) { + homogenize_order(ord,nd_nvar,&ord1); + for ( fd0 = 0, in0 = 0, t = BDY(f); t; t = NEXT(t) ) { + ptod(CO,vv,(P)BDY(t),&c); + if ( c ) { + dp_homo(c,&h); NEXTNODE(fd0,fd); BDY(fd) = (pointer)h; + NEXTNODE(in0,in); BDY(in) = (pointer)c; + } + } + if ( fd0 ) NEXT(fd) = 0; + if ( in0 ) NEXT(in) = 0; + nd_init_ord(&ord1); + initd(&ord1); + nd_nvar++; + } else { + for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { + ptod(CO,vv,(P)BDY(t),&c); + if ( c ) { + NEXTNODE(fd0,fd); BDY(fd) = (pointer)c; + } + } + if ( fd0 ) NEXT(fd) = 0; + in0 = fd0; + nd_init_ord(ord); + } + do { + nd_setup_trace(m,fd0); + cand = nd_gb_trace(m); + if ( !cand ) continue; + if ( homo ) { + /* dehomogenization */ + for ( t = cand; t; t = NEXT(t) ) + ndv_dehomogenize((NDV)BDY(t)); + nd_nvar--; + nd_setup_parameters(); + initd(ord); + cand = nd_reducebase(cand); + } + fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n", + nd_found,nd_notfirst,nd_create); + cand = nd_reduceall(0,cand); + initd(ord); + for ( r0 = 0; cand; cand = NEXT(cand) ) { + NEXTNODE(r0,r); + BDY(r) = (pointer)ndvtodp(0,(NDV)BDY(cand)); + } + if ( r0 ) NEXT(r) = 0; + cand = r0; + } while ( !nd_check_candidate(in0,cand) ); + /* dp->p */ + for ( r = cand; r; r = NEXT(r) ) { + dtop(CO,vv,BDY(r),&p); + BDY(r) = (pointer)p; + } + MKLIST(*rp,cand); +} + void dltondl(int n,DL dl,unsigned int *r) { unsigned int *d; int i; d = dl->d; - bzero(r,nd_wpd*sizeof(unsigned int)); - if ( is_rlex ) + for ( i = 0; i <= nd_wpd; i++ ) r[i] = 0; + if ( nd_isrlex ) for ( i = 0; i < n; i++ ) - r[(n-1-i)/nd_epw] |= (d[i]<<((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)); + r[(n-1-i)/nd_epw+1] |= (d[i]<<((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)); else for ( i = 0; i < n; i++ ) - r[i/nd_epw] |= d[i]<<((nd_epw-(i%nd_epw)-1)*nd_bpe); + r[i/nd_epw+1] |= d[i]<<((nd_epw-(i%nd_epw)-1)*nd_bpe); + TD(r) = ndl_td(r); } -DL ndltodl(int n,int td,unsigned int *ndl) +DL ndltodl(int n,unsigned int *ndl) { DL dl; int *d; int i; NEWDL(dl,n); - dl->td = td; + dl->td = TD(ndl); d = dl->d; - if ( is_rlex ) + if ( nd_isrlex ) for ( i = 0; i < n; i++ ) - d[i] = (ndl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) + d[i] = (ndl[(n-1-i)/nd_epw+1]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) &((1<>((nd_epw-(i%nd_epw)-1)*nd_bpe)) + d[i] = (ndl[i/nd_epw+1]>>((nd_epw-(i%nd_epw)-1)*nd_bpe)) &((1<c = ITOS(t->c); - m->td = t->dl->td; - dltondl(n,t->dl,m->dl); + if ( mod ) CM(m) = ITOS(C(t)); + else CQ(m) = (Q)C(t); + dltondl(n,DL(t),DL(m)); } NEXT(m) = 0; - MKND(n,m0,d); - d->nv = n; - d->sugar = p->sugar; + MKND(n,m0,l,d); + SG(d) = SG(p); return d; } -DP ndtodp(ND p) +DP ndtodp(int mod,ND p) { DP d; MP m0,m; @@ -1689,12 +2143,13 @@ DP ndtodp(ND p) m0 = 0; for ( t = BDY(p); t; t = NEXT(t) ) { NEXTMP(m0,m); - m->c = STOI(t->c); - m->dl = ndltodl(n,t->td,t->dl); + if ( mod ) C(m) = STOI(CM(t)); + else C(m) = (P)CQ(t); + DL(m) = ndltodl(n,DL(t)); } NEXT(m) = 0; MKDP(n,m0,d); - d->sugar = p->sugar; + SG(d) = SG(p); return d; } @@ -1705,15 +2160,15 @@ void ndl_print(unsigned int *dl) n = nd_nvar; printf("<<"); - if ( is_rlex ) + if ( nd_isrlex ) for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,", - (dl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) + (dl[(n-1-i)/nd_epw+1]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) &((1<>((nd_epw-(i%nd_epw)-1)*nd_bpe)) + (dl[i/nd_epw+1]>>((nd_epw-(i%nd_epw)-1)*nd_bpe)) &((1<>"); } @@ -1726,51 +2181,195 @@ void nd_print(ND p) printf("0\n"); else { for ( m = BDY(p); m; m = NEXT(m) ) { - printf("+%d*",m->c); - ndl_print(m->dl); + printf("+%d*",CM(m)); + ndl_print(DL(m)); } printf("\n"); } } +void nd_print_q(ND p) +{ + NM m; + + if ( !p ) + printf("0\n"); + else { + for ( m = BDY(p); m; m = NEXT(m) ) { + printf("+"); + printexpr(CO,CQ(m)); + printf("*"); + ndl_print(DL(m)); + } + printf("\n"); + } +} + void ndp_print(ND_pairs d) { ND_pairs t; - for ( t = d; t; t = NEXT(t) ) { - printf("%d,%d ",t->i1,t->i2); - } + for ( t = d; t; t = NEXT(t) ) printf("%d,%d ",t->i1,t->i2); printf("\n"); } -void nd_monic(ND p) +void nd_removecont(int mod,ND p) { - if ( !p ) - return; - else - nd_mul_c(p,invm(HC(p),nd_mod)); + int i,n; + Q *w; + Q dvr,t; + NM m; + struct oVECT v; + N q,r; + + if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod)); + else { + for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ ); + w = (Q *)ALLOCA(n*sizeof(Q)); + v.len = n; + v.body = (pointer *)w; + for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m); + removecont_array(w,n); + for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; + } } -void nd_mul_c(ND p,int mul) +void nd_removecont2(ND p1,ND p2) { + int i,n1,n2,n; + Q *w; + Q dvr,t; NM m; + struct oVECT v; + N q,r; + + if ( !p1 ) { + nd_removecont(0,p2); return; + } else if ( !p2 ) { + nd_removecont(0,p1); return; + } + n1 = nd_length(p1); + n2 = nd_length(p2); + n = n1+n2; + w = (Q *)ALLOCA(n*sizeof(Q)); + v.len = n; + v.body = (pointer *)w; + for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) w[i] = CQ(m); + for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m); + removecont_array(w,n); + for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) CQ(m) = w[i]; + for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; +} + +void ndv_removecont(int mod,NDV p) +{ + int i,len; + Q *w; + Q dvr,t; + NMV m; + + if ( mod ) + ndv_mul_c(mod,p,invm(HCM(p),mod)); + else { + len = p->len; + w = (Q *)ALLOCA(len*sizeof(Q)); + for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) w[i] = CQ(m); + sortbynm(w,len); + qltozl(w,len,&dvr); + for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) { + divq(CQ(m),dvr,&t); CQ(m) = t; + } + } +} + +void ndv_dehomogenize(NDV p) +{ + int i,len,newnvar,newwpd,newadv; + Q *w; + Q dvr,t; + NMV m,r; + unsigned int *d; +#define NEWADV(m) (m = (NMV)(((char *)m)+newadv)) + + len = p->len; + newnvar = nd_nvar-1; + newwpd = newnvar/nd_epw+(newnvar%nd_epw?1:0); + for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) + ndl_dehomogenize(DL(m)); + if ( newwpd != nd_wpd ) { + d = (unsigned int *)ALLOCA((newwpd+1)*sizeof(unsigned int)); + newadv = sizeof(struct oNMV)+newwpd*sizeof(unsigned int); + for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NEWADV(r), i++ ) { + CQ(r) = CQ(m); ndl_copy(DL(m),d); ndl_copy(d,DL(r)); + } + } + NV(p)--; +} + +void removecont_array(Q *c,int n) +{ + struct oVECT v; + Q d0,d1,a,u,u1,gcd; + int i; + N qn,rn,gn; + Q *q,*r; + + q = (Q *)ALLOCA(n*sizeof(Q)); + r = (Q *)ALLOCA(n*sizeof(Q)); + v.id = O_VECT; v.len = n; v.body = (pointer *)c; + igcdv_estimate(&v,&d0); + for ( i = 0; i < n; i++ ) { + divn(NM(c[i]),NM(d0),&qn,&rn); + NTOQ(qn,SGN(c[i])*SGN(d0),q[i]); + NTOQ(rn,SGN(c[i]),r[i]); + } + for ( i = 0; i < n; i++ ) if ( r[i] ) break; + if ( i < n ) { + v.id = O_VECT; v.len = n; v.body = (pointer *)r; + igcdv(&v,&d1); + gcdn(NM(d0),NM(d1),&gn); NTOQ(gn,1,gcd); + divsn(NM(d0),gn,&qn); NTOQ(qn,1,a); + for ( i = 0; i < n; i++ ) { + mulq(a,q[i],&u); + if ( r[i] ) { + divsn(NM(r[i]),gn,&qn); NTOQ(qn,SGN(r[i]),u1); + addq(u,u1,&q[i]); + } else + q[i] = u; + } + } + for ( i = 0; i < n; i++ ) c[i] = q[i]; +} + +void nd_mul_c(int mod,ND p,int mul) +{ + NM m; int c,c1; - if ( !p ) - return; + if ( !p ) return; for ( m = BDY(p); m; m = NEXT(m) ) { - c1 = C(m); - DMAR(c1,mul,0,nd_mod,c); - C(m) = c; + c1 = CM(m); + DMAR(c1,mul,0,mod,c); + CM(m) = c; } } +void nd_mul_c_q(ND p,Q mul) +{ + NM m; + Q c; + + if ( !p ) return; + for ( m = BDY(p); m; m = NEXT(m) ) { + mulq(CQ(m),mul,&c); CQ(m) = c; + } +} + void nd_free(ND p) { NM t,s; - if ( !p ) - return; + if ( !p ) return; t = BDY(p); while ( t ) { s = NEXT(t); @@ -1780,16 +2379,20 @@ void nd_free(ND p) FREEND(p); } -void nd_append_red(unsigned int *d,int td,int i) +void ndv_free(NDV p) { + GC_free(BDY(p)); +} + +void nd_append_red(unsigned int *d,int i) +{ RHist m,m0; int h; NEWRHist(m); - h = ndl_hash_value(td,d); + h = ndl_hash_value(d); m->index = i; - m->td = td; - ndl_copy(d,m->dl); + ndl_copy(d,DL(m)); NEXT(m) = nd_red[h]; nd_red[h] = m; } @@ -1805,17 +2408,18 @@ unsigned int *dp_compute_bound(DP p) d1 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int)); d2 = (unsigned int *)ALLOCA(nd_nvar*sizeof(unsigned int)); m = BDY(p); - bcopy(m->dl->d,d1,nd_nvar*sizeof(unsigned int)); + d = DL(m)->d; + for ( i = 0; i < nd_nvar; i++ ) d1[i] = d[i]; for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) { - d = m->dl->d; + d = DL(m)->d; for ( i = 0; i < nd_nvar; i++ ) d2[i] = d[i] > d1[i] ? d[i] : d1[i]; t = d1; d1 = d2; d2 = t; } l = (nd_nvar+31); t = (unsigned int *)MALLOC_ATOMIC(l*sizeof(unsigned int)); - bzero(t,l*sizeof(unsigned int)); - bcopy(d1,t,nd_nvar*sizeof(unsigned int)); + for ( i = 0; i < nd_nvar; i++ ) t[i] = d1[i]; + for ( ; i < l; i++ ) t[i] = 0; return t; } @@ -1829,16 +2433,17 @@ unsigned int *nd_compute_bound(ND p) return 0; d1 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); d2 = (unsigned int *)ALLOCA(nd_wpd*sizeof(unsigned int)); - bcopy(HDL(p),d1,nd_wpd*sizeof(unsigned int)); + ndl_copy(HDL(p),d1); for ( m = NEXT(BDY(p)); m; m = NEXT(m) ) { - ndl_lcm(m->dl,d1,d2); + ndl_lcm(DL(m),d1,d2); t = d1; d1 = d2; d2 = t; } l = nd_nvar+31; t = (unsigned int *)MALLOC_ATOMIC(l*sizeof(unsigned int)); - bzero(t,l*sizeof(unsigned int)); + for ( i = 0; i < l; i++ ) t[i] = 0; for ( i = 0; i < nd_nvar; i++ ) - t[i] = (d1[i/nd_epw]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))&nd_mask0; + t[i] = (d1[i/nd_epw+1]>>((nd_epw-(i%nd_epw)-1)*nd_bpe))&nd_mask0; + for ( ; i < l; i++ ) t[i] = 0; return t; } @@ -1858,82 +2463,123 @@ void nd_setup_parameters() { nd_mask[nd_epw-i-1] = (nd_mask0<<(i*nd_bpe)); nd_mask1 |= (1<<(nd_bpe-1))<<(i*nd_bpe); } - nm_adv = sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int); -#if USE_NDV - nmv_adv = sizeof(struct oNMV)+(nd_wpd-1)*sizeof(unsigned int); -#endif + nm_adv = sizeof(struct oNM)+nd_wpd*sizeof(unsigned int); + nmv_adv = sizeof(struct oNMV)+nd_wpd*sizeof(unsigned int); } -ND_pairs nd_reconstruct(ND_pairs d) +/* mod < 0 => realloc nd_ps and pd_psq */ + +ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) { - int i,obpe,oadv; + int i,obpe,oadv,h; NM prev_nm_free_list; RHist mr0,mr; RHist r; + RHist *old_red; ND_pairs s0,s,t,prev_ndp_free_list; - + obpe = nd_bpe; -#if USE_NDV oadv = nmv_adv; -#endif - if ( obpe < 4 ) - nd_bpe = 4; - else if ( obpe < 6 ) - nd_bpe = 6; - else if ( obpe < 8 ) - nd_bpe = 8; - else if ( obpe < 16 ) - nd_bpe = 16; - else if ( obpe < 32 ) - nd_bpe = 32; - else - error("nd_reconstruct : exponent too large"); + if ( obpe < 4 ) nd_bpe = 4; + else if ( obpe < 6 ) nd_bpe = 6; + else if ( obpe < 8 ) nd_bpe = 8; + else if ( obpe < 16 ) nd_bpe = 16; + else if ( obpe < 32 ) nd_bpe = 32; + else error("nd_reconstruct : exponent too large"); nd_setup_parameters(); prev_nm_free_list = _nm_free_list; prev_ndp_free_list = _ndp_free_list; _nm_free_list = 0; _ndp_free_list = 0; - for ( i = nd_psn-1; i >= 0; i-- ) { -#if USE_NDV - ndv_realloc(nd_ps[i],obpe,oadv); -#else - nd_realloc(nd_ps[i],obpe); -#endif - } + if ( mod != 0 ) + for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv); + if ( !mod || trace ) + for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_psq[i],obpe,oadv); s0 = 0; for ( t = d; t; t = NEXT(t) ) { NEXTND_pairs(s0,s); s->i1 = t->i1; s->i2 = t->i2; - s->td = t->td; - s->sugar = t->sugar; - ndl_dup(obpe,t->lcm,s->lcm); + SG(s) = SG(t); + ndl_dup(obpe,LCM(t),LCM(s)); } + + old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist)); for ( i = 0; i < REDTAB_LEN; i++ ) { - for ( mr0 = 0, r = nd_red[i]; r; r = NEXT(r) ) { - NEXTRHist(mr0,r); + old_red[i] = nd_red[i]; + nd_red[i] = 0; + } + for ( i = 0; i < REDTAB_LEN; i++ ) + for ( r = old_red[i]; r; r = NEXT(r) ) { + NEWRHist(mr); mr->index = r->index; - mr->td = r->td; - ndl_dup(obpe,r->dl,mr->dl); + SG(mr) = SG(r); + ndl_dup(obpe,DL(r),DL(mr)); + h = ndl_hash_value(DL(mr)); + NEXT(mr) = nd_red[h]; + nd_red[h] = mr; } - if ( mr0 ) NEXT(mr) = 0; - nd_red[i] = mr0; - } + for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0; + old_red = 0; for ( i = 0; i < nd_psn; i++ ) { - NEWRHist(r); r->td = nd_psh[i]->td; ndl_dup(obpe,nd_psh[i]->dl,r->dl); + NEWRHist(r); SG(r) = SG(nd_psh[i]); + ndl_dup(obpe,DL(nd_psh[i]),DL(r)); nd_psh[i] = r; } if ( s0 ) NEXT(s) = 0; prev_nm_free_list = 0; prev_ndp_free_list = 0; -#if USE_NDV - BDY(ndv_red) = (NMV)REALLOC(BDY(ndv_red),nmv_len*nmv_adv); -#endif GC_gcollect(); return s0; } +void nd_reconstruct_direct(int mod,NDV *ps,int len) +{ + int i,obpe,oadv,h; + NM prev_nm_free_list; + RHist mr0,mr; + RHist r; + RHist *old_red; + ND_pairs s0,s,t,prev_ndp_free_list; + + obpe = nd_bpe; + oadv = nmv_adv; + if ( obpe < 4 ) nd_bpe = 4; + else if ( obpe < 6 ) nd_bpe = 6; + else if ( obpe < 8 ) nd_bpe = 8; + else if ( obpe < 16 ) nd_bpe = 16; + else if ( obpe < 32 ) nd_bpe = 32; + else error("nd_reconstruct_direct : exponent too large"); + + nd_setup_parameters(); + prev_nm_free_list = _nm_free_list; + prev_ndp_free_list = _ndp_free_list; + _nm_free_list = 0; _ndp_free_list = 0; + if ( mod != 0 ) + for ( i = len-1; i >= 0; i-- ) ndv_realloc(ps[i],obpe,oadv); + old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist)); + for ( i = 0; i < REDTAB_LEN; i++ ) { + old_red[i] = nd_red[i]; + nd_red[i] = 0; + } + for ( i = 0; i < REDTAB_LEN; i++ ) + for ( r = old_red[i]; r; r = NEXT(r) ) { + NEWRHist(mr); + mr->index = r->index; + SG(mr) = SG(r); + ndl_dup(obpe,DL(r),DL(mr)); + h = ndl_hash_value(DL(mr)); + NEXT(mr) = nd_red[h]; + nd_red[h] = mr; + } + for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0; + old_red = 0; + prev_nm_free_list = 0; + prev_ndp_free_list = 0; + GC_gcollect(); +} + void ndl_dup(int obpe,unsigned int *d,unsigned int *r) { int n,i,ei,oepw,cepw,cbpe; @@ -1942,17 +2588,19 @@ void ndl_dup(int obpe,unsigned int *d,unsigned int *r) oepw = (sizeof(unsigned int)*8)/obpe; cepw = nd_epw; cbpe = nd_bpe; - if ( is_rlex ) + TD(r) = TD(d); + for ( i = 1; i <= nd_wpd; i++ ) r[i] = 0; + if ( nd_isrlex ) for ( i = 0; i < n; i++ ) { - ei = (d[(n-1-i)/oepw]>>((oepw-((n-1-i)%oepw)-1)*obpe)) + ei = (d[(n-1-i)/oepw+1]>>((oepw-((n-1-i)%oepw)-1)*obpe)) &((1<>((oepw-(i%oepw)-1)*obpe)) + ei = (d[i/oepw+1]>>((oepw-(i%oepw)-1)*obpe)) &((1<td = m->td; - ndl_dup(obpe,m->dl,mr->dl); + CM(mr) = CM(m); + ndl_dup(obpe,DL(m),DL(mr)); } NEXT(mr) = 0; BDY(p) = mr0; @@ -1982,22 +2629,20 @@ ND nd_copy(ND p) if ( !p ) return 0; else { - s = sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int); + s = sizeof(struct oNM)+nd_wpd*sizeof(unsigned int); for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { NEXTNM(mr0,mr); - C(mr) = C(m); - mr->td = m->td; - ndl_copy(m->dl,mr->dl); + CM(mr) = CM(m); + ndl_copy(DL(m),DL(mr)); } NEXT(mr) = 0; - MKND(NV(p),mr0,r); - r->sugar = p->sugar; + MKND(NV(p),mr0,LEN(p),r); + SG(r) = SG(p); return r; } } -#if USE_NDV -int nd_sp(ND_pairs p,ND *rp) +int nd_sp(int mod,ND_pairs p,ND *rp) { NM m; NDV p1,p2; @@ -2005,168 +2650,95 @@ int nd_sp(ND_pairs p,ND *rp) unsigned int *lcm; int td; - p1 = nd_ps[p->i1]; - p2 = nd_ps[p->i2]; - lcm = p->lcm; - td = p->td; + if ( mod ) { + p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; + } else { + p1 = nd_psq[p->i1]; p2 = nd_psq[p->i2]; + } + lcm = LCM(p); NEWNM(m); - C(m) = HC(p2); m->td = td-HTD(p1); ndl_sub(lcm,HDL(p1),m->dl); - if ( ndl_check_bound2(p->i1,m->dl) ) - return 0; - t1 = ndv_mul_nm_create(p1,m); - C(m) = nd_mod-HC(p1); m->td = td-HTD(p2); ndl_sub(lcm,HDL(p2),m->dl); - if ( ndl_check_bound2(p->i2,m->dl) ) { + CQ(m) = HCQ(p2); + ndl_sub(lcm,HDL(p1),DL(m)); + if ( ndl_check_bound2(p->i1,DL(m)) ) return 0; + t1 = ndv_mul_nm(mod,p1,m); + if ( mod ) CM(m) = mod-HCM(p1); + else chsgnq(HCQ(p1),&CQ(m)); + ndl_sub(lcm,HDL(p2),DL(m)); + if ( ndl_check_bound2(p->i2,DL(m)) ) { nd_free(t1); return 0; } - ndv_mul_nm(p2,m,ndv_red); + t2 = ndv_mul_nm(mod,p2,m); + *rp = nd_add(mod,t1,t2); FREENM(m); - *rp = ndv_add(t1,ndv_red); return 1; } -void ndv_mul_c(NDV p,int mul) +void ndv_mul_c(int mod,NDV p,int mul) { NMV m; int c,c1,len,i; - if ( !p ) - return; - len = p->len; + if ( !p ) return; + len = LEN(p); for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { - c1 = C(m); - DMAR(c1,mul,0,nd_mod,c); - C(m) = c; + c1 = CM(m); DMAR(c1,mul,0,mod,c); CM(m) = c; } } -void ndv_mul_nm(NDV p,NM m0,NDV r) +void ndv_mul_c_q(NDV p,Q mul) { - NMV m,mr,mr0; - unsigned int *d,*dt,*dm; - int c,n,td,i,c1,c2,len; + NMV m; + Q c; + int len,i; - if ( !p ) - /* XXX */ - r->len = 0; - else { - n = NV(p); m = BDY(p); len = p->len; - d = m0->dl; td = m0->td; c = C(m0); - mr = BDY(r); - for ( ; len > 0; len--, NMV_ADV(m), NMV_ADV(mr) ) { - c1 = C(m); DMAR(c1,c,0,nd_mod,c2); C(mr) = c2; - mr->td = m->td+td; ndl_add(m->dl,d,mr->dl); - } - NV(r) = NV(p); - r->len = p->len; - r->sugar = p->sugar + td; + if ( !p ) return; + len = LEN(p); + for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { + mulq(CQ(m),mul,&c); CQ(m) = c; } } -ND ndv_mul_nm_create(NDV p,NM m0) +ND ndv_mul_nm(int mod,NDV p,NM m0) { NM mr,mr0; NMV m; unsigned int *d,*dt,*dm; int c,n,td,i,c1,c2,len; + Q q; ND r; - if ( !p ) - return 0; + if ( !p ) return 0; else { n = NV(p); m = BDY(p); - d = m0->dl; td = m0->td; c = C(m0); - len = p->len; + d = DL(m0); + len = LEN(p); mr0 = 0; - for ( i = 0; i < len; i++, NMV_ADV(m) ) { - NEXTNM(mr0,mr); - c1 = C(m); - DMAR(c1,c,0,nd_mod,c2); - C(mr) = c2; - mr->td = m->td+td; - ndl_add(m->dl,d,mr->dl); + td = TD(d); + if ( mod ) { + c = CM(m0); + for ( i = 0; i < len; i++, NMV_ADV(m) ) { + NEXTNM(mr0,mr); + c1 = CM(m); + DMAR(c1,c,0,mod,c2); + CM(mr) = c2; + ndl_add(DL(m),d,DL(mr)); + } + } else { + q = CQ(m0); + for ( i = 0; i < len; i++, NMV_ADV(m) ) { + NEXTNM(mr0,mr); + mulq(CQ(m),q,&CQ(mr)); + ndl_add(DL(m),d,DL(mr)); + } } NEXT(mr) = 0; - MKND(NV(p),mr0,r); - r->sugar = p->sugar + td; + MKND(NV(p),mr0,len,r); + SG(r) = SG(p) + TD(d); return r; } } -ND ndv_add(ND p1,NDV p2) -{ - register NM prev,cur,new; - int c,c1,c2,t,td,td2,mul,len,i; - NM head; - unsigned int *d; - NMV m2; - - if ( !p1 ) - return 0; - else { - prev = 0; head = cur = BDY(p1); - NEWNM(new); len = p2->len; - for ( m2 = BDY(p2), i = 0; cur && i < len; ) { - td2 = new->td = m2->td; - if ( cur->td > td2 ) { - prev = cur; cur = NEXT(cur); - continue; - } else if ( cur->td < td2 ) c = -1; - else if ( nd_wpd == 1 ) { - if ( cur->dl[0] > m2->dl[0] ) c = is_rlex ? -1 : 1; - else if ( cur->dl[0] < m2->dl[0] ) c = is_rlex ? 1 : -1; - else c = 0; - } - else c = ndl_compare(cur->dl,m2->dl); - switch ( c ) { - case 0: - t = C(m2)+C(cur)-nd_mod; - if ( t < 0 ) t += nd_mod; - if ( t ) C(cur) = t; - else if ( !prev ) { - head = NEXT(cur); FREENM(cur); cur = head; - } else { - NEXT(prev) = NEXT(cur); FREENM(cur); cur = NEXT(prev); - } - NMV_ADV(m2); i++; - break; - case 1: - prev = cur; cur = NEXT(cur); - break; - case -1: - ndl_copy(m2->dl,new->dl); - C(new) = C(m2); - if ( !prev ) { - /* cur = head */ - prev = new; NEXT(prev) = head; head = prev; - } else { - NEXT(prev) = new; NEXT(new) = cur; prev = new; - } - NEWNM(new); NMV_ADV(m2); i++; - break; - } - } - for ( ; i < len; i++, NMV_ADV(m2) ) { - td2 = new->td = m2->td; C(new) = C(m2); ndl_copy(m2->dl,new->dl); - if ( !prev ) { - prev = new; NEXT(prev) = 0; head = prev; - } else { - NEXT(prev) = new; NEXT(new) = 0; prev = new; - } - NEWNM(new); - } - FREENM(new); - if ( head ) { - BDY(p1) = head; p1->sugar = MAX(p1->sugar,p2->sugar); - return p1; - } else { - FREEND(p1); - return 0; - } - - } -} - void ndv_realloc(NDV p,int obpe,int oadv) { NMV m,mr,mr0,t; @@ -2176,87 +2748,108 @@ void ndv_realloc(NDV p,int obpe,int oadv) #define NMV_PREV(m) (m = (NMV)(((char *)m)-nmv_adv)) if ( p ) { - m = BDY(p); len = p->len; - mr0 = (NMV)REALLOC(BDY(p),len*nmv_adv); + m = BDY(p); len = LEN(p); + mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p); m = (NMV)((char *)mr0+(len-1)*oadv); mr = (NMV)((char *)mr0+(len-1)*nmv_adv); t = (NMV)ALLOCA(nmv_adv); for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) { - C(t) = C(m); - t->td = m->td; - for ( k = 0; k < nd_wpd; k++ ) t->dl[k] = 0; - ndl_dup(obpe,m->dl,t->dl); - C(mr) = C(t); - mr->td = t->td; - ndl_copy(t->dl,mr->dl); + CQ(t) = CQ(m); + for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0; + ndl_dup(obpe,DL(m),DL(t)); + CQ(mr) = CQ(t); + ndl_copy(DL(t),DL(mr)); } BDY(p) = mr0; } } -NDV ndtondv(ND p) +NDV ndtondv(int mod,ND p) { NDV d; NMV m,m0; NM t; int i,len; - if ( !p ) - return 0; - len = nd_length(p); - m0 = m = (NMV)MALLOC_ATOMIC(len*nmv_adv); + if ( !p ) return 0; + len = LEN(p); + m0 = m = (NMV)(mod?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv)); for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) { - m->td = t->td; - ndl_copy(t->dl,m->dl); - m->c = t->c; + ndl_copy(DL(t),DL(m)); + CQ(m) = CQ(t); } MKNDV(NV(p),m0,len,d); - d->sugar = p->sugar; + SG(d) = SG(p); return d; } -NDV dptondv(DP p) +ND ndvtond(int mod,NDV p) { + ND d; + NM m,m0; + NMV t; + int i,len; + + if ( !p ) return 0; + m0 = 0; + len = p->len; + for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) { + NEXTNM(m0,m); + ndl_copy(DL(t),DL(m)); + CQ(m) = CQ(t); + } + NEXT(m) = 0; + MKND(NV(p),m0,len,d); + SG(d) = SG(p); + return d; +} + +NDV dptondv(int mod,DP p) +{ NDV d; NMV m0,m; MP t; + DP q; int l,i,n; - if ( !p ) - return 0; + if ( !p ) return 0; for ( t = BDY(p), l = 0; t; t = NEXT(t), l++ ); - m0 = m = (NMV)MALLOC_ATOMIC(l*nmv_adv); + if ( mod ) { + _dp_mod(p,mod,0,&q); p = q; + m0 = m = (NMV)MALLOC_ATOMIC(l*nmv_adv); + } else + m0 = m = (NMV)MALLOC(l*nmv_adv); n = NV(p); for ( t = BDY(p), i = 0; i < l; i++, t = NEXT(t), NMV_ADV(m) ) { - m->c = ITOS(t->c); - m->td = t->dl->td; - dltondl(n,t->dl,m->dl); + if ( mod ) CM(m) = ITOS(C(t)); + else CQ(m) = (Q)C(t); + dltondl(n,DL(t),DL(m)); } MKNDV(n,m0,l,d); - d->sugar = p->sugar; + SG(d) = SG(p); return d; } -DP ndvtodp(NDV p) +DP ndvtodp(int mod,NDV p) { DP d; MP m0,m; NMV t; int len,i,n; - if ( !p ) - return 0; + if ( !p ) return 0; m0 = 0; - len = p->len; + len = LEN(p); n = NV(p); for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { NEXTMP(m0,m); - m->c = STOI(t->c); - m->dl = ndltodl(n,t->td,t->dl); + if ( mod ) C(m) = STOI(CM(t)); + else C(m) = (P)CQ(t); + DL(m) = ndltodl(n,DL(t)); } NEXT(m) = 0; MKDP(NV(p),m0,d); - d->sugar = p->sugar; + SG(d) = SG(p); return d; } @@ -2265,129 +2858,79 @@ void ndv_print(NDV p) NMV m; int i,len; - if ( !p ) - printf("0\n"); + if ( !p ) printf("0\n"); else { - len = p->len; + len = LEN(p); for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { - printf("+%d*",m->c); - ndl_print(m->dl); + printf("+%d*",CM(m)); + ndl_print(DL(m)); } printf("\n"); } } -#else -int nd_sp(ND_pairs p,ND *rp) -{ - NM m; - ND p1,p2; - ND t1,t2; - unsigned int *lcm; - int td; - p1 = nd_ps[p->i1]; - p2 = nd_ps[p->i2]; - lcm = p->lcm; - td = p->td; - NEWNM(m); - C(m) = HC(p2); m->td = td-HTD(p1); ndl_sub(lcm,HDL(p1),m->dl); - if ( ndl_check_bound2(p->i1,m->dl) ) - return 0; - t1 = nd_mul_ind_nm(p->i1,m); - C(m) = nd_mod-HC(p1); m->td = td-HTD(p2); ndl_sub(lcm,HDL(p2),m->dl); - if ( ndl_check_bound2(p->i2,m->dl) ) { - nd_free(t1); - return 0; +void ndv_print_q(NDV p) +{ + NMV m; + int i,len; + + if ( !p ) printf("0\n"); + else { + len = LEN(p); + for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { + printf("+"); + printexpr(CO,CQ(m)); + printf("*"); + ndl_print(DL(m)); + } + printf("\n"); } - t2 = nd_mul_ind_nm(p->i2,m); - FREENM(m); - *rp = nd_add(t1,t2); - return 1; } -ND nd_mul_nm(ND p,NM m0) +NODE nd_reducebase(NODE x) { - NM m,mr,mr0; - unsigned int *d,*dt,*dm; - int c,n,td,i,c1,c2; - int *pt,*p1,*p2; - ND r; + int len,i,j; + NDV *w; + NODE t,t0; - if ( !p ) - return 0; - else { - n = NV(p); m = BDY(p); - d = m0->dl; td = m0->td; c = C(m0); - mr0 = 0; - for ( ; m; m = NEXT(m) ) { - NEXTNM(mr0,mr); - c1 = C(m); - DMAR(c1,c,0,nd_mod,c2); - C(mr) = c2; - mr->td = m->td+td; - ndl_add(m->dl,d,mr->dl); + len = length(x); + w = (NDV *)ALLOCA(len*sizeof(NDV)); + for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t); + for ( i = 0; i < len; i++ ) { + for ( j = 0; j < i; j++ ) { + if ( w[i] && w[j] ) + if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0; + else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0; } - NEXT(mr) = 0; - MKND(NV(p),mr0,r); - r->sugar = p->sugar + td; - return r; } + for ( i = len-1, t0 = 0; i >= 0; i-- ) { + if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; } + } + NEXT(t) = 0; x = t0; + return x; } -ND nd_mul_ind_nm(int index,NM m0) +void nd_init_ord(struct order_spec *ord) { - register int c1,c2,c; - register NM m,new,prev; - NM mr0; - unsigned int *d; - int n,td,i,len,d0,d1; - ND p,r; - - p = nd_ps[index]; - len = nd_psl[index]; - n = NV(p); m = BDY(p); - d = m0->dl; td = m0->td; c = C(m0); - - NEWNM(mr0); - c1 = C(m); DMAR(c1,c,0,nd_mod,c2); C(mr0) = c2; - mr0->td = m->td+td; ndl_add(m->dl,d,mr0->dl); - prev = mr0; m = NEXT(m); - len--; - - switch ( nd_wpd ) { + if ( ord->id ) + error("nd_gr : unsupported order"); + nd_dcomp = 0; + switch ( ord->ord.simple ) { + case 0: + nd_dcomp = 1; + nd_isrlex = 1; + break; case 1: - d0 = d[0]; - while ( len-- ) { - c1 = C(m); DMAR(c1,c,0,nd_mod,c2); - NEWNM(new); C(new) = c2; - new->td = m->td+td; new->dl[0] = m->dl[0]+d0; - m = NEXT(m); NEXT(prev) = new; prev = new; - } + nd_dcomp = 1; + nd_isrlex = 0; break; - case 2: - d0 = d[0]; d1 = d[1]; - while ( len-- ) { - c1 = C(m); DMAR(c1,c,0,nd_mod,c2); - NEWNM(new); C(new) = c2; - new->td = m->td+td; - new->dl[0] = m->dl[0]+d0; - new->dl[1] = m->dl[1]+d1; - m = NEXT(m); NEXT(prev) = new; prev = new; - } + case 9: + /* td1->td->rlex */ + nd_dcomp = -dp_nelim; + nd_isrlex = 1; break; default: - while ( len-- ) { - c1 = C(m); DMAR(c1,c,0,nd_mod,c2); - NEWNM(new); C(new) = c2; - new->td = m->td+td; ndl_add(m->dl,d,new->dl); - m = NEXT(m); NEXT(prev) = new; prev = new; - } - break; + error("nd_gr : unsupported order"); } - - NEXT(prev) = 0; - MKND(NV(p),mr0,r); - r->sugar = p->sugar + td; - return r; } -#endif +