[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 and 1.19

version 1.1, 1999/12/03 07:39:08 version 1.19, 2003/02/14 22:29:09
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.18 2002/03/01 00:40:51 noro Exp $
   */
 #include "ca.h"  #include "ca.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 34  USINT VOIDobj = &oVOID;
Line 83  USINT VOIDobj = &oVOID;
 int bigfloat;  int bigfloat;
 int nez = 1;  int nez = 1;
 int current_mod = 0;  int current_mod = 0;
   int StrassenSize = 0;
   
 #if PARI  static int *lprime;
 #if defined(THINK_C)  int lprime_size;
   
   #if defined(PARI)
 int paristack = 1<<16;  int paristack = 1<<16;
 #else  #define ADDBF addbf
 int paristack = 1<<20;  #define SUBBF subbf
   #define MULBF mulbf
   #define DIVBF divbf
   #define PWRBF pwrbf
   #define CHSGNBF chsgnbf
   #define CMPBF cmpbf
   # else
   #define ADDBF 0
   #define SUBBF 0
   #define MULBF 0
   #define DIVBF 0
   #define PWRBF 0
   #define CHSGNBF 0
   #define CMPBF 0
 #endif  #endif
   
 void (*addnumt[])() = { addq, addreal, addalg, addbf, addcplx, addmi, addlm, addgf2n, addgfpn };  #if defined(INTERVAL)
 void (*subnumt[])() = { subq, subreal, subalg, subbf, subcplx, submi, sublm, subgf2n, subgfpn };  int zerorewrite = 0;
 void (*mulnumt[])() = { mulq, mulreal, mulalg, mulbf, mulcplx, mulmi, mullm, mulgf2n, mulgfpn };  void (*addnumt[])() = { addq, addreal, addalg, ADDBF, 0, additvp, additvd, 0, additvf, addcplx, addmi, addlm, addgf2n, addgfpn, addgfs, addgfsn };
 void (*divnumt[])() = { divq, divreal, divalg, divbf, divcplx, divmi, divlm, divgf2n, divgfpn };  void (*subnumt[])() = { subq, subreal, subalg, SUBBF, 0, subitvp, subitvd, 0, subitvf, subcplx, submi, sublm, subgf2n, subgfpn, subgfs, subgfsn };
 void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, pwrbf, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn };  void (*mulnumt[])() = { mulq, mulreal, mulalg, MULBF, 0, mulitvp, mulitvd, 0, mulitvf, mulcplx, mulmi, mullm, mulgf2n, mulgfpn, mulgfs, mulgfsn };
 void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, chsgnbf, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn };  void (*divnumt[])() = { divq, divreal, divalg, DIVBF, 0, divitvp, divitvd, 0, divitvf, divcplx, divmi, divlm, divgf2n, divgfpn, divgfs, divgfsn };
 int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, cmpbf, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn };  void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, PWRBF, 0, pwritvp, pwritvd, 0, pwritvf, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn, pwrgfs, pwrgfsn };
   void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, CHSGNBF, 0, chsgnitvp, chsgnitvd, 0, chsgnitvf, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn, chsgngfs , chsgngfsn};
   int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, CMPBF, 0, cmpitvp, cmpitvd, 0, cmpitvf, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn, cmpgfs, cmpgfsn };
 #else  #else
 void (*addnumt[])() = { addq, addreal, addalg, 0, addcplx, addmi, addlm, addgf2n, addgfpn };  void (*addnumt[])() = { addq, addreal, addalg, ADDBF, addcplx, addmi, addlm, addgf2n, addgfpn, addgfs, addgfsn };
 void (*subnumt[])() = { subq, subreal, subalg, 0, subcplx, submi, sublm, subgf2n, subgfpn };  void (*subnumt[])() = { subq, subreal, subalg, SUBBF, subcplx, submi, sublm, subgf2n, subgfpn, subgfs, subgfsn };
 void (*mulnumt[])() = { mulq, mulreal, mulalg, 0, mulcplx, mulmi, mullm, mulgf2n, mulgfpn };  void (*mulnumt[])() = { mulq, mulreal, mulalg, MULBF, mulcplx, mulmi, mullm, mulgf2n, mulgfpn, mulgfs, mulgfsn };
 void (*divnumt[])() = { divq, divreal, divalg, 0, divcplx, divmi, divlm, divgf2n,divgfpn };  void (*divnumt[])() = { divq, divreal, divalg, DIVBF, divcplx, divmi, divlm, divgf2n, divgfpn, divgfs, divgfsn };
 void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, 0, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn };  void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, PWRBF, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn, pwrgfs, pwrgfsn };
 void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, 0, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn };  void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, CHSGNBF, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn, chsgngfs, chsgngfsn };
 int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, 0, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn };  int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, CMPBF, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn, cmpgfs, cmpgfsn };
 #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;
Line 110  void nglob_init() {
Line 178  void nglob_init() {
   
 /* 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();
 }  }
   
 extern double gctime;  extern double 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;          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;
   
Line 157  struct oEGT *start,*end;
Line 221  struct oEGT *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;
   
Line 175  void resume_timer() {
Line 238  void resume_timer() {
 }  }
   
 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;
           up_lazy = 0;
           do_weyl = 0;
           dp_fcoeffs = 0;
         GC_dont_gc = 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)
   {
           int len;
           USINT ui;
           NODE n,n1;
           LIST list;
           char *msg1;
           STRING errmsg;
   
           MKUSINT(ui,serial);
           len = strlen(msg);
           msg1 = (char *)MALLOC(len+1);
           strcpy(msg1,msg);
           MKSTR(errmsg,msg1);
           MKNODE(n1,errmsg,0); MKNODE(n,ui,n1); MKLIST(list,n);
           MKERR(*err,list);
   }
   
   void init_lprime()
   {
           int s,i;
   
           s = sizeof(lprime_init);
           lprime = (int *)GC_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  
changed lines
  Added in v.1.19
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>