File: [local] / OpenXM_contrib2 / asir2018 / engine / init.c (download)
Revision 1.4, Mon Oct 1 05:49:06 2018 UTC (5 years, 8 months ago) by noro
Branch: MAIN
Changes since 1.3: +51 -1
lines
Added several functions for 64bit modular computation.
U64 -> mp_limb_t.
|
/*
* Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
* All rights reserved.
*
* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
* non-exclusive and royalty-free license to use, copy, modify and
* redistribute, solely for non-commercial and non-profit purposes, the
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
* conditions of this Agreement. For the avoidance of doubt, you acquire
* only a limited right to use the SOFTWARE hereunder, and FLL or any
* third party developer retains all rights, including but not limited to
* copyrights, in and to the SOFTWARE.
*
* (1) FLL does not grant you a license in any way for commercial
* purposes. You may use the SOFTWARE only for non-commercial and
* non-profit purposes only, such as academic, research and internal
* business use.
* (2) The SOFTWARE is protected by the Copyright Law of Japan and
* international copyright treaties. If you make copies of the SOFTWARE,
* with or without modification, as permitted hereunder, you shall affix
* to all such copies of the SOFTWARE the above copyright notice.
* (3) An explicit reference to this SOFTWARE and its copyright owner
* shall be made on your publication or presentation in any form of the
* results obtained by use of the SOFTWARE.
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by
* e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
* for such modification or the source code of the modified part of the
* SOFTWARE.
*
* THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
* MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
* EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
* FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
* RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
* MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
* UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
* OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
* DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
* ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
* FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
* DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
* SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
*
* $OpenXM: OpenXM_contrib2/asir2018/engine/init.c,v 1.4 2018/10/01 05:49:06 noro Exp $
*/
#include "ca.h"
#include "parse.h"
#include "version.h"
#include "prime.h"
struct oZ oUNIQ,oTWOQ,oTHREEQ,oFOURQ,oFIVEQ,oSIXQ,oSEVENQ,oEIGHTQ;
struct oLM oUNILM,oTHREELM,oFOURLM,oEIGHTLM;
struct oUP2 oONEUP2;
Z ONE = &oUNIQ;
Z TWO = &oTWOQ;
Z THREE = &oTHREEQ;
Z FOUR = &oFOURQ;
Z FIVE = &oFIVEQ;
Z SIX = &oSIXQ;
Z SEVEN = &oSEVENQ;
Z EIGHT = &oEIGHTQ;
LM ONELM = &oUNILM;
LM THREE_LM = &oTHREELM;
LM FOUR_LM = &oFOURLM;
LM EIGHT_LM = &oEIGHTLM;
struct oR oUNIR;
struct oMQ oUNIMQ;
struct oC oIU;
struct oUSINT oVOID;
MQ ONEM = &oUNIMQ;
UP2 ONEUP2 = &oONEUP2;
C IU = &oIU;
USINT VOIDobj = &oVOID;
int bigfloat;
int evalef = 0;
int nez = 1;
int current_mod = 0;
int StrassenSize = 0;
int outputstyle = 0;
int Itvplot = 33;
static int *lprime;
static int lprime_size;
#define ADDBF addbf
#define SUBBF subbf
#define MULBF mulbf
#define DIVBF divbf
#define PWRBF pwrbf
#define CHSGNBF chsgnbf
#define CMPBF cmpbf
#if defined(INTERVAL)
int zerorewrite = 0;
void (*addnumt[])() = { addq, addreal, addalg, ADDBF, 0, additvp, additvd, 0, additvf, addcplx, addmi, addlm, addgf2n, addgfpn, addgfs, addgfsn, adddalg };
void (*subnumt[])() = { subq, subreal, subalg, SUBBF, 0, subitvp, subitvd, 0, subitvf, subcplx, submi, sublm, subgf2n, subgfpn, subgfs, subgfsn, subdalg };
void (*mulnumt[])() = { mulq, mulreal, mulalg, MULBF, 0, mulitvp, mulitvd, 0, mulitvf, mulcplx, mulmi, mullm, mulgf2n, mulgfpn, mulgfs, mulgfsn, muldalg };
void (*divnumt[])() = { divq, divreal, divalg, DIVBF, 0, divitvp, divitvd, 0, divitvf, divcplx, divmi, divlm, divgf2n, divgfpn, divgfs, divgfsn, divdalg };
void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, PWRBF, 0, pwritvp, pwritvd, 0, pwritvf, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn, pwrgfs, pwrgfsn, pwrdalg };
void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, CHSGNBF, 0, chsgnitvp, chsgnitvd, 0, chsgnitvf, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn, chsgngfs , chsgngfsn, chsgndalg};
int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, CMPBF, 0, cmpitvp, cmpitvd, 0, cmpitvf, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn, cmpgfs, cmpgfsn, cmpdalg };
#else
void (*addnumt[])() = { addq, addreal, addalg, ADDBF, addcplx, addmi, addlm, addgf2n, addgfpn, addgfs, addgfsn, adddalg };
void (*subnumt[])() = { subq, subreal, subalg, SUBBF, subcplx, submi, sublm, subgf2n, subgfpn, subgfs, subgfsn, subdalg };
void (*mulnumt[])() = { mulq, mulreal, mulalg, MULBF, mulcplx, mulmi, mullm, mulgf2n, mulgfpn, mulgfs, mulgfsn, muldalg };
void (*divnumt[])() = { divq, divreal, divalg, DIVBF, divcplx, divmi, divlm, divgf2n, divgfpn, divgfs, divgfsn, divdalg };
void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, PWRBF, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn, pwrgfs, pwrgfsn, pwrdalg };
void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, CHSGNBF, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn, chsgngfs, chsgngfsn, chsgndalg };
int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, CMPBF, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn, cmpgfs, cmpgfsn, cmpdalg };
#endif
double get_current_time();
void init_lprime();
void nglob_init() {
oONEUP2.w = 1; oONEUP2.b[0] = 1;
STOZ0(1,&oUNIQ);
STOZ0(2,&oTWOQ);
STOZ0(3,&oTHREEQ);
STOZ0(4,&oFOURQ);
STOZ0(5,&oFIVEQ);
STOZ0(6,&oSIXQ);
STOZ0(7,&oSEVENQ);
STOZ0(8,&oEIGHTQ);
STOLM0(1,&oUNILM);
STOLM0(3,&oTHREELM);
STOLM0(4,&oFOURLM);
STOLM0(8,&oEIGHTLM);
OID(&oUNIR) = O_R; NM(&oUNIR) = (P)&oUNIQ; DN(&oUNIR) = (P)&oUNIQ; oUNIR.reduced = 1;
OID(&oUNIMQ) = O_N; NID(&oUNIMQ) = N_M; CONT(&oUNIMQ) = 1;
OID(&oIU) = O_N; NID(&oIU) = N_C; oIU.r = 0; oIU.i = (Num)ONE;
OID(&oVOID) = O_VOID;
/* moved to parse/main.c */
#if 0
#if defined(PARI)
risa_pari_init();
#endif
srandom((int)get_current_time());
#endif
init_up2_tab();
init_lprime();
init_gmpq();
}
double suspend_start;
double suspended_time=0;
void get_eg(struct oEGT *p)
{
p->exectime = get_clock()-suspended_time; p->gctime = 0;
}
void init_eg(struct oEGT *eg)
{
bzero((char *)eg,sizeof(struct oEGT));
}
void add_eg(struct oEGT *base,struct oEGT *start,struct oEGT *end)
{
base->exectime += end->exectime - start->exectime;
}
void print_eg(char *item,struct oEGT *eg)
{
printf("%s=(%.4g)",item,eg->exectime);
}
void print_split_eg(struct oEGT *start,struct oEGT *end)
{
struct oEGT base;
init_eg(&base); add_eg(&base,start,end);
printf("(%.4g)",base.exectime);
}
void print_split_e(struct oEGT *start,struct oEGT *end)
{
struct oEGT base;
init_eg(&base); add_eg(&base,start,end);
printf("(%.4g)",base.exectime);
}
void suspend_timer() {
suspend_start = get_clock();
}
void resume_timer() {
suspended_time += get_clock()-suspend_start;
}
extern int lm_lazy, up_lazy;
extern int GC_dont_gc;
extern int do_weyl;
extern int dp_fcoeffs;
void reset_engine() {
lm_lazy = 0;
up_lazy = 0;
do_weyl = 0;
dp_fcoeffs = 0;
GC_dont_gc = 0;
}
unsigned int get_asir_version() {
return ASIR_VERSION;
}
char *get_asir_distribution() {
return ASIR_DISTRIBUTION;
}
void create_error(ERR *err,unsigned int serial,char *msg,LIST trace)
{
int len;
USINT ui,notsupp;
NODE n,n1;
LIST list;
char *msg1;
STRING errmsg;
MKUSINT(ui,serial);
MKUSINT(notsupp,-1);
len = strlen(msg);
msg1 = (char *)MALLOC(len+1);
strcpy(msg1,msg);
MKSTR(errmsg,msg1);
if ( !trace )
MKLIST(trace,0);
n = mknode(4,ui,notsupp,errmsg,trace); MKLIST(list,n);
MKERR(*err,list);
}
static mp_limb_t *lprime64;
static int lprime64_size;
void init_lprime()
{
int s,i;
s = sizeof(lprime_init);
lprime = (int *)MALLOC_ATOMIC(s);
lprime_size = s/sizeof(int);
for ( i = 0; i < lprime_size; i++ )
lprime[i] = lprime_init[lprime_size-i-1];
#if SIZEOF_LONG == 8
s = sizeof(lprime64_init);
lprime64 = (mp_limb_t *)MALLOC_ATOMIC(s);
lprime64_size = s/sizeof(mp_limb_t);
for ( i = 0; i < lprime64_size; i++ )
lprime64[i] = lprime64_init[lprime64_size-i-1];
#endif
}
void create_new_lprimes(int);
void create_new_lprimes64(int);
int get_lprime(int index)
{
if ( index >= lprime_size )
create_new_lprimes(index);
return lprime[index];
}
#if SIZEOF_LONG == 8
mp_limb_t get_lprime64(int index)
{
if ( index >= lprime64_size )
create_new_lprimes64(index);
return lprime64[index];
}
#endif
void create_new_lprimes(int index)
{
int count,p,i,j,d;
if ( index < lprime_size )
return;
count = index-lprime_size+1;
if ( count < 256 )
count = 256;
lprime = (int *)GC_realloc(lprime,(lprime_size+count)*sizeof(int));
p = lprime[lprime_size-1]+2;
for ( i = 0; i < count; p += 2 ) {
for ( j = 0; (d = sprime[j]) != 0; j++ ) {
if ( d*d > p ) {
lprime[i+lprime_size] = p;
i++;
break;
}
if ( !(p%d) )
break;
}
}
lprime_size += count;
}
mp_limb_t nextprime(mp_limb_t a)
{
static FUNC f=0;
Z z,r;
if ( f == 0 ) mkparif("nextprime",&f);
STOZ(a,z);
r = (Z)evalparif(f,mknode(1,z));
return ZTOS(r);
}
void create_new_lprimes64(int index)
{
int count,j;
mp_limb_t p;
if ( index < lprime64_size )
return;
count = index-lprime64_size+1;
if ( count < 256 )
count = 256;
lprime64 = (mp_limb_t *)GC_realloc(lprime64,(lprime64_size+count)*sizeof(mp_limb_t));
for ( p = lprime64[lprime64_size-1], j = 0; j < count; j++ ) {
p = nextprime(p+1);
lprime64[lprime64_size+j] = p;
}
lprime64_size += count;
}