OpenXM_contrib2/asir2018/include/ca.h - diff

Return to ca.h CVS log

Up to [local] / OpenXM_contrib2 / asir2018 / include

Diff for /OpenXM_contrib2/asir2018/include/ca.h between version 1.5 and 1.15

version 1.5, 2018/10/01 05:49:06

version 1.15, 2019/12/13 14:40:49

Line 45

* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,

* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.

* $OpenXM: OpenXM_contrib2/asir2018/include/ca.h,v 1.4 2018/09/28 08:20:29 noro Exp $

* $OpenXM: OpenXM_contrib2/asir2018/include/ca.h,v 1.14 2019/11/19 10:50:31 noro Exp $

#include <stdio.h>

#include <stdlib.h>

Line 95 typedef caddr_t pointer;

typedef void * pointer;

#if defined(sun)

#if defined(ANDROID)

#include <strings.h>

#include <string.h>

#define index(s,c) strchr(s,c)

#define rindex(s,c) strrchr(s,c)

#elif defined(sun)

#include <strings.h>

#else

#include <string.h>

#if defined(VISUAL) || defined(__MINGW32__)

Line 535 typedef struct oDMM {

Line 540 typedef struct oDMM {

struct oDMM *next;

} *DMM;

typedef struct oDMMstack {

int rank,ordtype;

DMM *in;

DMM *sum;

LIST obj;

struct oDMMstack *next;

} *DMMstack;

typedef struct oDMMstack_array {

int len;

DMMstack *body;

} *DMMstack_array;

typedef struct oDL {

int td;

int d[1];

Line 598 typedef struct oNODE {

Line 616 typedef struct oNODE {

struct oNODE *next;

} *NODE;

typedef struct oNODE2 {

pointer body1,body2;

struct oNODE2 *next;

} *NODE2;

/* univariate poly over small finite field; dense */

typedef struct oUM {

int d;

Line 672 struct order_spec {

Line 695 struct order_spec {

int id;

Obj obj;

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 *top_weight;

int module_rank;

int *module_top_weight;

struct order_spec *base; /* for schreyer order */

DMMstack dmmstack;

union {

int simple;

struct {

Line 896 bzero((char *)(q)->b,(w)*sizeof(unsigned int)))

Line 921 bzero((char *)(q)->b,(w)*sizeof(unsigned int)))

#define NEWVL(vl) ((vl)=(VL)MALLOC(sizeof(struct oVL)))

#define NEWMP(m) ((m)=(MP)MALLOC(sizeof(struct oMP)))

#define NEWDMM(m) ((m)=(DMM)MALLOC(sizeof(struct oDMM)))

#define NEWDMMstack(m) ((m)=(DMMstack)MALLOC(sizeof(struct oDMMstack)))

#define NEWDMMstack_array(m) ((m)=(DMMstack_array)MALLOC(sizeof(struct oDMMstack_array)))

#define NEWDLBUCKET(a) ((a)=(DLBUCKET)MALLOC(sizeof(struct oDLBUCKET)))

#define NEWDPP(a) ((a)=(DP_pairs)MALLOC(sizeof(struct dp_pairs)))

Line 932 DEG(DC(p))=ONE,COEF(DC(p))=(P)ONE,NEXT(DC(p))=0)

Line 959 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)

#define MKNODE(a,b,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 MKVECT(m,l) \

(NEWVECT(m),(m)->len=(l),(m)->body=(pointer *)CALLOC((l),sizeof(pointer)))

Line 978 if(!(r)){NEWDMM(r);(c)=(r);}else{NEWDMM(NEXT(c));(c)=N

Line 1010 if(!(r)){NEWDMM(r);(c)=(r);}else{NEWDMM(NEXT(c));(c)=N

#define DUPZ(p,q) (NEWZ(q),BDY(q)=BDY(p))

#define DUPQ(p,q) (NEWQ(q),BDY(q)=BDY(p))

#define STOZ(n,q) ((!(n))?((q)=0):(NEWZ(q),mpz_set_si(BDY(q),n)))

#define STOZ(n,q) ((!(n))?(void)((q)=0):(NEWZ(q),mpz_set_si(BDY(q),n)))

#define UTOZ(n,q) ((!(n))?((q)=0):(NEWZ(q),mpz_set_ui(BDY(q),n)))

#define UTOZ(n,q) ((!(n))?(void)((q)=0):(NEWZ(q),mpz_set_ui(BDY(q),n)))

/* for initializing static object */

#define STOZ0(n,q) (OID(q)=O_N,NID(q)=N_Q,(q)->z=1,mpz_init(BDY(q)),mpz_set_si(BDY(q),n))

Line 1021 if(!(r)){NEWDMM(r);(c)=(r);}else{NEWDMM(NEXT(c));(c)=N

Line 1053 if(!(r)){NEWDMM(r);(c)=(r);}else{NEWDMM(NEXT(c));(c)=N

#define UNIMQ(q) ((q)&&NUM(q)&&SFF(q)&&(CONT((MQ)q)==1))

#define MUNIMQ(q) ((q)&&NUM(q)&&SFF(q)&&(CONT((MQ)q)==-1))

#define EVENZ(n) ((!(n))||(INT(n)&&mpz_tstbit(((Z)(n))->body,0)==0))

#define UNIMPZ(q) (mpz_cmp_si(q,1)==0)

#define MUNIMPZ(q) (mpz_cmp_si(q,-1)==0)

/* special macros for private memory management */

Line 1774 void vntovl(VN,int,VL *);

Line 1808 void vntovl(VN,int,VL *);

void saveerror(FILE *,ERR);

void saveui(FILE *,USINT);

void savedp(FILE *,DP);

void savedpm(FILE *,DPM);

void savestring(FILE *,STRING);

void savemat(FILE *,MAT);

void savevect(FILE *,VECT);

Line 1799 void savegfsn(FILE *,GFSN);

Line 1834 void savegfsn(FILE *,GFSN);

void loaderror(FILE *,ERR *);

void loadui(FILE *,USINT *);

void loaddp(FILE *,DP *);

void loaddpm(FILE *,DPM *);

void loadstring(FILE *,STRING *);

void loadmat(FILE *,MAT *);

void loadvect(FILE *,VECT *);

Line 2619 void nd_det(int mod,MAT f,P *rp);

Line 2655 void nd_det(int mod,MAT f,P *rp);

void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int f4,struct order_spec *ord,LIST *rp);

void nd_gr_postproc(LIST f,LIST v,int m,struct order_spec *ord,int do_check,LIST *rp);

void nd_gr_recompute_trace(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,LIST *rp);

void nd_gr_trace(LIST f,LIST v,int trace,int homo,int f4,struct order_spec *ord,LIST *rp);

void nd_gr_trace(LIST f,LIST v,int trace,int homo,int retdp,int f4,struct order_spec *ord,LIST *rp);

void nd_nf_p(Obj f,LIST g,LIST v,int m,struct order_spec *ord,Obj *rp);

void obj_algtodalg(Obj obj,Obj *r);

void obj_dalgtoalg(Obj obj,Obj *r);

Line 2694 void lmtolf(LM f,Z *b);

Line 2730 void lmtolf(LM f,Z *b);

mp_limb_t get_lprime64(int index);

mp_limb_t **almat64(int,int);

mp_limb_t remqi64(Q n,mp_limb_t m);

int generic_gauss_elim64(MAT mat,MAT *nm,Z *dn,int **rindp,int **cindp);

int generic_gauss_elim_mod64(mp_limb_t **mat,int row,int col,mp_limb_t md,int *colstat);

#endif

#if defined(VISUAL) || defined(__MINGW32__)

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>