[BACK]Return to init.c CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2000 / engine

Diff for /OpenXM_contrib2/asir2000/engine/init.c between version 1.1.1.1 and 1.35

version 1.1.1.1, 1999/12/03 07:39:08 version 1.35, 2019/06/04 07:11:22
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/asir99/engine/init.c,v 1.1.1.1 1999/11/10 08:12:26 noro Exp $ */  /*
    * 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/asir2000/engine/init.c,v 1.34 2018/03/29 01:32:52 noro Exp $
   */
 #include "ca.h"  #include "ca.h"
   #include "parse.h"
 #include "version.h"  #include "version.h"
   #include "prime.h"
   
 struct oN oUNIN,oTWON,oTHREEN,oFOURN,oFIVEN,oSIXN,oSEVENN,oEIGHTN;  struct oN oUNIN,oTWON,oTHREEN,oFOURN,oFIVEN,oSIXN,oSEVENN,oEIGHTN;
 struct oQ oUNIQ,oTWOQ,oTHREEQ,oFOURQ,oFIVEQ,oSIXQ,oSEVENQ,oEIGHTQ;  struct oQ oUNIQ,oTWOQ,oTHREEQ,oFOURQ,oFIVEQ,oSIXQ,oSEVENQ,oEIGHTQ;
Line 32  C IU = &oIU;
Line 82  C IU = &oIU;
 USINT VOIDobj = &oVOID;  USINT VOIDobj = &oVOID;
   
 int bigfloat;  int bigfloat;
   int evalef = 0;
 int nez = 1;  int nez = 1;
 int current_mod = 0;  int current_mod = 0;
   int StrassenSize = 0;
   int outputstyle = 0;
   int Itvplot = 33;
   
 #if PARI  static int *lprime;
 #if defined(THINK_C)  static int lprime_size;
 int paristack = 1<<16;  
 #else  
 int paristack = 1<<20;  
 #endif  
   
 void (*addnumt[])() = { addq, addreal, addalg, addbf, addcplx, addmi, addlm, addgf2n, addgfpn };  #define ADDBF addbf
 void (*subnumt[])() = { subq, subreal, subalg, subbf, subcplx, submi, sublm, subgf2n, subgfpn };  #define SUBBF subbf
 void (*mulnumt[])() = { mulq, mulreal, mulalg, mulbf, mulcplx, mulmi, mullm, mulgf2n, mulgfpn };  #define MULBF mulbf
 void (*divnumt[])() = { divq, divreal, divalg, divbf, divcplx, divmi, divlm, divgf2n, divgfpn };  #define DIVBF divbf
 void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, pwrbf, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn };  #define PWRBF pwrbf
 void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, chsgnbf, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn };  #define CHSGNBF chsgnbf
 int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, cmpbf, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn };  #define CMPBF cmpbf
   
   #if defined(INTERVAL)
   int zerorewrite = 0;
   int zerorewriteCount = 0;
   //                      N_Q,  N_R,      N_A,    N_B, N4, N_IP,  N_IDouble,N_IQ, N_IBF, N_C,     N_M    N_LM, N_GF2N,   N_GFPN, N_GFS,  N_GFSN,  N_DA,   N_GZ, N_GQ, N_PARIB
   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  #else
 void (*addnumt[])() = { addq, addreal, addalg, 0, addcplx, addmi, addlm, addgf2n, addgfpn };  //                      N_Q,  N_R,      N_A,    N_B,   N_C,     N_M,   N_LM, N_GF2N,   N_GFPN, N_GFS,  N_GFSN,  N_DA,   N_GZ, N_GQ, N_PARIB
 void (*subnumt[])() = { subq, subreal, subalg, 0, subcplx, submi, sublm, subgf2n, subgfpn };  void (*addnumt[])() = { addq, addreal, addalg, ADDBF, addcplx, addmi, addlm, addgf2n, addgfpn, addgfs, addgfsn, adddalg };
 void (*mulnumt[])() = { mulq, mulreal, mulalg, 0, mulcplx, mulmi, mullm, mulgf2n, mulgfpn };  void (*subnumt[])() = { subq, subreal, subalg, SUBBF, subcplx, submi, sublm, subgf2n, subgfpn, subgfs, subgfsn, subdalg };
 void (*divnumt[])() = { divq, divreal, divalg, 0, divcplx, divmi, divlm, divgf2n,divgfpn };  void (*mulnumt[])() = { mulq, mulreal, mulalg, MULBF, mulcplx, mulmi, mullm, mulgf2n, mulgfpn, mulgfs, mulgfsn, muldalg };
 void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, 0, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn };  void (*divnumt[])() = { divq, divreal, divalg, DIVBF, divcplx, divmi, divlm, divgf2n, divgfpn, divgfs, divgfsn, divdalg };
 void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, 0, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn };  void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, PWRBF, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn, pwrgfs, pwrgfsn, pwrdalg };
 int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, 0, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn };  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  #endif
   
 double get_current_time();  double get_current_time();
   void init_lprime();
   
 void nglob_init() {  void nglob_init() {
         PL(&oUNIN) = 1; BD(&oUNIN)[0] = 1;    PL(&oUNIN) = 1; BD(&oUNIN)[0] = 1;
         PL(&oTWON) = 1; BD(&oTWON)[0] = 2;    PL(&oTWON) = 1; BD(&oTWON)[0] = 2;
         PL(&oTHREEN) = 1; BD(&oTHREEN)[0] = 3;    PL(&oTHREEN) = 1; BD(&oTHREEN)[0] = 3;
         PL(&oFOURN) = 1; BD(&oFOURN)[0] = 4;    PL(&oFOURN) = 1; BD(&oFOURN)[0] = 4;
         PL(&oFIVEN) = 1; BD(&oFIVEN)[0] = 5;    PL(&oFIVEN) = 1; BD(&oFIVEN)[0] = 5;
         PL(&oSIXN) = 1; BD(&oSIXN)[0] = 6;    PL(&oSIXN) = 1; BD(&oSIXN)[0] = 6;
         PL(&oSEVENN) = 1; BD(&oSEVENN)[0] = 7;    PL(&oSEVENN) = 1; BD(&oSEVENN)[0] = 7;
         PL(&oEIGHTN) = 1; BD(&oEIGHTN)[0] = 8;    PL(&oEIGHTN) = 1; BD(&oEIGHTN)[0] = 8;
   
         oONEUP2.w = 1; oONEUP2.b[0] = 1;    oONEUP2.w = 1; oONEUP2.b[0] = 1;
   
         OID(&oUNIQ) = O_N; NID(&oUNIQ) = N_Q;    OID(&oUNIQ) = O_N; NID(&oUNIQ) = N_Q;
         SGN(&oUNIQ) = 1; NM(&oUNIQ) = &oUNIN; DN(&oUNIQ) = 0;    SGN(&oUNIQ) = 1; NM(&oUNIQ) = &oUNIN; DN(&oUNIQ) = 0;
   
         OID(&oTWOQ) = O_N; NID(&oTWOQ) = N_Q;    OID(&oTWOQ) = O_N; NID(&oTWOQ) = N_Q;
         SGN(&oTWOQ) = 1; NM(&oTWOQ) = &oTWON; DN(&oTWOQ) = 0;    SGN(&oTWOQ) = 1; NM(&oTWOQ) = &oTWON; DN(&oTWOQ) = 0;
   
         OID(&oTHREEQ) = O_N; NID(&oTHREEQ) = N_Q;    OID(&oTHREEQ) = O_N; NID(&oTHREEQ) = N_Q;
         SGN(&oTHREEQ) = 1; NM(&oTHREEQ) = &oTHREEN; DN(&oTHREEQ) = 0;    SGN(&oTHREEQ) = 1; NM(&oTHREEQ) = &oTHREEN; DN(&oTHREEQ) = 0;
   
         OID(&oFOURQ) = O_N; NID(&oFOURQ) = N_Q;    OID(&oFOURQ) = O_N; NID(&oFOURQ) = N_Q;
         SGN(&oFOURQ) = 1; NM(&oFOURQ) = &oFOURN; DN(&oFOURQ) = 0;    SGN(&oFOURQ) = 1; NM(&oFOURQ) = &oFOURN; DN(&oFOURQ) = 0;
   
         OID(&oFIVEQ) = O_N; NID(&oFIVEQ) = N_Q;    OID(&oFIVEQ) = O_N; NID(&oFIVEQ) = N_Q;
         SGN(&oFIVEQ) = 1; NM(&oFIVEQ) = &oFIVEN; DN(&oFIVEQ) = 0;    SGN(&oFIVEQ) = 1; NM(&oFIVEQ) = &oFIVEN; DN(&oFIVEQ) = 0;
   
         OID(&oSIXQ) = O_N; NID(&oSIXQ) = N_Q;    OID(&oSIXQ) = O_N; NID(&oSIXQ) = N_Q;
         SGN(&oSIXQ) = 1; NM(&oSIXQ) = &oSIXN; DN(&oSIXQ) = 0;    SGN(&oSIXQ) = 1; NM(&oSIXQ) = &oSIXN; DN(&oSIXQ) = 0;
   
         OID(&oSEVENQ) = O_N; NID(&oSEVENQ) = N_Q;    OID(&oSEVENQ) = O_N; NID(&oSEVENQ) = N_Q;
         SGN(&oSEVENQ) = 1; NM(&oSEVENQ) = &oSEVENN; DN(&oSEVENQ) = 0;    SGN(&oSEVENQ) = 1; NM(&oSEVENQ) = &oSEVENN; DN(&oSEVENQ) = 0;
   
         OID(&oEIGHTQ) = O_N; NID(&oEIGHTQ) = N_Q;    OID(&oEIGHTQ) = O_N; NID(&oEIGHTQ) = N_Q;
         SGN(&oEIGHTQ) = 1; NM(&oEIGHTQ) = &oEIGHTN; DN(&oEIGHTQ) = 0;    SGN(&oEIGHTQ) = 1; NM(&oEIGHTQ) = &oEIGHTN; DN(&oEIGHTQ) = 0;
   
         OID(&oUNIR) = O_R; NM(&oUNIR) = (P)&oUNIQ; DN(&oUNIR) = (P)&oUNIQ; oUNIR.reduced = 1;    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(&oUNIMQ) = O_N; NID(&oUNIMQ) = N_M; CONT(&oUNIMQ) = 1;
         OID(&oUNILM) = O_N; NID(&oUNILM) = N_LM; BDY(&oUNILM) = ONEN;    OID(&oUNILM) = O_N; NID(&oUNILM) = N_LM; BDY(&oUNILM) = ONEN;
         OID(&oIU) = O_N; NID(&oIU) = N_C; oIU.r = 0; oIU.i = (Num)ONE;    OID(&oIU) = O_N; NID(&oIU) = N_C; oIU.r = 0; oIU.i = (Num)ONE;
   
         MKLM(&oTHREEN,THREE_LM);    MKLM(&oTHREEN,THREE_LM);
         MKLM(&oFOURN,FOUR_LM);    MKLM(&oFOURN,FOUR_LM);
         MKLM(&oEIGHTN,EIGHT_LM);    MKLM(&oEIGHTN,EIGHT_LM);
   
         OID(&oVOID) = O_VOID;    OID(&oVOID) = O_VOID;
   
 /* moved to parse/main.c */  /* moved to parse/main.c */
 #if 0  #if 0
 #if PARI  #if defined(PARI)
         risa_pari_init();    risa_pari_init();
 #endif  #endif
         srandom((int)get_current_time());    srandom((int)get_current_time());
 #endif  #endif
         init_up2_tab();    init_up2_tab();
   
     init_lprime();
     init_gmpq();
 }  }
   
 extern double gctime;  extern double GC_get_gctime();
 double suspend_start;  double suspend_start;
 double suspended_time=0;  double suspended_time=0;
   
 void get_eg(p)  void get_eg(struct oEGT *p)
 struct oEGT *p;  
 {  {
         p->exectime = get_clock() - gctime - suspended_time; p->gctime = gctime;    double gctime = GC_get_gctime();
     p->exectime = get_clock() - gctime - suspended_time; p->gctime = gctime;
 }  }
   
 void init_eg(eg)  void init_eg(struct oEGT *eg)
 struct oEGT *eg;  
 {  {
         bzero((char *)eg,sizeof(struct oEGT));    bzero((char *)eg,sizeof(struct oEGT));
 }  }
   
 void add_eg(base,start,end)  void add_eg(struct oEGT *base,struct oEGT *start,struct oEGT *end)
 struct oEGT *base,*start,*end;  
 {  {
         base->exectime += end->exectime - start->exectime;    base->exectime += end->exectime - start->exectime;
         base->gctime += end->gctime - start->gctime;    base->gctime += end->gctime - start->gctime;
 }  }
   
 void print_eg(item,eg)  void print_eg(char *item,struct oEGT *eg)
 char *item;  
 struct oEGT *eg;  
 {  {
         printf("%s=(%.4g,%.4g)",item,eg->exectime,eg->gctime);    printf("%s=(%.4g,%.4g)",item,eg->exectime,eg->gctime);
 }  }
   
 void print_split_eg(start,end)  void print_split_eg(struct oEGT *start,struct oEGT *end)
 struct oEGT *start,*end;  
 {  {
         struct oEGT base;    struct oEGT base;
   
         init_eg(&base); add_eg(&base,start,end);    init_eg(&base); add_eg(&base,start,end);
         printf("(%.4g,%.4g)",base.exectime,base.gctime);    printf("(%.4g,%.4g)",base.exectime,base.gctime);
 }  }
   
 void print_split_e(start,end)  void print_split_e(struct oEGT *start,struct oEGT *end)
 struct oEGT *start,*end;  
 {  {
         struct oEGT base;    struct oEGT base;
   
         init_eg(&base); add_eg(&base,start,end);    init_eg(&base); add_eg(&base,start,end);
         printf("(%.4g)",base.exectime);    printf("(%.4g)",base.exectime);
 }  }
   
 void suspend_timer() {  void suspend_timer() {
         suspend_start = get_clock();    suspend_start = get_clock();
 }  }
   
 void resume_timer() {  void resume_timer() {
         suspended_time += get_clock()-suspend_start;    suspended_time += get_clock()-suspend_start;
 }  }
   
 extern int lm_lazy, up_lazy;  extern int lm_lazy, up_lazy;
 extern GC_dont_gc;  extern int GC_dont_gc;
   extern int do_weyl;
   extern int dp_fcoeffs;
   
 void reset_engine() {  void reset_engine() {
         lm_lazy = 0; up_lazy = 0;    lm_lazy = 0;
         GC_dont_gc = 0;    up_lazy = 0;
     do_weyl = 0;
     dp_fcoeffs = 0;
     GC_dont_gc = 0;
 }  }
   
 unsigned int get_asir_version() {  unsigned int get_asir_version() {
         return 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);
   }
   
   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];
   }
   
   void create_new_lprimes(int);
   
   int get_lprime(index)
   {
     if ( index >= lprime_size )
       create_new_lprimes(index);
     return lprime[index];
   }
   
   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]; j++ ) {
         if ( d*d > p ) {
           lprime[i+lprime_size] = p;
           i++;
           break;
         }
         if ( !(p%d) )
           break;
       }
     }
     lprime_size += count;
 }  }
Legend:
Removed from v.1.1.1.1  
changed lines
  Added in v.1.35
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>