===================================================================
RCS file: /home/cvs/OpenXM_contrib2/asir2000/include/ca.h,v
retrieving revision 1.15
retrieving revision 1.25
diff -u -p -r1.15 -r1.25
--- OpenXM_contrib2/asir2000/include/ca.h	2001/06/20 09:30:34	1.15
+++ OpenXM_contrib2/asir2000/include/ca.h	2001/09/13 03:04:28	1.25
@@ -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/include/ca.h,v 1.14 2001/06/07 04:54:41 noro Exp $ 
+ * $OpenXM: OpenXM_contrib2/asir2000/include/ca.h,v 1.24 2001/09/11 01:30:32 noro Exp $ 
 */
 #include <stdio.h>
 
@@ -121,6 +121,7 @@ typedef void * pointer;
 #define N_GF2N 7
 #define N_GFPN 8
 #define N_GFS 9
+#define N_GFSN 10
 
 #define ORD_REVGRADLEX 0
 #define ORD_GRADLEX 1
@@ -246,6 +247,12 @@ typedef struct oGFS {
 	int cont;
 } *GFS;
 
+typedef struct oGFSN {
+	short id;
+	char nid;
+	char pad;
+	struct oUM *body;
+} *GFSN;
 
 typedef struct oP {
 	short id;
@@ -360,6 +367,28 @@ typedef struct oDL {
 	int d[1];
 } *DL;
 
+/* 
+ * compressed DP
+ */
+
+typedef struct oCDP {
+	int len;
+	struct oCM *body;
+} *CDP;
+
+typedef struct oCM {
+	int index;
+	int c;
+} *CM;
+
+/* bucket list for DL */
+
+typedef struct oDLBUCKET {
+	int td;
+	struct oNODE *body;
+	struct oDLBUCKET *next;
+} *DLBUCKET;
+
 typedef struct oVL {
 	V v;
 	struct oVL *next;
@@ -370,16 +399,25 @@ typedef struct oNODE {
 	struct oNODE *next;
 } *NODE;
 
+/* univariate poly over small finite field; dense */
 typedef struct oUM {
 	int d;
 	int c[1];
 } *UM;
 
+/* univariate poly with padic coeff */
 typedef struct oLUM {
 	int d;
 	int *c[1];
 } *LUM;
 
+/* bivariate poly over small finite field; dense */
+
+typedef struct oBM {
+	int d;
+	UM c[1];
+} *BM;
+
 typedef struct oML {
 	int n;
 	int mod;
@@ -442,6 +480,7 @@ struct oEGT {
 #define FF_GF2N 2
 #define FF_GFPN 3
 #define FF_GFS 4
+#define FF_GFSN 5
 
 /* include interval.h */
 #include "interval.h"
@@ -529,6 +568,21 @@ bzero((char *)(p),(int)(((n)+1)*sizeof(type))))
 	(p) = ___q___;\
 }
 
+#define W_BMALLOC(dx,dy,p)\
+{\
+	BM ___q___;\
+	int ___i___;\
+	UM *___c___;\
+	(___q___) = (BM)ALLOCA(TRUESIZE(oBM,(dy),UM));\
+	DEG(___q___) = dy;\
+	___c___ = (UM *)COEF(___q___);\
+	for ( ___i___ = 0; ___i___ <= dy; ___i___++ ) {\
+		___c___[___i___] = W_UMALLOC(dx);\
+		clearum(___c___[___i___],dx);\
+	}\
+	(p) = ___q___;\
+}
+
 #define NEWUP2(q,w)\
 ((q)=(UP2)MALLOC_ATOMIC(TRUESIZE(oUP2,(w)-1,unsigned int)),\
 bzero((char *)(q)->b,(w)*sizeof(unsigned int)))
@@ -542,6 +596,7 @@ bzero((char *)(q)->b,(w)*sizeof(unsigned int)))
 #define NEWQ(q) ((q)=(Q)MALLOC(sizeof(struct oQ)),OID(q)=O_N,NID(q)=N_Q)
 #define NEWMQ(q) ((q)=(MQ)MALLOC_ATOMIC(sizeof(struct oMQ)),OID(q)=O_N,NID(q)=N_M)
 #define NEWGFS(q) ((q)=(GFS)MALLOC_ATOMIC(sizeof(struct oGFS)),OID(q)=O_N,NID(q)=N_GFS)
+#define NEWGFSN(q) ((q)=(GFSN)MALLOC(sizeof(struct oGFSN)),OID(q)=O_N,NID(q)=N_GFSN)
 #define NEWP(p) ((p)=(P)MALLOC(sizeof(struct oP)),OID(p)=O_P)
 #define NEWR(r) ((r)=(R)MALLOC(sizeof(struct oR)),OID(r)=O_R,(r)->reduced=0)
 #define NEWLIST(l) ((l)=(LIST)MALLOC(sizeof(struct oLIST)),OID(l)=O_LIST)
@@ -560,6 +615,7 @@ bzero((char *)(q)->b,(w)*sizeof(unsigned int)))
 #define NEWV(v) ((v)=(V)MALLOC(sizeof(struct oV)))
 #define NEWVL(vl) ((vl)=(VL)MALLOC(sizeof(struct oVL)))
 #define NEWMP(m) ((m)=(MP)MALLOC(sizeof(struct oMP)))
+#define NEWDLBUCKET(a) ((a)=(DLBUCKET)MALLOC(sizeof(struct oDLBUCKET)))
 
 #define NEWMAT(l) ((l)=(MAT)MALLOC(sizeof(struct oMAT)),OID(l)=O_MAT)
 #define NEWGF2MAT(l) ((l)=(GF2MAT)MALLOC(sizeof(struct oGF2MAT)),OID(l)=O_GF2MAT)
@@ -615,6 +671,8 @@ if(!(r)){NEWNODE(r);(c)=(r);}else{NEWNODE(NEXT(c));(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 NEXTDLBUCKET(r,c) \
+if(!(r)){NEWDLBUCKET(r);(c)=(r);}else{NEWDLBUCKET(NEXT(c));(c)=NEXT(c);}
 
 /* convertors */
 #define NTOQ(n,s,q) \
@@ -631,6 +689,8 @@ PL(NM(q))=1,BD(NM(q))[0]=ABS(n),DN(q)=0,(q)))
 ((a)?(NEWMQ(b),CONT(b)=(unsigned int)(a),(b)):((b)=0))
 #define MKGFS(a,b) \
 ((NEWGFS(b),CONT(b)=(a),(b)))
+#define MKGFSN(a,b) \
+((DEG(a)>=0)?(NEWGFSN(b),BDY(b)=(a),(b)):((b)=0))
 #define STOMQ(a,b) \
 ((a)?(NEWMQ(b),CONT(b)=(a),(b)):((b)=0))
 #define UTON(u,n) \
@@ -658,8 +718,8 @@ PL(NM(q))=1,BD(NM(q))[0]=(unsigned int)(n),DN(q)=0,(q)
 /* predicates */
 #define NUM(p) (OID(p)==O_N)
 #define RAT(p) (OID(p)==O_R)
-#define INT(q) (!DN((Q)q))
 #define RATN(a) (NID(a)==N_Q)
+#define INT(q) (!(q)||(NUM(q)&&RATN((Num)q)&&!DN((Q)q)))
 #define REAL(a) (NID(a)==N_R)
 #define BIGFLOAT(a) (NID(a)==N_B)
 #define SFF(a) (NID(a)==N_M)
@@ -1095,6 +1155,7 @@ int int_bits(int);
 
 
 LUM LUMALLOC(int, int);
+BM BMALLOC(int, int);
 Obj ToAlg(Num);
 UM *berlemain(register int, UM, UM *);
 void *Risa_GC_malloc(size_t);
@@ -1191,6 +1252,14 @@ void chsgngfs(GFS,GFS *);
 void pwrgfs(GFS,Q, GFS *);
 int cmpgfs(GFS,GFS);
 
+void addgfsn(GFSN,GFSN,GFSN *);
+void subgfsn(GFSN,GFSN,GFSN *);
+void mulgfsn(GFSN,GFSN,GFSN *);
+void divgfsn(GFSN,GFSN,GFSN *);
+void chsgngfsn(GFSN,GFSN *);
+void pwrgfsn(GFSN,Q, GFSN *);
+int cmpgfsn(GFSN,GFSN);
+
 void addalg(Num,Num,Num *);
 void addbf(Num,Num,Num *);
 void addcplx(Num,Num,Num *);
@@ -1215,6 +1284,7 @@ void addlm(LM,LM,LM *);
 void addstr(VL,STRING,STRING,STRING *);
 void addum(int,UM,UM,UM);
 void addvect(VL,VECT,VECT,VECT *);
+void addquote(VL,QUOTE,QUOTE,QUOTE *);
 void adjc(VL,P,P,P,Q,P *,P *);
 void afctr(VL,P,P,DCP *);
 void afctrmain(VL,P,P,int,DCP *);
@@ -1238,6 +1308,7 @@ void chsgnreal(Num,Num *);
 void chsgnmi(MQ,MQ *);
 void chsgnlm(LM,LM *);
 void chsgnvect(VECT,VECT *);
+void chsgnquote(QUOTE,QUOTE *);
 void clctv(VL,P,VL *);
 void clctvr(VL,Obj,VL *);
 void cm2p(Q,Q,P,P *);
@@ -1279,6 +1350,7 @@ void divsrdcp(VL,P,P,P *,P *);
 void divsrmp(VL,int,P,P,P *,P *);
 void divsrp(VL,P,P,P *,P *);
 void divvect(VL,Obj,Obj,Obj *);
+void divquote(VL,QUOTE,QUOTE,QUOTE *);
 void dtest(P,ML,int,DCP *);
 void dtestroot(int,int,P,LUM,struct oDUM *,DCP *);
 void dtestroot1(int,int,P,LUM,P *);
@@ -1374,6 +1446,7 @@ void mulsgn(VN,VN,int,VN);
 void mulsum(register int,UM,register int,UM);
 void mulum(register int,UM,UM,UM);
 void mulvect(VL,Obj,Obj,Obj *);
+void mulquote(VL,QUOTE,QUOTE,QUOTE *);
 void mulvectmat(VL,VECT,MAT,VECT *);
 void next(VN);
 void nezgcdnp_sqfr_primitive(VL,P,P *,int,P *);
@@ -1419,6 +1492,7 @@ void pwrnum(VL,Num,Num,Num *);
 void pwrp(VL,P,Q,P *);
 void pwrq(Q,Q,Q *);
 void pwrr(VL,Obj,Obj,Obj *);
+void pwrquote(VL,QUOTE,QUOTE,QUOTE *);
 void pwrreal(Num,Num,Real *);
 void pwrmi(MQ,Q,MQ *);
 void pwrlm(LM,Q,LM *);
@@ -1477,6 +1551,7 @@ void substp(VL,P,V,P,P *);
 void substvp(VL,P,VN,P *);
 void subum(int,UM,UM,UM);
 void subvect(VL,VECT,VECT,VECT *);
+void subquote(VL,QUOTE,QUOTE,QUOTE *);
 void toreim(Num,Num *,Num *);
 void ucsump(P,Q *);
 void udivpwm(Q,P,P,P *,P *);