===================================================================
RCS file: /home/cvs/OpenXM_contrib2/asir2000/engine/_distm.c,v
retrieving revision 1.4
retrieving revision 1.9
diff -u -p -r1.4 -r1.9
--- OpenXM_contrib2/asir2000/engine/_distm.c	2000/11/07 06:06:39	1.4
+++ OpenXM_contrib2/asir2000/engine/_distm.c	2001/09/11 03:13:43	1.9
@@ -45,31 +45,17 @@
  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
  *
- * $OpenXM: OpenXM_contrib2/asir2000/engine/_distm.c,v 1.3 2000/08/22 05:04:05 noro Exp $ 
+ * $OpenXM: OpenXM_contrib2/asir2000/engine/_distm.c,v 1.8 2001/03/19 04:02:03 noro Exp $ 
 */
 #include "ca.h"
 #include "inline.h"
 
-#define NV(p) ((p)->nv)
-#define C(p) ((p)->c)
-#if 0
-#define ITOS(p) (((unsigned int)(p))>>1)
-#define STOI(i) ((P)((((unsigned int)(i))<<1)|1))
-#else
-#define ITOS(p) (((unsigned int)(p))&0x7fffffff)
-#define STOI(i) ((P)((unsigned int)(i)|0x80000000))
-#endif
-
-struct cdlm {
-	int c;
-	DL d;
-};
-
 extern int (*cmpdl)();
 extern int do_weyl;
 
+void dpto_dp();
 void _dptodp();
-void adddl_dup();
+void _adddl_dup();
 void adddl_destructive();
 void _mulmdm_dup();
 void _free_dp();
@@ -85,22 +71,14 @@ DP _dp_free_list;
 DL _dl_free_list;
 int current_dl_length;
 
-#define _NEWDL_NOINIT(d,n) if ((n)!= current_dl_length){_dl_free_list=0; current_dl_length=(n);} if(!_dl_free_list)_DL_alloc(); (d)=_dl_free_list; _dl_free_list = *((DL *)_dl_free_list)
-#define _NEWDL(d,n) if ((n)!= current_dl_length){_dl_free_list=0; current_dl_length=(n);} if(!_dl_free_list)_DL_alloc(); (d)=_dl_free_list; _dl_free_list = *((DL *)_dl_free_list); bzero((d),(((n)+1)*sizeof(int)))
-#define _NEWMP(m) if(!_mp_free_list)_MP_alloc(); (m)=_mp_free_list; _mp_free_list = NEXT(_mp_free_list)
-#define _MKDP(n,m,d) if(!_dp_free_list)_DP_alloc(); (d)=_dp_free_list; _dp_free_list = (DP)BDY(_dp_free_list); (d)->nv=(n); BDY(d)=(m)
+void _free_private_storage()
+{
+	_mp_free_list = 0;
+	_dp_free_list = 0;
+	_dl_free_list = 0;
+	GC_gcollect();
+}
 
-#define _NEXTMP(r,c) \
-if(!(r)){_NEWMP(r);(c)=(r);}else{_NEWMP(NEXT(c));(c)=NEXT(c);}
-
-#define _NEXTMP2(r,c,s) \
-if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);}
-
-#define FREEDL(m) *((DL *)m)=_dl_free_list; _dl_free_list=(m)
-#define FREEMP(m) NEXT(m)=_mp_free_list; _mp_free_list=(m)
-#define FREEDP(m) BDY(m)=(MP)_dp_free_list; _dp_free_list=(m)
-
-
 void _DL_alloc()
 {
 	int *p;
@@ -109,6 +87,10 @@ void _DL_alloc()
 
 /*	fprintf(stderr,"DL_alloc : %d \n",++DL_alloc_count); */
 	dl_len = (current_dl_length+1);
+#if defined(LONG_IS_64BIT)
+	if ( dl_len & 1 )
+		dl_len += 1;
+#endif
 	p = (int *)GC_malloc(128*dl_len*sizeof(int));
 	for ( i = 0; i < 128; i++, p += dl_len ) {
 		*(DL *)p = _dl_free_list;
@@ -167,9 +149,9 @@ DP p1,p2,*pr;
 					if ( t ) {
 						_NEXTMP2(mr0,mr,s); C(mr) = STOI(t);
 					} else {
-						FREEDL(s->dl); FREEMP(s);
+						_FREEDL(s->dl); _FREEMP(s);
 					}
-					s = m2; m2 = NEXT(m2); FREEDL(s->dl); FREEMP(s);
+					s = m2; m2 = NEXT(m2); _FREEDL(s->dl); _FREEMP(s);
 					break;
 				case 1:
 					s = m1; m1 = NEXT(m1); _NEXTMP2(mr0,mr,s);
@@ -196,7 +178,7 @@ DP p1,p2,*pr;
 		_MKDP(NV(p1),mr0,*pr);
 		if ( *pr )
 			(*pr)->sugar = MAX(p1->sugar,p2->sugar);
-		FREEDP(p1); FREEDP(p2);
+		_FREEDP(p1); _FREEDP(p2);
 	}
 }
 
@@ -464,15 +446,15 @@ int rtablen;
 #if 0
 		_comm_mulmd_tab(mod,n,rtab,curlen,tab,k+1,tmptab);
 		for ( j = 0; j < curlen; j++ )
-			if ( rtab[j].d ) { FREEDL(rtab[j].d); }
+			if ( rtab[j].d ) { _FREEDL(rtab[j].d); }
 		for ( j = 0; j <= min; j++ )
-			if ( tab[j].d ) { FREEDL(tab[j].d); }
+			if ( tab[j].d ) { _FREEDL(tab[j].d); }
 		curlen *= k+1;
 		bcopy(tmptab,rtab,curlen*sizeof(struct cdlm));
 #else
 		_comm_mulmd_tab_destructive(mod,n,rtab,curlen,tab,k+1);
 		for ( j = 0; j <= min; j++ )
-			if ( tab[j].d ) { FREEDL(tab[j].d); }
+			if ( tab[j].d ) { _FREEDL(tab[j].d); }
 		curlen *= k+1;
 #endif
 	}
@@ -510,7 +492,7 @@ struct cdlm *rt;
 		for ( i = 0; i < n; i++, p++ ) {
 			if ( t[i].c ) {
 				p->c = dmar(t[i].c,c,0,mod);
-				adddl_dup(nv,t[i].d,d,&p->d);
+				_adddl_dup(nv,t[i].d,d,&p->d);
 			}
 		}
 	}
@@ -537,7 +519,7 @@ int n1;
 		for ( i = 0; i < n; i++, p++ ) {
 			if ( t[i].c ) {
 				p->c = dmar(t[i].c,c,0,mod);
-				adddl_dup(nv,t[i].d,d,&p->d);
+				_adddl_dup(nv,t[i].d,d,&p->d);
 			}
 		}
 	}
@@ -551,57 +533,20 @@ int n1;
 		}
 }
 
-void _dp_red_mod_destructive(p1,p2,mod,rp)
-DP p1,p2;
-int mod;
-DP *rp;
+void dlto_dl(d,dr)
+DL d;
+DL *dr;
 {
 	int i,n;
-	DL d1,d2,d;
-	MP m;
-	DP t,s;
-	int c,c1;
+	DL t;
 
-	n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
-	_NEWDL(d,n); d->td = d1->td - d2->td;
+	n = current_dl_length;
+	_NEWDL(t,n); *dr = t;
+	t->td = d->td;
 	for ( i = 0; i < n; i++ )
-		d->d[i] = d1->d[i]-d2->d[i];
-	c = invm(ITOS(BDY(p2)->c),mod); c1 = dmar(c,ITOS(BDY(p1)->c),0,mod);
-	_NEWMP(m); m->dl = d; m->c = STOI(mod-c1); NEXT(m) = 0;
-	_MKDP(n,m,s); s->sugar = d->td;
-	_mulmd_dup(mod,s,p2,&t); _free_dp(s);
-	_addmd_destructive(mod,p1,t,rp);
+		t->d[i] = d->d[i];	
 }
 
-void _dp_sp_mod_dup(p1,p2,mod,rp)
-DP p1,p2;
-int mod;
-DP *rp;
-{
-	int i,n,td;
-	int *w;
-	DL d1,d2,d;
-	MP m;
-	DP t,s,u;
-
-	n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl;
-	w = (int *)ALLOCA(n*sizeof(int));
-	for ( i = 0, td = 0; i < n; i++ ) {
-		w[i] = MAX(d1->d[i],d2->d[i]); td += w[i];
-	}
-	_NEWDL(d,n); d->td = td - d1->td;
-	for ( i = 0; i < n; i++ )
-		d->d[i] = w[i] - d1->d[i];
-	_NEWMP(m); m->dl = d; m->c = BDY(p2)->c; NEXT(m) = 0;
-	_MKDP(n,m,s); s->sugar = d->td; _mulmd_dup(mod,s,p1,&t); _free_dp(s);
-	_NEWDL(d,n); d->td = td - d2->td;
-	for ( i = 0; i < n; i++ )
-		d->d[i] = w[i] - d2->d[i];
-	_NEWMP(m); m->dl = d; m->c = STOI(mod - ITOS(BDY(p1)->c)); NEXT(m) = 0;
-	_MKDP(n,m,s); s->sugar = d->td; _mulmd_dup(mod,s,p2,&u); _free_dp(s);
-	_addmd_destructive(mod,t,u,rp);
-}
-
 void _dltodl(d,dr)
 DL d;
 DL *dr;
@@ -616,7 +561,7 @@ DL *dr;
 		t->d[i] = d->d[i];	
 }
 
-void adddl_dup(n,d1,d2,dr)
+void _adddl_dup(n,d1,d2,dr)
 int n;
 DL d1,d2;
 DL *dr;
@@ -631,27 +576,13 @@ DL *dr;
 		dt->d[i] = d1->d[i]+d2->d[i];
 }
 
-/* d1 += d2 */
-
-void adddl_destructive(n,d1,d2)
-int n;
-DL d1,d2;
-{
-	DL dt;
-	int i;
-
-	d1->td += d2->td;
-	for ( i = 0; i < n; i++ )
-		d1->d[i] += d2->d[i];
-}
-
 void _free_dlarray(a,n)
 DL *a;
 int n;
 {
 	int i;
 
-	for ( i = 0; i < n; i++ ) { FREEDL(a[i]); }
+	for ( i = 0; i < n; i++ ) { _FREEDL(a[i]); }
 }
 
 void _free_dp(f)
@@ -663,11 +594,35 @@ DP f;
 		return;
 	m = f->body;
 	while ( m ) {
-		s = m; m = NEXT(m); FREEDL(s->dl); FREEMP(s);
+		s = m; m = NEXT(m); _FREEDL(s->dl); _FREEMP(s);
 	}
-	FREEDP(f);
+	_FREEDP(f);
 }
 
+void dpto_dp(p,r)
+DP p;
+DP *r;
+{
+	MP m,mr0,mr;
+	DL t;
+
+	if ( !p )
+		*r = 0;
+	else {
+		/* XXX : dummy call to set current_dl_length */
+		_NEWDL_NOINIT(t,NV(p));
+
+		for ( m = BDY(p), mr0 = 0; m; m = NEXT(m) ) {
+			_NEXTMP(mr0,mr);
+			dlto_dl(m->dl,&mr->dl);
+			mr->c = m->c;
+		}
+		NEXT(mr) = 0;
+		_MKDP(p->nv,mr0,*r);
+		(*r)->sugar = p->sugar;
+	}
+}
+
 void _dptodp(p,r)
 DP p;
 DP *r;
@@ -688,61 +643,476 @@ DP *r;
 	}
 }
 
-void _dp_nf_mod_destructive(b,g,ps,mod,full,rp)
-NODE b;
-DP g;
-DP *ps;
-int mod,full;
-DP *rp;
+/* 
+ * destructive merge of two list
+ *
+ * p1, p2 : list of DL
+ * return : a merged list
+ */
+
+NODE _symb_merge(m1,m2,n)
+NODE m1,m2;
+int n;
 {
-	DP u,p,d,s,t;
-	NODE l;
-	MP m,mr,mrd;
-	int sugar,psugar,n,h_reducible,i;
+	NODE top,prev,cur,m,t;
 
-	if ( !g ) {
-		*rp = 0; return;
+	if ( !m1 )
+		return m2;
+	else if ( !m2 )
+		return m1;
+	else {
+		switch ( (*cmpdl)(n,(DL)BDY(m1),(DL)BDY(m2)) ) {
+			case 0:
+				top = m1; _FREEDL((DL)BDY(m2)); m = NEXT(m2);
+				break;
+			case 1:
+				top = m1; m = m2;
+				break;
+			case -1:
+				top = m2; m = m1;
+				break;
+		}
+		prev = top; cur = NEXT(top);
+		/* BDY(prev) > BDY(m) always holds */
+		while ( cur && m ) {
+			switch ( (*cmpdl)(n,(DL)BDY(cur),(DL)BDY(m)) ) {
+				case 0:
+					_FREEDL(BDY(m)); m = NEXT(m);
+					prev = cur; cur = NEXT(cur);
+					break;
+				case 1:
+					t = NEXT(cur); NEXT(cur) = m; m = t;
+					prev = cur; cur = NEXT(cur);
+					break;
+				case -1:
+					NEXT(prev) = m; m = cur;
+					prev = NEXT(prev); cur = NEXT(prev);
+					break;
+			}
+		}
+		if ( !cur )
+			NEXT(prev) = m;
+		return top;
 	}
-	sugar = g->sugar;
-	n = g->nv;
-	for ( d = 0; g; ) {
-		for ( h_reducible = 0, l = b; l; l = NEXT(l) ) {
-			if ( dp_redble(g,p = ps[(int)BDY(l)]) ) {
-				h_reducible = 1;
-				psugar = (BDY(g)->dl->td - BDY(p)->dl->td) + p->sugar;
-				_dp_red_mod_destructive(g,p,mod,&u); g = u;
-				sugar = MAX(sugar,psugar);
-				if ( !g ) {
-					if ( d )
-						d->sugar = sugar;
-					_dptodp(d,rp); _free_dp(d); return;
+}
+
+/* XXX : bellow should be placed in another file */
+
+void dpto_dp();
+void _dptodp();
+void _adddl_dup();
+void adddl_destructive();
+void _muldm_dup();
+void _free_dp();
+void _comm_muld_dup();
+void _weyl_muld_dup();
+void _weyl_mulmm_dup();
+void _weyl_muldm_dup();
+void _comm_muld_tab();
+void _comm_muld_tab_destructive();
+
+/* merge p1 and p2 into pr */
+
+void _addd_destructive(vl,p1,p2,pr)
+VL vl;
+DP p1,p2,*pr;
+{
+	int n;
+	MP m1,m2,mr,mr0,s;
+	P t;
+
+	if ( !p1 )
+		*pr = p2;
+	else if ( !p2 )
+		*pr = p1;
+	else {
+		for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; )
+			switch ( (*cmpdl)(n,m1->dl,m2->dl) ) {
+				case 0:
+					addp(vl,C(m1),C(m2),&t);
+					s = m1; m1 = NEXT(m1);
+					if ( t ) {
+						_NEXTMP2(mr0,mr,s); C(mr) = t;
+					} else {
+						_FREEDL(s->dl); _FREEMP(s);
+					}
+					s = m2; m2 = NEXT(m2); _FREEDL(s->dl); _FREEMP(s);
+					break;
+				case 1:
+					s = m1; m1 = NEXT(m1); _NEXTMP2(mr0,mr,s);
+					break;
+				case -1:
+					s = m2; m2 = NEXT(m2); _NEXTMP2(mr0,mr,s);
+					break;
+			}
+		if ( !mr0 )
+			if ( m1 )
+				mr0 = m1;
+			else if ( m2 )
+				mr0 = m2;
+			else {
+				*pr = 0;
+				return;
+			}
+		else if ( m1 )
+			NEXT(mr) = m1;
+		else if ( m2 )
+			NEXT(mr) = m2;
+		else
+			NEXT(mr) = 0;
+		_MKDP(NV(p1),mr0,*pr);
+		if ( *pr )
+			(*pr)->sugar = MAX(p1->sugar,p2->sugar);
+		_FREEDP(p1); _FREEDP(p2);
+	}
+}
+
+void _muld_dup(vl,p1,p2,pr)
+VL vl;
+DP p1,p2,*pr;
+{
+	if ( !do_weyl )
+		_comm_muld_dup(vl,p1,p2,pr);
+	else
+		_weyl_muld_dup(vl,p1,p2,pr);
+}
+
+void _comm_muld_dup(vl,p1,p2,pr)
+VL vl;
+DP p1,p2,*pr;
+{
+	MP m;
+	DP s,t,u;
+	int i,l,l1;
+	static MP *w;
+	static int wlen;
+
+	if ( !p1 || !p2 )
+		*pr = 0;
+	else {
+		for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ );
+		for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ );
+		if ( l1 < l ) {
+			t = p1; p1 = p2; p2 = t;
+			l = l1;
+		}
+		if ( l > wlen ) {
+			if ( w ) GC_free(w);
+			w = (MP *)MALLOC(l*sizeof(MP));
+			wlen = l;
+		}
+		for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ )
+			w[i] = m;
+		for ( s = 0, i = l-1; i >= 0; i-- ) {
+			_muldm_dup(vl,p1,w[i],&t); _addd_destructive(vl,s,t,&u); s = u;
+		}
+		bzero(w,l*sizeof(MP));
+		*pr = s;
+	}
+}
+
+void _weyl_muld_dup(vl,p1,p2,pr)
+VL vl;
+DP p1,p2,*pr;
+{
+	MP m;
+	DP s,t,u;
+	int i,l,l1;
+	static MP *w;
+	static int wlen;
+
+	if ( !p1 || !p2 )
+		*pr = 0;
+	else {
+		for ( m = BDY(p1), l = 0; m; m = NEXT(m), l++ );
+		if ( l > wlen ) {
+			if ( w ) GC_free(w);
+			w = (MP *)MALLOC(l*sizeof(MP));
+			wlen = l;
+		}
+		for ( m = BDY(p1), i = 0; i < l; m = NEXT(m), i++ )
+			w[i] = m;
+		for ( s = 0, i = l-1; i >= 0; i-- ) {
+			_weyl_muldm_dup(vl,w[i],p2,&t); _addd_destructive(vl,s,t,&u); s = u;
+		}
+		bzero(w,l*sizeof(MP));
+		*pr = s;
+	}
+}
+
+void _muldm_dup(vl,p,m0,pr)
+VL vl;
+DP p;
+MP m0;
+DP *pr;
+{
+	MP m,mr,mr0;
+	DL d,dt,dm;
+	P c;
+	int n,r,i;
+	int *pt,*p1,*p2;
+
+	if ( !p )
+		*pr = 0;
+	else {
+		for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl, n = NV(p); 
+			m; m = NEXT(m) ) {
+			_NEXTMP(mr0,mr);
+			mulp(vl,C(m),c,&C(mr));
+			_NEWDL_NOINIT(dt,n); mr->dl = dt;
+			dm = m->dl;
+			dt->td = d->td + dm->td;
+			for ( i = 0, pt = dt->d, p1=d->d, p2 = dm->d; i < n; i++ )
+				*pt++ = *p1++ + *p2++;
+		}
+		NEXT(mr) = 0; _MKDP(NV(p),mr0,*pr);
+		if ( *pr )
+			(*pr)->sugar = p->sugar + m0->dl->td;
+	}
+}
+
+void _weyl_muldm_dup(vl,m0,p,pr)
+VL vl;
+MP m0;
+DP p;
+DP *pr;
+{
+	DP r,t,t1;
+	MP m;
+	DL d0;
+	int n,n2,l,i,j,tlen;
+	static MP *w,*psum;
+	static struct cdl *tab;
+	static int wlen;
+	static int rtlen;
+
+	if ( !p )
+		*pr = 0;
+	else {
+		for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ );
+		if ( l > wlen ) {
+			if ( w ) GC_free(w);
+			w = (MP *)MALLOC(l*sizeof(MP));
+			wlen = l;
+		}
+		for ( m = BDY(p), i = 0; i < l; m = NEXT(m), i++ )
+			w[i] = m;
+		n = NV(p); n2 = n>>1;
+		d0 = m0->dl;
+
+		for ( i = 0, tlen = 1; i < n2; i++ )
+			tlen *= d0->d[n2+i]+1;
+		if ( tlen > rtlen ) {
+			if ( tab ) GC_free(tab);
+			if ( psum ) GC_free(psum);
+			rtlen = tlen;
+			tab = (struct cdl *)MALLOC(rtlen*sizeof(struct cdl));
+			psum = (MP *)MALLOC(rtlen*sizeof(MP));
+		}
+		bzero(psum,tlen*sizeof(MP));
+		for ( i = l-1; i >= 0; i-- ) {
+			bzero(tab,tlen*sizeof(struct cdl));
+			_weyl_mulmm_dup(vl,m0,w[i],n,tab,tlen);
+			for ( j = 0; j < tlen; j++ ) {
+				if ( tab[j].c ) {
+					_NEWMP(m); m->dl = tab[j].d;
+					C(m) = tab[j].c; NEXT(m) = psum[j];
+					psum[j] = m;
 				}
-				break;
 			}
 		}
-		if ( !h_reducible ) {
-			/* head term is not reducible */
-			if ( !full ) {
-				if ( g )
-					g->sugar = sugar;
-				_dptodp(g,rp); _free_dp(g); return;
-			} else {
-				m = BDY(g); 
-				if ( NEXT(m) ) {
-					BDY(g) = NEXT(m); NEXT(m) = 0;
-				} else {
-					FREEDP(g); g = 0;
+		for ( j = tlen-1, r = 0; j >= 0; j-- ) 
+			if ( psum[j] ) {
+				_MKDP(n,psum[j],t); _addd_destructive(vl,r,t,&t1); r = t1;
+			}
+		if ( r )
+			r->sugar = p->sugar + m0->dl->td;
+		*pr = r;
+	}
+}
+
+/* m0 = x0^d0*x1^d1*... * dx0^d(n/2)*dx1^d(n/2+1)*... */
+
+void _weyl_mulmm_dup(vl,m0,m1,n,rtab,rtablen)
+VL vl;
+MP m0,m1;
+int n;
+struct cdl *rtab;
+int rtablen;
+{
+	MP m,mr,mr0;
+	DP r,t,t1;
+	P c;
+	int c0,c1,cc;
+	DL d,d0,d1,dt;
+	int i,j,a,b,k,l,n2,s,min,h,curlen;
+	struct cdl *p;
+	static P *ctab;
+	static struct cdl *tab;
+	static int tablen;
+	static struct cdl *tmptab;
+	static int tmptablen;
+
+	if ( !m0 || !m1 ) {
+		rtab[0].c = 0;
+		rtab[0].d = 0;
+		return;
+	}
+	mulp(vl,C(m0),C(m1),&c);
+	d0 = m0->dl; d1 = m1->dl;
+	n2 = n>>1;
+	curlen = 1;
+
+	_NEWDL(d,n);
+	if ( n & 1 )
+		/* offset of h-degree */
+		d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1];
+	else
+		d->td = 0;
+	rtab[0].c = c;
+	rtab[0].d = d;
+
+	if ( rtablen > tmptablen ) {
+		if ( tmptab ) GC_free(tmptab);
+		tmptab = (struct cdl *)MALLOC(rtablen*sizeof(struct cdl));
+		tmptablen = rtablen; 
+	}
+
+	for ( i = 0; i < n2; i++ ) {
+		a = d0->d[i]; b = d1->d[n2+i];
+		k = d0->d[n2+i]; l = d1->d[i];
+		if ( !k || !l ) {
+			a += l;
+			b += k;
+			s = a+b;
+			for ( j = 0, p = rtab; j < curlen; j++, p++ ) {
+				if ( p->c ) {
+					dt = p->d;
+					dt->d[i] = a;
+					dt->d[n2+i] = b;
+					dt->td += s;
 				}
-				if ( d ) {
-					for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) );
-					NEXT(mrd) = m;
-				} else {
-					_MKDP(n,m,d);
-				}
 			}
+			curlen *= k+1;
+			continue;
 		}
+		if ( k+1 > tablen ) {
+			if ( tab ) GC_free(tab);
+			if ( ctab ) GC_free(ctab);
+			tablen = k+1;
+			tab = (struct cdl *)MALLOC(tablen*sizeof(struct cdl));
+			ctab = (P *)MALLOC(tablen*sizeof(P));
+		}
+		/* degree of xi^a*(Di^k*xi^l)*Di^b */
+		s = a+k+l+b;
+		/* compute xi^a*(Di^k*xi^l)*Di^b */
+		min = MIN(k,l);
+		mkwc(k,l,ctab);
+		bzero(tab,(k+1)*sizeof(struct cdl));
+		/* n&1 != 0 => homogenized computation; dx-xd=h^2 */
+		if ( n & 1 )
+			for ( j = 0; j <= min; j++ ) {
+				_NEWDL(d,n);
+				d->d[i] = l-j+a; d->d[n2+i] = k-j+b;
+				d->td = s;
+				d->d[n-1] = s-(d->d[i]+d->d[n2+i]); 
+				tab[j].d = d;
+				tab[j].c = ctab[j];
+			}
+		else
+			for ( j = 0; j <= min; j++ ) {
+				_NEWDL(d,n);
+				d->d[i] = l-j+a; d->d[n2+i] = k-j+b;
+				d->td = d->d[i]+d->d[n2+i]; /* XXX */
+				tab[j].d = d;
+				tab[j].c = ctab[j];
+			}
+#if 0
+		_comm_muld_tab(vl,n,rtab,curlen,tab,k+1,tmptab);
+		for ( j = 0; j < curlen; j++ )
+			if ( rtab[j].d ) { _FREEDL(rtab[j].d); }
+		for ( j = 0; j <= min; j++ )
+			if ( tab[j].d ) { _FREEDL(tab[j].d); }
+		curlen *= k+1;
+		bcopy(tmptab,rtab,curlen*sizeof(struct cdl));
+#else
+		_comm_muld_tab_destructive(vl,n,rtab,curlen,tab,k+1);
+		for ( j = 0; j <= min; j++ )
+			if ( tab[j].d ) { _FREEDL(tab[j].d); }
+		curlen *= k+1;
+#endif
 	}
-	if ( d )
-		d->sugar = sugar;
-	_dptodp(d,rp); _free_dp(d);
+}
+
+/* direct product of two cdl tables
+  rt[] = [
+    t[0]*t1[0],...,t[n-1]*t1[0],
+    t[0]*t1[1],...,t[n-1]*t1[1],
+    ...
+    t[0]*t1[n1-1],...,t[n-1]*t1[n1-1]
+  ]
+*/
+
+void _comm_muld_tab(vl,nv,t,n,t1,n1,rt)
+VL vl;
+int nv;
+struct cdl *t;
+int n;
+struct cdl *t1;
+int n1;
+struct cdl *rt;
+{
+	int i,j;
+	struct cdl *p;
+	P c;
+	DL d;
+
+	bzero(rt,n*n1*sizeof(struct cdl));
+	for ( j = 0, p = rt; j < n1; j++ ) {
+		c = t1[j].c;
+		d = t1[j].d;
+		if ( !c )
+			break;
+		for ( i = 0; i < n; i++, p++ ) {
+			if ( t[i].c ) {
+				mulp(vl,t[i].c,c,&p->c);
+				_adddl_dup(nv,t[i].d,d,&p->d);
+			}
+		}
+	}
+}
+
+void _comm_muld_tab_destructive(vl,nv,t,n,t1,n1)
+VL vl;
+int nv;
+struct cdl *t;
+int n;
+struct cdl *t1;
+int n1;
+{
+	int i,j;
+	struct cdl *p;
+	P c;
+	DL d;
+
+	for ( j = 1, p = t+n; j < n1; j++ ) {
+		c = t1[j].c;
+		d = t1[j].d;
+		if ( !c )
+			break;
+		for ( i = 0; i < n; i++, p++ ) {
+			if ( t[i].c ) {
+				mulp(vl,t[i].c,c,&p->c);
+				_adddl_dup(nv,t[i].d,d,&p->d);
+			}
+		}
+	}
+	c = t1[0].c;
+	d = t1[0].d;
+	for ( i = 0, p = t; i < n; i++, p++ )
+		if ( t[i].c ) {
+			mulp(vl,t[i].c,c,&p->c);
+			/* t[i].d += d */
+			adddl_destructive(nv,t[i].d,d);
+		}
 }