[BACK]Return to ca.h CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2000 / include

Diff for /OpenXM_contrib2/asir2000/include/ca.h between version 1.20 and 1.26

version 1.20, 2001/09/03 01:04:27 version 1.26, 2001/09/17 07:16:59
Line 45 
Line 45 
  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,   * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.   * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
  *   *
  * $OpenXM: OpenXM_contrib2/asir2000/include/ca.h,v 1.19 2001/08/20 09:03:25 noro Exp $   * $OpenXM: OpenXM_contrib2/asir2000/include/ca.h,v 1.25 2001/09/13 03:04:28 noro Exp $
 */  */
 #include <stdio.h>  #include <stdio.h>
   
Line 121  typedef void * pointer;
Line 121  typedef void * pointer;
 #define N_GF2N 7  #define N_GF2N 7
 #define N_GFPN 8  #define N_GFPN 8
 #define N_GFS 9  #define N_GFS 9
 #define N_GFSPN 10  #define N_GFSN 10
   
 #define ORD_REVGRADLEX 0  #define ORD_REVGRADLEX 0
 #define ORD_GRADLEX 1  #define ORD_GRADLEX 1
Line 247  typedef struct oGFS {
Line 247  typedef struct oGFS {
         int cont;          int cont;
 } *GFS;  } *GFS;
   
 typedef struct oGFSPN {  typedef struct oGFSN {
         short id;          short id;
         char nid;          char nid;
         char pad;          char pad;
         struct oUM *body;          struct oUM *body;
 } *GFSPN;  } *GFSN;
   
 typedef struct oP {  typedef struct oP {
         short id;          short id;
Line 367  typedef struct oDL {
Line 367  typedef struct oDL {
         int d[1];          int d[1];
 } *DL;  } *DL;
   
   /*
    * compressed DP
    */
   
   typedef struct oCDP {
           int len;
           int psindex;
           unsigned short *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 {  typedef struct oVL {
         V v;          V v;
         struct oVL *next;          struct oVL *next;
Line 458  struct oEGT {
Line 481  struct oEGT {
 #define FF_GF2N 2  #define FF_GF2N 2
 #define FF_GFPN 3  #define FF_GFPN 3
 #define FF_GFS 4  #define FF_GFS 4
 #define FF_GFSPN 5  #define FF_GFSN 5
   
 /* include interval.h */  /* include interval.h */
 #include "interval.h"  #include "interval.h"
Line 574  bzero((char *)(q)->b,(w)*sizeof(unsigned int)))
Line 597  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 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 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 NEWGFS(q) ((q)=(GFS)MALLOC_ATOMIC(sizeof(struct oGFS)),OID(q)=O_N,NID(q)=N_GFS)
 #define NEWGFSPN(q) ((q)=(GFSPN)MALLOC(sizeof(struct oGFSPN)),OID(q)=O_N,NID(q)=N_GFSPN)  #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 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 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)  #define NEWLIST(l) ((l)=(LIST)MALLOC(sizeof(struct oLIST)),OID(l)=O_LIST)
Line 593  bzero((char *)(q)->b,(w)*sizeof(unsigned int)))
Line 616  bzero((char *)(q)->b,(w)*sizeof(unsigned int)))
 #define NEWV(v) ((v)=(V)MALLOC(sizeof(struct oV)))  #define NEWV(v) ((v)=(V)MALLOC(sizeof(struct oV)))
 #define NEWVL(vl) ((vl)=(VL)MALLOC(sizeof(struct oVL)))  #define NEWVL(vl) ((vl)=(VL)MALLOC(sizeof(struct oVL)))
 #define NEWMP(m) ((m)=(MP)MALLOC(sizeof(struct oMP)))  #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 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)  #define NEWGF2MAT(l) ((l)=(GF2MAT)MALLOC(sizeof(struct oGF2MAT)),OID(l)=O_GF2MAT)
Line 648  if(!(r)){NEWNODE(r);(c)=(r);}else{NEWNODE(NEXT(c));(c)
Line 672  if(!(r)){NEWNODE(r);(c)=(r);}else{NEWNODE(NEXT(c));(c)
 if(!(r)){NEWMP(r);(c)=(r);}else{NEWMP(NEXT(c));(c)=NEXT(c);}  if(!(r)){NEWMP(r);(c)=(r);}else{NEWMP(NEXT(c));(c)=NEXT(c);}
 #define NEXTMP2(r,c,s) \  #define NEXTMP2(r,c,s) \
 if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(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 */  /* convertors */
 #define NTOQ(n,s,q) \  #define NTOQ(n,s,q) \
Line 664  PL(NM(q))=1,BD(NM(q))[0]=ABS(n),DN(q)=0,(q)))
Line 690  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))  ((a)?(NEWMQ(b),CONT(b)=(unsigned int)(a),(b)):((b)=0))
 #define MKGFS(a,b) \  #define MKGFS(a,b) \
 ((NEWGFS(b),CONT(b)=(a),(b)))  ((NEWGFS(b),CONT(b)=(a),(b)))
 #define MKGFSPN(a,b) \  #define MKGFSN(a,b) \
 ((NEWGFSPN(b),BDY(b)=(a),(b)))  ((DEG(a)>=0)?(NEWGFSN(b),BDY(b)=(a),(b)):((b)=0))
 #define STOMQ(a,b) \  #define STOMQ(a,b) \
 ((a)?(NEWMQ(b),CONT(b)=(a),(b)):((b)=0))  ((a)?(NEWMQ(b),CONT(b)=(a),(b)):((b)=0))
 #define UTON(u,n) \  #define UTON(u,n) \
Line 693  PL(NM(q))=1,BD(NM(q))[0]=(unsigned int)(n),DN(q)=0,(q)
Line 719  PL(NM(q))=1,BD(NM(q))[0]=(unsigned int)(n),DN(q)=0,(q)
 /* predicates */  /* predicates */
 #define NUM(p) (OID(p)==O_N)  #define NUM(p) (OID(p)==O_N)
 #define RAT(p) (OID(p)==O_R)  #define RAT(p) (OID(p)==O_R)
 #define INT(q) (!DN((Q)q))  
 #define RATN(a) (NID(a)==N_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 REAL(a) (NID(a)==N_R)
 #define BIGFLOAT(a) (NID(a)==N_B)  #define BIGFLOAT(a) (NID(a)==N_B)
 #define SFF(a) (NID(a)==N_M)  #define SFF(a) (NID(a)==N_M)
Line 1227  void chsgngfs(GFS,GFS *);
Line 1253  void chsgngfs(GFS,GFS *);
 void pwrgfs(GFS,Q, GFS *);  void pwrgfs(GFS,Q, GFS *);
 int cmpgfs(GFS,GFS);  int cmpgfs(GFS,GFS);
   
 void addgfspn(GFSPN,GFSPN,GFSPN *);  void addgfsn(GFSN,GFSN,GFSN *);
 void subgfspn(GFSPN,GFSPN,GFSPN *);  void subgfsn(GFSN,GFSN,GFSN *);
 void mulgfspn(GFSPN,GFSPN,GFSPN *);  void mulgfsn(GFSN,GFSN,GFSN *);
 void divgfspn(GFSPN,GFSPN,GFSPN *);  void divgfsn(GFSN,GFSN,GFSN *);
 void chsgngfspn(GFSPN,GFSPN *);  void chsgngfsn(GFSN,GFSN *);
 void pwrgfspn(GFSPN,Q, GFSPN *);  void pwrgfsn(GFSN,Q, GFSN *);
 int cmpgfspn(GFSPN,GFSPN);  int cmpgfsn(GFSN,GFSN);
   
 void addalg(Num,Num,Num *);  void addalg(Num,Num,Num *);
 void addbf(Num,Num,Num *);  void addbf(Num,Num,Num *);
Legend:
Removed from v.1.20  
changed lines
  Added in v.1.26
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>