version 1.10, 2019/08/28 23:27:34 |
version 1.12, 2019/11/12 07:47: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/asir2018/include/ca.h,v 1.9 2019/08/21 00:37:47 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2018/include/ca.h,v 1.11 2019/09/19 06:29:48 noro Exp $ |
*/ |
*/ |
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
Line 538 typedef struct oDMM { |
|
Line 538 typedef struct oDMM { |
|
typedef struct oDMMstack { |
typedef struct oDMMstack { |
int rank,ordtype; |
int rank,ordtype; |
DMM *in; |
DMM *in; |
|
LIST obj; |
struct oDMMstack *next; |
struct oDMMstack *next; |
} *DMMstack; |
} *DMMstack; |
|
|
Line 604 typedef struct oNODE { |
|
Line 605 typedef struct oNODE { |
|
struct oNODE *next; |
struct oNODE *next; |
} *NODE; |
} *NODE; |
|
|
|
typedef struct oNODE2 { |
|
pointer body1,body2; |
|
struct oNODE2 *next; |
|
} *NODE2; |
|
|
/* univariate poly over small finite field; dense */ |
/* univariate poly over small finite field; dense */ |
typedef struct oUM { |
typedef struct oUM { |
int d; |
int d; |
Line 678 struct order_spec { |
|
Line 684 struct order_spec { |
|
int id; |
int id; |
Obj obj; |
Obj obj; |
int nv; |
int nv; |
int ispot; /* 1 means Position over Term (Pos then Term) */ |
int module_ordtype; /* 0=TOP, 1=POT, 2=wPOT, 3=Schreyer */ |
int pot_nelim; /* size of positions for pot-elimination order */ |
int pot_nelim; /* size of positions for pot-elimination order */ |
int *top_weight; |
int *top_weight; |
int module_rank; |
int module_rank; |
int *module_top_weight; |
int *module_top_weight; |
|
struct order_spec *base; /* for schreyer order */ |
|
DMMstack dmmstack; |
union { |
union { |
int simple; |
int simple; |
struct { |
struct { |
Line 939 DEG(DC(p))=ONE,COEF(DC(p))=(P)ONE,NEXT(DC(p))=0) |
|
Line 947 DEG(DC(p))=ONE,COEF(DC(p))=(P)ONE,NEXT(DC(p))=0) |
|
DEG(DC(p))=ONE,COEF(DC(p))=(P)ONEM,NEXT(DC(p))=0) |
DEG(DC(p))=ONE,COEF(DC(p))=(P)ONEM,NEXT(DC(p))=0) |
#define MKNODE(a,b,c) \ |
#define MKNODE(a,b,c) \ |
(NEWNODE(a),(a)->body=(pointer)b,NEXT(a)=(NODE)(c)) |
(NEWNODE(a),(a)->body=(pointer)b,NEXT(a)=(NODE)(c)) |
|
#define NEWNODE2(a) ((a)=(NODE2)MALLOC(sizeof(struct oNODE2))) |
|
#define MKNODE2(a,b,c,d) \ |
|
(NEWNODE2(a),(a)->body1=(pointer)b,(a)->body2=(pointer)c,NEXT(a)=(NODE2)(d)) |
|
#define BDY1(a) ((a)->body1) |
|
#define BDY2(a) ((a)->body2) |
#define MKLIST(a,b) (NEWLIST(a),(a)->body=(NODE)(b)) |
#define MKLIST(a,b) (NEWLIST(a),(a)->body=(NODE)(b)) |
#define MKVECT(m,l) \ |
#define MKVECT(m,l) \ |
(NEWVECT(m),(m)->len=(l),(m)->body=(pointer *)CALLOC((l),sizeof(pointer))) |
(NEWVECT(m),(m)->len=(l),(m)->body=(pointer *)CALLOC((l),sizeof(pointer))) |