===================================================================
RCS file: /home/cvs/OpenXM_contrib2/asir2000/builtin/gf.c,v
retrieving revision 1.4
retrieving revision 1.11
diff -u -p -r1.4 -r1.11
--- OpenXM_contrib2/asir2000/builtin/gf.c	2000/08/22 05:03:57	1.4
+++ OpenXM_contrib2/asir2000/builtin/gf.c	2001/08/02 03:59:15	1.11
@@ -45,7 +45,7 @@
  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
  *
- * $OpenXM: OpenXM_contrib2/asir2000/builtin/gf.c,v 1.3 2000/08/21 08:31:19 noro Exp $ 
+ * $OpenXM: OpenXM_contrib2/asir2000/builtin/gf.c,v 1.10 2001/07/03 01:41:25 noro Exp $ 
 */
 #include "ca.h"
 #include "parse.h"
@@ -66,6 +66,7 @@ void nullspace(UM **,UM,int,int,int *);
 void nullspace_lm(LM **,int,int *);
 void nullspace_gf2n(GF2N **,int,int *);
 void nullspace_gfpn(GFPN **,int,int *);
+void nullspace_gfs(GFS **,int,int *);
 void null_to_sol(int **,int *,int,int,UM *);
 
 void showgfmat(UM **,int);
@@ -73,6 +74,7 @@ void pwr_mod(P,P,V,P,int,N,P *);
 void rem_mod(P,P,V,P,int,P *);
 
 void Pnullspace(),Pgcda_mod(),Pftest(),Presfmain(),Ppwr_mod(),Puhensel();
+void Psfuhensel();
 
 void Pnullspace_ff();
 
@@ -82,6 +84,7 @@ void Plinear_form_to_vect(),Pvect_to_linear_form();
 void solve_linear_equation_gf2n(GF2N **,int,int,int *);
 void linear_form_to_array(P,VL,int,Num *);
 void array_to_linear_form(Num *,VL,int,P *);
+void sfuhensel(P,NODE,GFS,int,NODE *);
 
 extern int current_ff;
 
@@ -94,6 +97,7 @@ struct ftab gf_tab[] = {
 	{"resfmain",Presfmain,4},
 	{"pwr_mod",Ppwr_mod,6},
 	{"uhensel",Puhensel,4},
+	{"sfuhensel",Psfuhensel,4},
 	{0,0,0},
 };
 
@@ -178,6 +182,96 @@ NODE *rp;
 	*rp = top;
 }
 
+void Psfuhensel(arg,rp)
+NODE arg;
+LIST *rp;
+{
+	P f;
+	int bound;
+	NODE r,mfl;
+	GFS ev;
+
+	f = (P)ARG0(arg);
+	mfl = BDY((LIST)ARG1(arg));
+	ev = (GFS)ARG2(arg);
+	bound = QTOS((Q)ARG3(arg));
+	sfuhensel(f,mfl,ev,bound,&r);
+	MKLIST(*rp,r);
+}
+
+void sfuhensel(f,mfl,ev,bound,rp)
+P f;
+NODE mfl;
+GFS ev;
+int bound;
+NODE *rp;
+{
+	BM fl;
+	BM *r;
+	VL vl,nvl;
+	int i,fn,dx,dy;
+	NODE t,top;
+	UM fm,hm,q;
+	UM *gm;
+	V x,y;
+	P g,s,u;
+
+	clctv(CO,f,&vl);
+	if ( !vl || !vl->next || vl->next->next )
+		error("sfuhensel : f must be a bivariate poly");
+
+	for ( i = 0, t = mfl; t; i++, t = NEXT(t) );
+	fn = i;
+
+	gm = (UM *)MALLOC(fn*sizeof(UM));
+
+	/* XXX : more severe check is necessary */
+	x = VR((P)BDY(mfl));
+	y = vl->v == x ? vl->next->v : vl->v;
+
+	for ( i = 0, t = mfl; i < fn; i++, t = NEXT(t) ) {
+		gm[i] = (pointer)UMALLOC(getdeg(x,(P)BDY(t)));
+		ptosfum((P)BDY(t),gm[i]);
+	}
+
+	/* reorder f if necessary */
+	if ( vl->v != x ) {
+		reordvar(vl,x,&nvl); reorderp(nvl,vl,f,&g);
+		vl = nvl; f = g;
+	}
+	dx = getdeg(x,f);
+	dy = getdeg(y,f);
+	dy = MAX(dy,bound);
+	fl = BMALLOC(dx,dy);
+	ptosfbm(dy,f,fl);
+	if ( ev ) shiftsfbm(fl,FTOIF(CONT(ev)));
+
+	/* fm = fl mod y */
+	fm = W_UMALLOC(dx);
+	cpyum(COEF(fl)[0],fm);
+	hm = W_UMALLOC(dx);
+
+	q = W_UMALLOC(dx);
+	r = (BM *)MLALLOC(fn*sizeof(BM));
+	for ( i = 0; i < fn-1; i++ ) {
+		/* fl = gm[i]*hm mod y */
+		divsfum(fm,gm[i],hm);
+		/* fl is replaced by the cofactor of gk mod y^bound */
+		/* r[i] = gk */
+		sfhenmain2(fl,gm[i],hm,bound,r+i);
+		cpyum(hm,fm);
+	}
+	/* finally, fl must be the lift of gm[fn-1] */
+	r[i] = fl;
+
+	for ( i = fn-1, top = 0; i >= 0; i-- ) {
+		sfbmtop(r[i],x,y,&s);
+		reorderp(CO,vl,s,&u);
+		MKNODE(t,u,top); top = t;
+	}
+	*rp = top;
+}
+
 void Presfmain(arg,rp)
 NODE arg;
 LIST *rp;
@@ -809,6 +903,8 @@ LIST *rp;
 			nullspace_gf2n((GF2N **)w,n,ind); break;
 		case FF_GFPN:
 			nullspace_gfpn((GFPN **)w,n,ind); break;
+		case FF_GFS:
+			nullspace_gfs((GFS **)w,n,ind); break;
 		default:
 			error("nullspace_ff : current_ff is not set");
 	}
@@ -947,6 +1043,49 @@ int *ind;
 		}
 	}
 }
+
+void nullspace_gfs(mat,n,ind)
+GFS **mat;
+int n;
+int *ind;
+{
+	int i,j,l,s;
+	GFS w,w1,h,inv;
+	GFS *t,*u;
+	GFS one;
+
+	bzero(ind,n*sizeof(int));
+	ind[0] = 0;
+	mqtogfs(ONEM,&one);
+
+	for ( i = j = 0; j < n; i++, j++ ) {
+		for ( ; j < n; j++ ) {
+			for ( l = i; l < n; l++ )
+				if ( mat[l][j] )
+					break;
+			if ( l < n ) {
+				t = mat[i]; mat[i] = mat[l]; mat[l] = t; break;
+			} else
+				ind[j] = 1;
+		}
+		if ( j == n )
+			break;
+		divgfs(one,mat[i][j],&inv);
+		for ( s = j, t = mat[i]; s < n; s++ ) {
+			mulgfs(t[s],inv,&w); t[s] = w;
+		}
+		for ( l = 0; l < n; l++ ) {
+			if ( l == i )
+				continue;
+			u = mat[l]; 
+			chsgngfs(u[j],&h);
+			for ( s = j; s < n; s++ ) {
+				mulgfs(h,t[s],&w); addgfs(w,u[s],&w1); u[s] = w1;
+			}
+		}
+	}
+}
+
 /* p = a(0)vl[0]+a(1)vl[1]+...+a(m-1)vl[m-1]+a(m) -> array = [a(0) a(1) ... a(m)] */
 
 void linear_form_to_array(p,vl,m,array)