version 1.65, 2006/04/16 00:51:14 |
version 1.80, 2011/05/11 06:03:53 |
|
|
* 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.64 2006/03/16 10:08:21 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/include/ca.h,v 1.79 2009/06/01 07:31:54 noro Exp $ |
*/ |
*/ |
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
|
|
|
|
#if !defined(VISUAL) |
#if !defined(VISUAL) |
#include <unistd.h> |
#include <unistd.h> |
#endif |
|
|
|
#if !defined(VISUAL) |
|
#include <sys/param.h> |
#include <sys/param.h> |
#endif |
#endif |
|
|
Line 93 typedef void * pointer; |
|
Line 90 typedef void * pointer; |
|
#endif |
#endif |
#endif |
#endif |
|
|
|
#define TODO printf("%s: not implemented!\n", __func__) |
|
|
#define COPY(a,b) ((b)=(a)) |
#define COPY(a,b) ((b)=(a)) |
#define FREEN(p) |
#define FREEN(p) |
#define FREEQ(p) |
#define FREEQ(p) |
|
|
A_end=0,A_fnode,A_arf,A_int,A_str,A_internal,A_node,A_notimpl,A_func |
A_end=0,A_fnode,A_arf,A_int,A_str,A_internal,A_node,A_notimpl,A_func |
} farg_type; |
} 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 long long L; |
typedef unsigned long long UL; |
typedef unsigned long long UL; |
|
#elif defined(_MSC_VER) |
|
typedef _int64 L; |
|
typedef unsigned _int64 UL; |
#endif |
#endif |
#else |
|
typedef long L; |
|
typedef unsigned long UL; |
|
#endif |
|
|
|
typedef struct oN { |
typedef struct oN { |
int p; |
int p; |
Line 623 struct order_spec { |
|
Line 620 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 pot_nelim; /* size of positions for pot-elimination order */ |
union { |
union { |
int simple; |
int simple; |
struct { |
struct { |
Line 938 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 MKReal(a,b) (!(a)?((b)=0):(NEWReal(b),BDY(b)=(a),(b))) |
#define MKAlg(b,r) \ |
#define MKAlg(b,r) \ |
(!(b)?((r)=0):NUM(b)?((r)=(Alg)(b)):(NEWAlg(r),BDY(r)=(Obj)(b),(r))) |
(!(b)?((r)=0):NUM(b)?((r)=(Alg)(b)):(NEWAlg(r),BDY(r)=(Obj)(b),(r))) |
#define MKDAlg(dp,den,r) (NEWDAlg(r),(r)->nm = (dp),(r)->dn=(den)) |
#define MKDAlg(dp,den,r) (!(dp)?(void *)((r)=0):(void *)(NEWDAlg(r),(r)->nm = (dp),(r)->dn=(den))) |
|
|
#define IMM_MAX 1073741823 |
#define IMM_MAX 1073741823 |
#define IMM_MIN -1073741823 |
#define IMM_MIN -1073741823 |
Line 1319 void copyn(N,int,int *); |
|
Line 1318 void copyn(N,int,int *); |
|
void kmulnmain(N,N,N *); |
void kmulnmain(N,N,N *); |
int qcoefp(Obj); |
int qcoefp(Obj); |
int qcoefr(Obj); |
int qcoefr(Obj); |
long get_allocwords(void); |
size_t get_allocwords(void); |
double get_clock(void); |
double get_clock(void); |
void get_eg(struct oEGT *); |
void get_eg(struct oEGT *); |
void printtime(struct oEGT *,struct oEGT *,double); |
void printtime(struct oEGT *,struct oEGT *,double); |
Line 1424 LUM LUMALLOC(int, int); |
|
Line 1423 LUM LUMALLOC(int, int); |
|
BM BMALLOC(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_set_adj(int,int); |
|
void Risa_GC_get_adj(int *,int *); |
void *Risa_GC_malloc(size_t); |
void *Risa_GC_malloc(size_t); |
void *Risa_GC_malloc_atomic(size_t); |
void *Risa_GC_malloc_atomic(size_t); |
void *Risa_GC_realloc(void *,size_t); |
void *Risa_GC_realloc(void *,size_t); |