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.14 and 1.19

version 1.14, 2001/06/07 04:54:41

version 1.19, 2001/08/20 09:03:25

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.13 2001/04/20 02:34:22 noro Exp $

* $OpenXM: OpenXM_contrib2/asir2000/include/ca.h,v 1.18 2001/07/03 01:41:26 noro Exp $

#include <stdio.h>

Line 370 typedef struct oNODE {

struct oNODE *next;

} *NODE;

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

typedef struct oUM {

int d;

int c[1];

} *UM;

/* univariate poly with padic coeff */

typedef struct oLUM {

int d;

int *c[1];

} *LUM;

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

typedef struct oBM {

int d;

UM c[1];

} *BM;

typedef struct oML {

int n;

int mod;

Line 529 bzero((char *)(p),(int)(((n)+1)*sizeof(type))))

Line 538 bzero((char *)(p),(int)(((n)+1)*sizeof(type))))

(p) = ___q___;\

}

#define W_BMALLOC(dx,dy,p)\

BM ___q___;\

int ___i___;\

UM *___c___;\

(___q___) = (BM)ALLOCA(TRUESIZE(oBM,(dy),UM));\

DEG(___q___) = dy;\

___c___ = (UM *)COEF(___q___);\

for ( ___i___ = 0; ___i___ <= dy; ___i___++ ) {\

___c___[___i___] = W_UMALLOC(dx);\

clearum(___c___[___i___],dx);\

(p) = ___q___;\

}

#define NEWUP2(q,w)\

((q)=(UP2)MALLOC_ATOMIC(TRUESIZE(oUP2,(w)-1,unsigned int)),\

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

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

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

#define ITOS(p) (((unsigned int)(p))&0x7fffffff)

#define STOI(i) ((P)((unsigned int)(i)|0x80000000))

/* immediate GFS representation */

#define IFTOF(p) ((int)(((unsigned int)(p))&0x7fffffff))

#define FTOIF(i) ((int)(((unsigned int)(i)|0x80000000)))

struct cdl {

P c;

DL d;

Line 1090 int int_bits(int);

Line 1119 int int_bits(int);

LUM LUMALLOC(int, int);

BM BMALLOC(int, int);

Obj ToAlg(Num);

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

void *Risa_GC_malloc(size_t);

Line 1210 void addlm(LM,LM,LM *);

Line 1240 void addlm(LM,LM,LM *);

void addstr(VL,STRING,STRING,STRING *);

void addum(int,UM,UM,UM);

void addvect(VL,VECT,VECT,VECT *);

void addquote(VL,QUOTE,QUOTE,QUOTE *);

void adjc(VL,P,P,P,Q,P *,P *);

void afctr(VL,P,P,DCP *);

void afctrmain(VL,P,P,int,DCP *);

Line 1233 void chsgnreal(Num,Num *);

Line 1264 void chsgnreal(Num,Num *);

void chsgnmi(MQ,MQ *);

void chsgnlm(LM,LM *);

void chsgnvect(VECT,VECT *);

void chsgnquote(QUOTE,QUOTE *);

void clctv(VL,P,VL *);

void clctvr(VL,Obj,VL *);

void cm2p(Q,Q,P,P *);

Line 1274 void divsrdcp(VL,P,P,P *,P *);

Line 1306 void divsrdcp(VL,P,P,P *,P *);

void divsrmp(VL,int,P,P,P *,P *);

void divsrp(VL,P,P,P *,P *);

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

void divquote(VL,QUOTE,QUOTE,QUOTE *);

void dtest(P,ML,int,DCP *);

void dtestroot(int,int,P,LUM,struct oDUM *,DCP *);

void dtestroot1(int,int,P,LUM,P *);

Line 1369 void mulsgn(VN,VN,int,VN);

Line 1402 void mulsgn(VN,VN,int,VN);

void mulsum(register int,UM,register int,UM);

void mulum(register int,UM,UM,UM);

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

void mulquote(VL,QUOTE,QUOTE,QUOTE *);

void mulvectmat(VL,VECT,MAT,VECT *);

void next(VN);

void nezgcdnp_sqfr_primitive(VL,P,P *,int,P *);

Line 1414 void pwrnum(VL,Num,Num,Num *);

Line 1448 void pwrnum(VL,Num,Num,Num *);

void pwrp(VL,P,Q,P *);

void pwrq(Q,Q,Q *);

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

void pwrquote(VL,QUOTE,QUOTE,QUOTE *);

void pwrreal(Num,Num,Real *);

void pwrmi(MQ,Q,MQ *);

void pwrlm(LM,Q,LM *);

Line 1472 void substp(VL,P,V,P,P *);

Line 1507 void substp(VL,P,V,P,P *);

void substvp(VL,P,VN,P *);

void subum(int,UM,UM,UM);

void subvect(VL,VECT,VECT,VECT *);

void subquote(VL,QUOTE,QUOTE,QUOTE *);

void toreim(Num,Num *,Num *);

void ucsump(P,Q *);

void udivpwm(Q,P,P,P *,P *);

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