version 1.13, 2001/04/20 02:34:22 |
version 1.17, 2001/06/25 04:11:43 |
|
|
* 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.12 2001/03/13 01:10:26 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/include/ca.h,v 1.16 2001/06/25 01:35:22 noro Exp $ |
*/ |
*/ |
#include <stdio.h> |
#include <stdio.h> |
|
|
Line 370 typedef struct oNODE { |
|
Line 370 typedef struct oNODE { |
|
struct oNODE *next; |
struct oNODE *next; |
} *NODE; |
} *NODE; |
|
|
|
/* univariate poly over small finite field; dense */ |
typedef struct oUM { |
typedef struct oUM { |
int d; |
int d; |
int c[1]; |
int c[1]; |
} *UM; |
} *UM; |
|
|
|
/* univariate poly with padic coeff */ |
typedef struct oLUM { |
typedef struct oLUM { |
int d; |
int d; |
int *c[1]; |
int *c[1]; |
} *LUM; |
} *LUM; |
|
|
|
/* bivariate poly over small finite field; dense */ |
|
|
|
typedef struct oBM { |
|
int d; |
|
UM c[1]; |
|
} *BM; |
|
|
typedef struct oML { |
typedef struct oML { |
int n; |
int n; |
int mod; |
int mod; |
Line 529 bzero((char *)(p),(int)(((n)+1)*sizeof(type)))) |
|
Line 538 bzero((char *)(p),(int)(((n)+1)*sizeof(type)))) |
|
(p) = ___q___;\ |
(p) = ___q___;\ |
} |
} |
|
|
|
#define W_BMALLOC(n,bound,p)\ |
|
{\ |
|
BM ___q___;\ |
|
int ___i___;\ |
|
UM *___c___;\ |
|
(___q___) = (BM)ALLOCA(TRUESIZE(oBM,(bound),UM));\ |
|
DEG(___q___) = bound;\ |
|
___c___ = (UM *)COEF(___q___);\ |
|
for ( ___i___ = 0; ___i___ < bound; ___i___++ ) {\ |
|
___c___[___i___] = W_UMALLOC(n);\ |
|
clearum(___c___[___i___],n);\ |
|
}\ |
|
(p) = ___q___;\ |
|
} |
|
|
#define NEWUP2(q,w)\ |
#define NEWUP2(q,w)\ |
((q)=(UP2)MALLOC_ATOMIC(TRUESIZE(oUP2,(w)-1,unsigned int)),\ |
((q)=(UP2)MALLOC_ATOMIC(TRUESIZE(oUP2,(w)-1,unsigned int)),\ |
bzero((char *)(q)->b,(w)*sizeof(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 ITOS(p) (((unsigned int)(p))&0x7fffffff) |
#define STOI(i) ((P)((unsigned int)(i)|0x80000000)) |
#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 { |
struct cdl { |
P c; |
P c; |
DL d; |
DL d; |
Line 734 extern UP2 ONEUP2; |
|
Line 763 extern UP2 ONEUP2; |
|
extern FILE *asir_out; |
extern FILE *asir_out; |
#if defined(__GNUC__) |
#if defined(__GNUC__) |
extern const int sprime[]; |
extern const int sprime[]; |
extern const int lprime[]; |
|
#else |
#else |
extern int sprime[]; |
extern int sprime[]; |
extern int lprime[]; |
|
#endif |
#endif |
|
|
|
extern int lprime_size; |
|
extern int *lprime; |
|
|
extern void (*addnumt[])(); |
extern void (*addnumt[])(); |
extern void (*subnumt[])(); |
extern void (*subnumt[])(); |
extern void (*mulnumt[])(); |
extern void (*mulnumt[])(); |
Line 1089 int int_bits(int); |
|
Line 1119 int int_bits(int); |
|
|
|
|
|
LUM LUMALLOC(int, int); |
LUM LUMALLOC(int, int); |
|
BM BMALLOC(int, int); |
Obj ToAlg(Num); |
Obj ToAlg(Num); |
UM *berlemain(register int, UM, UM *); |
UM *berlemain(register int, UM, UM *); |
void *Risa_GC_malloc(size_t); |
void *Risa_GC_malloc(size_t); |