OpenXM_contrib2/asir2000/include/ca.h - diff

Return to ca.h CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / include

Diff for /OpenXM_contrib2/asir2000/include/ca.h between version 1.50 and 1.80

version 1.50, 2004/07/13 07:59:53

version 1.80, 2011/05/11 06:03:53

Line 45

* 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.49 2004/05/14 06:02:54 noro Exp $

* $OpenXM: OpenXM_contrib2/asir2000/include/ca.h,v 1.79 2009/06/01 07:31:54 noro Exp $

#include <stdio.h>

#include <stdlib.h>

Line 57

#if !defined(VISUAL)

#include <unistd.h>

#endif

#if !defined(VISUAL)

#include <sys/param.h>

#endif

Line 93 typedef void * pointer;

Line 90 typedef void * pointer;

#endif

#define TODO printf("%s: not implemented!\n", __func__)

#define COPY(a,b) ((b)=(a))

#define FREEN(p)

#define FREEQ(p)

Line 125 typedef void * pointer;

Line 124 typedef void * pointer;

#define O_DPV 22

#define O_QUOTEARG 23

#define O_VOID -1

/* IMAT */

#define O_IMAT 24

/* IMAT */

#define O_NBP 25

#define N_Q 0

#define N_R 1

Line 137 typedef void * pointer;

Line 140 typedef void * pointer;

#define N_GFPN 8

#define N_GFS 9

#define N_GFSN 10

#define N_DA 11

#define ORD_REVGRADLEX 0

#define ORD_GRADLEX 1

Line 146 typedef enum {

Line 150 typedef enum {

A_end=0,A_fnode,A_arf,A_int,A_str,A_internal,A_node,A_notimpl,A_func

} farg_type;

#if defined(LONG_IS_32BIT)

#if SIZEOF_LONG == 8

#if defined(VISUAL)

typedef long L;

typedef _int64 L;

typedef unsigned long UL;

typedef unsigned _int64 UL;

#elif defined(HAVE_UNSIGNED_LONG_LONG)

#else

typedef long long L;

typedef unsigned long long UL;

#elif defined(_MSC_VER)

typedef _int64 L;

typedef unsigned _int64 UL;

#endif

#else

typedef long L;

typedef unsigned long UL;

#endif

typedef struct oN {

int p;

unsigned int b[1];

} *N;

typedef struct oZ {

int p;

unsigned int b[1];

} *Z;

typedef struct oUP2 {

int w;

unsigned int b[1];

Line 246 typedef struct oGFPN {

Line 253 typedef struct oGFPN {

struct oUP *body;

} *GFPN;

typedef struct oDAlg {

short id;

char nid;

char pad;

struct oDP *nm;

struct oQ *dn;

} *DAlg;

typedef struct oNum {

short id;

char nid;

Line 308 typedef struct oGF2MAT {

Line 324 typedef struct oGF2MAT {

unsigned int **body;

} *GF2MAT, *GFMMAT;

/* IMAT */

#define IMATCH 64

typedef struct oIENT {

int cr;

int row, col;

pointer *body;

} IENT;

typedef struct oIMATC {

pointer *fore;

pointer *next;

IENT ient[IMATCH];

} *IMATC;

typedef struct oIMAT {

short id;

int row, col, clen;

pointer *root;

pointer *toor;

} *IMAT;

/* IMAT */

typedef struct oLIST {

short id;

short pad;

Line 404 typedef struct oTB {

Line 442 typedef struct oTB {

char **body;

} *TB;

typedef struct oNBP {

short id;

short pad;

struct oNODE *body;

} *NBP;

/* non-commutative bivariate monomial */

typedef struct oNBM {

int d;

P c;

unsigned int *b;

} *NBM;

#define NEWNBM(p) ((p)=(NBM)MALLOC(sizeof(struct oNBM)))

#define NEWNBMBDY(p,d) \

((p)->b=(unsigned int *)MALLOC((((d)+31)/32)*sizeof(unsigned int)))

#define NEWNBP(p) ((p)=(NBP)MALLOC(sizeof(struct oNBP)),OID(p)=O_NBP)

#define MKNBP(p,b) (NEWNBP(p),BDY(p)=(b))

#define NBM_GET(a,j) (((a)[(j)>>5]&(1<<((j)&31)))?1:0)

#define NBM_SET(a,j) ((a)[(j)>>5]|=(1<<((j)&31)))

#define NBM_CLR(a,j) ((a)[(j)>>5]&=(~(1<<((j)&31))))

typedef struct oObj {

short id;

short pad;

Line 558 struct order_spec {

Line 620 struct order_spec {

int id;

Obj obj;

int nv;

int ispot; /* 1 means Position over Term (Pos then Term) */

int pot_nelim; /* size of positions for pot-elimination order */

union {

int simple;

struct {

Line 583 struct modorder_spec {

Line 647 struct modorder_spec {

int *degree_shift;

};

typedef struct oNumberField {

int n;

int psn;

int dim;

VL vl;

P *defpoly;

DP *mb;

DP *ps;

struct oDAlg *one;

NODE ind;

struct order_spec *spec;

} *NumberField;

/* structure for cputime */

struct oEGT {

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

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

#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 NEWGFMMAT(l) ((l)=(GFMMAT)MALLOC(sizeof(struct oGF2MAT)),OID(l)=O_GFMMAT)

/* IMAT */

#define NEWIMAT(l) ((l)=(IMAT)MALLOC(sizeof(struct oIMAT)),OID(l)=O_IMAT,l->clen=0,l->root=0,l->toor=0)

#define NEWIENT(l) ((l)=(IMATC)MALLOC(sizeof(struct oIMATC)),l->fore=0,l->next=0)

/* IMAT */

#define NEWReal(q) ((q)=(Real)MALLOC_ATOMIC(sizeof(struct oReal)),OID(q)=O_N,NID(q)=N_R)

#define NEWAlg(r) ((r)=(Alg)MALLOC(sizeof(struct oAlg)),OID(r)=O_N,NID(r)=N_A)

#define NEWDAlg(r) ((r)=(DAlg)MALLOC(sizeof(struct oDAlg)),OID(r)=O_N,NID(r)=N_DA)

#define NEWBF(q,l) ((q)=(BF)MALLOC_ATOMIC(TRUESIZE(oBF,(l)-1,long)),OID(q)=O_N,NID(q)=N_B)

#define NEWC(r) ((r)=(C)MALLOC(sizeof(struct oC)),OID(r)=O_N,NID(r)=N_C)

#define NEWLM(r) ((r)=(LM)MALLOC(sizeof(struct oLM)),OID(r)=O_N,NID(r)=N_LM)

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

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

((d)=(DL)MALLOC_ATOMIC(TRUESIZE(oDL,(n)-1,int)))

#define MKP(v,dc,p) \

(!DEG(dc)?((p)=COEF(dc)):(NEWP(p),VR(p)=(v),DC(p)=(dc),(p)))

((!DEG(dc)&&!NEXT(dc))?((p)=COEF(dc)):(NEWP(p),VR(p)=(v),DC(p)=(dc),(p)))

#define MKV(v,p) \

(NEWP(p),VR(p)=(v),NEWDC(DC(p)),\

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

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

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

#define MKERR(e,b) (NEWERR(e),(e)->body=(Obj)(b))

#define MKMATHCAP(e,b) (NEWMATHCAP(e),(e)->body=(LIST)(b))

#define MKBYTEARRAY(m,l) \

(NEWBYTEARRAY(m),(m)->len=(l),(m)->body=(char *)MALLOC_ATOMIC((l)),bzero((m)->body,(l)))

(NEWBYTEARRAY(m),(m)->len=(l),(m)->body=(unsigned char *)MALLOC_ATOMIC((l)),bzero((m)->body,(l)))

#define MKQUOTE(q,b) (NEWQUOTE(q),(q)->body=(pointer)(b))

#define MKQUOTEARG(q,t,b) (NEWQUOTEARG(q),(q)->type=(t),(q)->body=(pointer)(b))

Line 855 PL(NM(q))=1,BD(NM(q))[0]=(unsigned int)(n),DN(q)=0,(q)

Line 937 PL(NM(q))=1,BD(NM(q))[0]=(unsigned int)(n),DN(q)=0,(q)

#define MKReal(a,b) (!(a)?((b)=0):(NEWReal(b),BDY(b)=(a),(b)))

#define MKAlg(b,r) \

(!(b)?((r)=0):NUM(b)?((r)=(Alg)(b)):(NEWAlg(r),BDY(r)=(Obj)(b),(r)))

#define MKDAlg(dp,den,r) (!(dp)?(void *)((r)=0):(void *)(NEWDAlg(r),(r)->nm = (dp),(r)->dn=(den)))

#define IMM_MAX 1073741823

#define IMM_MIN -1073741823

#define SL(n) ((n)->p)

#define ZALLOC(d) ((Z)MALLOC_ATOMIC(TRUESIZE(oZ,(d)-1,int)))

#if defined(PARI)

#define ToReal(a) (!(a)?(double)0.0:REAL(a)?BDY((Real)a):RATN(a)?RatnToReal((Q)a):BIGFLOAT(a)?rtodbl(BDY((BF)a)):0)

#else

Line 866 PL(NM(q))=1,BD(NM(q))[0]=(unsigned int)(n),DN(q)=0,(q)

Line 955 PL(NM(q))=1,BD(NM(q))[0]=(unsigned int)(n),DN(q)=0,(q)

#define NUM(p) (OID(p)==O_N)

#define RAT(p) (OID(p)==O_R)

#define RATN(a) (NID(a)==N_Q)

#define POLY(a) (!(a) ||(OID(a)<=O_P))

#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)

Line 958 extern const int sprime[];

Line 1048 extern const int sprime[];

extern int sprime[];

#endif

extern int lprime_size;

extern int *lprime;

extern void (*addnumt[])();

extern void (*subnumt[])();

extern void (*mulnumt[])();

Line 1231 void copyn(N,int,int *);

Line 1318 void copyn(N,int,int *);

void kmulnmain(N,N,N *);

int qcoefp(Obj);

int qcoefr(Obj);

int get_allocwords(void);

size_t get_allocwords(void);

double get_clock(void);

void get_eg(struct oEGT *);

void printtime(struct oEGT *,struct oEGT *,double);

Line 1336 LUM LUMALLOC(int, int);

Line 1423 LUM LUMALLOC(int, int);

BM BMALLOC(int, int);

Obj ToAlg(Num);

UM *berlemain(register int, UM, UM *);

void Risa_GC_set_adj(int,int);

void Risa_GC_get_adj(int *,int *);

void *Risa_GC_malloc(size_t);

void *Risa_GC_malloc_atomic(size_t);

void *Risa_GC_realloc(void *,size_t);

Line 1439 void chsgngfsn(GFSN,GFSN *);

Line 1528 void chsgngfsn(GFSN,GFSN *);

void pwrgfsn(GFSN,Q, GFSN *);

int cmpgfsn(GFSN,GFSN);

void adddalg(DAlg,DAlg,DAlg *);

void subdalg(DAlg,DAlg,DAlg *);

void muldalg(DAlg,DAlg,DAlg *);

void divdalg(DAlg,DAlg,DAlg *);

void chsgndalg(DAlg,DAlg *);

void pwrdalg(DAlg,Q, DAlg *);

int cmpdalg(DAlg,DAlg);

void addalg(Num,Num,Num *);

void addbf(Num,Num,Num *);

void addcplx(Num,Num,Num *);

Line 1760 void savep(FILE *,P);

Line 1857 void savep(FILE *,P);

void savegf2n(FILE *,GF2N);

void savegfpn(FILE *,GFPN);

void savegfs(FILE *,GFS);

void savedalg(FILE *,DAlg);

void savelm(FILE *,LM);

void savemi(FILE *,MQ);

void savecplx(FILE *,C);

Line 1785 void loadgf2n(FILE *,GF2N *);

Line 1883 void loadgf2n(FILE *,GF2N *);

void loadgfpn(FILE *,GFPN *);

void loadgfs(FILE *,GFS *);

void loadgfsn(FILE *,GFSN *);

void loaddalg(FILE *,DAlg *);

void loadlm(FILE *,LM *);

void loadmi(FILE *,MQ *);

void loadcplx(FILE *,C *);

Line 2375 void resume_timer() ;

Line 2474 void resume_timer() ;

void reset_engine() ;

unsigned int get_asir_version() ;

char *get_asir_distribution();

void create_error(ERR *err,unsigned int serial,char *msg);

void create_error(ERR *err,unsigned int serial,char *msg,LIST trace);

void init_lprime();

int get_lprime(int index);

void create_new_lprimes(int index);

Line 2487 int divtmp(VL vl,int mod,P p1,P p2,P *q);

Line 2586 int divtmp(VL vl,int mod,P p1,P p2,P *q);

int divtdcmp(VL vl,int mod,P p1,P p2,P *q);

void GC_gcollect();

/* IMAT */

void Pnewimat(NODE, IMAT *);

void PChsgnI(NODE, IMAT *);

void Pm2Im(NODE, IMAT *);

void PIm2m(NODE, MAT *);

void AddMatI(VL, IMAT, IMAT, IMAT *);

void MulMatI(VL, IMAT, IMAT, IMAT *);

void MulMatG(VL, Obj, Obj, Obj *);

void MulrMatI(VL, Obj, Obj, Obj *);

void MulMatS(VL, IMAT, IMAT, IMAT *);

void PutIent(IMAT, int, int, Obj);

void GetIent(IMAT, int, int, Obj);

void GetIbody(IMAT, int, int, Obj *);

void ChsgnI(IMAT, IMAT *c);

void AppendIent(IMAT, int, int, Obj);

void MEnt(int, int, int, Obj, IENT *);

void GetForeIent(IMATC *, IENT *, int *);

void GetNextIent(IMATC *, IENT *, int *);

void SubMatI(VL, IMAT, IMAT, IMAT *);

/* IMAT */

Z stoz(int c);

Z utoz(unsigned int c);

Z qtoz(Q n);

Q ztoq(Z n);

Z chsgnz(Z n);

Z simpz(Z n);

Z dupz(Z n);

Z absz(Z n);

Z addz(Z n1,Z n2);

Z subz(Z n1,Z n2);

Z mulz(Z n1,Z n2);

Z divsz(Z n1,Z n2);

Z divz(Z n1,Z n2,Z *rem);

Z gcdz(Z n1,Z n2);

Z gcdz_cofactor(Z n1,Z n2,Z *c1,Z *c2);

Z estimate_array_gcdz(Z *a,int n);

Z array_gcdz(Z *a,int n);

void mkwcz(int k,int l,Z *t);

int remzi(Z n,int m);

#if 0 && !defined(VISUAL)

void bzero(const void *,int);

void bcopy(const void *,void *,int);

char *index(char *,int);

#endif

void chsgnnbp(NBP p,NBP *rp);

void subnbp(VL vl,NBP p1,NBP p2, NBP *rp);

void addnbp(VL vl,NBP p1,NBP p2, NBP *rp);

void mulnbp(VL vl,NBP p1,NBP p2, NBP *rp);

void pwrnbp(VL vl,NBP p1,Q n, NBP *rp);

int compnbp(VL vl,NBP p1,NBP p2);

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