| version 1.21, 2001/09/03 07:01:07 |
version 1.26, 2001/09/17 07:16:59 |
|
|
| * 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.20 2001/09/03 01:04:27 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 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 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 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) |