| version 1.12, 2002/09/04 04:57:46 |
version 1.17, 2011/08/10 04:51:57 |
|
|
| * 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/builtin/parif.c,v 1.11 2002/07/12 08:05:23 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/parif.c,v 1.16 2009/03/27 14:42:29 ohara Exp $ |
| */ |
*/ |
| #include "ca.h" |
#include "ca.h" |
| #include "parse.h" |
#include "parse.h" |
| |
|
| #if PARI |
#if defined(PARI) |
| #include "genpari.h" |
#include "genpari.h" |
| |
// PARI_VERSION(2,2,8) == 131592 |
| |
#if PARI_VERSION_CODE >= 131592 |
| |
#define mppgcd(a,b) (gcdii((a),(b))) |
| |
#endif |
| |
|
| extern long prec; |
long get_pariprec(); |
| |
void set_pariprec(long p); |
| |
|
| void patori(GEN,Obj *); |
void patori(GEN,Obj *); |
| void patori_i(GEN,N *); |
void patori_i(GEN,N *); |
| Line 78 struct ftab pari_tab[] = { |
|
| Line 83 struct ftab pari_tab[] = { |
|
| {0,0,0}, |
{0,0,0}, |
| }; |
}; |
| |
|
| #define MKPREC(a,i,b) (argc(a)==(i)?mkprec(QTOS((Q)(b))):prec) |
#define MKPREC(a,i,b) (argc(a)==(i)?mkprec(QTOS((Q)(b))):get_pariprec()) |
| |
|
| #define CALLPARI1(f,a,p,r)\ |
#define CALLPARI1(f,a,p,r)\ |
| ritopa((Obj)a,&_pt1_); _pt2_ = f(_pt1_,p); patori(_pt2_,r); asir_cgiv(_pt2_); asir_cgiv(_pt1_) |
ritopa((Obj)a,&_pt1_); _pt2_ = f(_pt1_,p); patori(_pt2_,r); asir_cgiv(_pt2_); asir_cgiv(_pt1_) |
| Line 95 void f(ar,rp) NODE ar; Obj *rp;\ |
|
| Line 100 void f(ar,rp) NODE ar; Obj *rp;\ |
|
| { GEN _pt1_,_pt2_,_pt3_; CALLPARI2(pf,ARG0(ar),ARG1(ar),MKPREC(ar,3,ARG2(ar)),rp); } |
{ GEN _pt1_,_pt2_,_pt3_; CALLPARI2(pf,ARG0(ar),ARG1(ar),MKPREC(ar,3,ARG2(ar)),rp); } |
| |
|
| #if defined(INTERVAL) |
#if defined(INTERVAL) |
| #define PREC_CONV pariK1 |
#define PREC_CONV (0.103810253/(BYTES_IN_LONG/4)) /* log(10)/(SL*log(2)) */ |
| #else |
#elif SIZEOF_LONG == 4 |
| #if defined(LONG_IS_32BIT) |
|
| #define PREC_CONV 0.103810253 |
#define PREC_CONV 0.103810253 |
| #endif |
#elif SIZEOF_LONG == 8 |
| #if defined(LONG_IS_64BIT) |
|
| #define PREC_CONV 0.051905126 |
#define PREC_CONV 0.051905126 |
| #endif |
#endif |
| #endif |
|
| |
|
| /* XXX : we should be more careful when we free PARI pointers. */ |
/* XXX : we should be more careful when we free PARI pointers. */ |
| |
|
|
|
| { |
{ |
| int p; |
int p; |
| Q q; |
Q q; |
| |
long prec = get_pariprec(); |
| |
|
| #if defined(INTERVAL) || 1 |
#if defined(INTERVAL) || 1 |
| p = (int)((prec-2)/PREC_CONV); STOQ(p,q); *rp = (Obj)q; |
p = (int)((prec-2)/PREC_CONV); STOQ(p,q); *rp = (Obj)q; |
|
|
| prec = mkprec(QTOS((Q)ARG0(arg))); |
prec = mkprec(QTOS((Q)ARG0(arg))); |
| } |
} |
| #endif |
#endif |
| |
set_pariprec(prec); |
| } |
} |
| |
|
| #if defined(INTERVAL) || 1 |
#if defined(INTERVAL) || 1 |
|
|
| { |
{ |
| int p; |
int p; |
| Q q; |
Q q; |
| |
long prec = get_pariprec(); |
| |
|
| p = (int)((prec-2)); STOQ(p,q); *rp = (Obj)q; |
p = (int)((prec-2)); STOQ(p,q); *rp = (Obj)q; |
| if ( arg ) { |
if ( arg ) { |
|
|
| prec = p + 2; |
prec = p + 2; |
| } |
} |
| } |
} |
| |
set_pariprec(prec); |
| } |
} |
| #endif |
#endif |
| |
|
| Line 386 struct pariftab pariftab[] = { |
|
| Line 392 struct pariftab pariftab[] = { |
|
| {"indsort",indexsort,1}, |
{"indsort",indexsort,1}, |
| {"initalg",initalg,1}, |
{"initalg",initalg,1}, |
| {"isfund",gisfundamental,1}, |
{"isfund",gisfundamental,1}, |
| {"isprime",gisprime,1}, |
{"isprime",gisprime,2}, |
| {"ispsp",gispsp,1}, |
{"ispsp",gispsp,1}, |
| {"isqrt",racine,1}, |
{"isqrt",racine,1}, |
| {"issqfree",gissquarefree,1}, |
{"issqfree",gissquarefree,1}, |
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to parif.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / builtin