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

Annotation of OpenXM_contrib2/asir2000/engine/init.c, Revision 1.16

1.2       noro        1: /*
                      2:  * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
                      3:  * All rights reserved.
                      4:  *
                      5:  * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
                      6:  * non-exclusive and royalty-free license to use, copy, modify and
                      7:  * redistribute, solely for non-commercial and non-profit purposes, the
                      8:  * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
                      9:  * conditions of this Agreement. For the avoidance of doubt, you acquire
                     10:  * only a limited right to use the SOFTWARE hereunder, and FLL or any
                     11:  * third party developer retains all rights, including but not limited to
                     12:  * copyrights, in and to the SOFTWARE.
                     13:  *
                     14:  * (1) FLL does not grant you a license in any way for commercial
                     15:  * purposes. You may use the SOFTWARE only for non-commercial and
                     16:  * non-profit purposes only, such as academic, research and internal
                     17:  * business use.
                     18:  * (2) The SOFTWARE is protected by the Copyright Law of Japan and
                     19:  * international copyright treaties. If you make copies of the SOFTWARE,
                     20:  * with or without modification, as permitted hereunder, you shall affix
                     21:  * to all such copies of the SOFTWARE the above copyright notice.
                     22:  * (3) An explicit reference to this SOFTWARE and its copyright owner
                     23:  * shall be made on your publication or presentation in any form of the
                     24:  * results obtained by use of the SOFTWARE.
                     25:  * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
1.3       noro       26:  * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.2       noro       27:  * for such modification or the source code of the modified part of the
                     28:  * SOFTWARE.
                     29:  *
                     30:  * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
                     31:  * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
                     32:  * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
                     33:  * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
                     34:  * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
                     35:  * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
                     36:  * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
                     37:  * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
                     38:  * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
                     39:  * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
                     40:  * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
                     41:  * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
                     42:  * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
                     43:  * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
                     44:  * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
                     45:  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
                     46:  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
                     47:  *
1.16    ! saito      48:  * $OpenXM: OpenXM_contrib2/asir2000/engine/init.c,v 1.15 2002/01/04 17:08:22 saito Exp $
1.2       noro       49: */
1.1       noro       50: #include "ca.h"
                     51: #include "version.h"
1.11      noro       52: #include "prime.h"
1.1       noro       53:
                     54: struct oN oUNIN,oTWON,oTHREEN,oFOURN,oFIVEN,oSIXN,oSEVENN,oEIGHTN;
                     55: struct oQ oUNIQ,oTWOQ,oTHREEQ,oFOURQ,oFIVEQ,oSIXQ,oSEVENQ,oEIGHTQ;
                     56:
                     57: struct oUP2 oONEUP2;
                     58:
                     59: N ONEN = &oUNIN;
                     60: Q ONE = &oUNIQ;
                     61: Q TWO = &oTWOQ;
                     62: Q THREE = &oTHREEQ;
                     63: Q FOUR = &oFOURQ;
                     64: Q FIVE = &oFIVEQ;
                     65: Q SIX = &oSIXQ;
                     66: Q SEVEN = &oSEVENQ;
                     67: Q EIGHT = &oEIGHTQ;
                     68:
                     69: LM THREE_LM,FOUR_LM,EIGHT_LM;
                     70:
                     71: struct oR oUNIR;
                     72: struct oMQ oUNIMQ;
                     73: struct oLM oUNILM;
                     74: struct oC oIU;
                     75: struct oUSINT oVOID;
                     76:
                     77: MQ ONEM = &oUNIMQ;
                     78: LM ONELM = &oUNILM;
                     79: UP2 ONEUP2 = &oONEUP2;
                     80: C IU = &oIU;
                     81: USINT VOIDobj = &oVOID;
                     82:
                     83: int bigfloat;
                     84: int nez = 1;
                     85: int current_mod = 0;
1.16    ! saito      86: int StrassenSize = 4;
1.1       noro       87:
1.11      noro       88: static int *lprime;
                     89: int lprime_size;
                     90:
1.1       noro       91: #if PARI
                     92: int paristack = 1<<16;
1.10      noro       93: #define ADDBF addbf
                     94: #define SUBBF subbf
                     95: #define MULBF mulbf
                     96: #define DIVBF divbf
                     97: #define PWRBF pwrbf
                     98: #define CHSGNBF chsgnbf
                     99: #define CMPBF cmpbf
                    100: # else
                    101: #define ADDBF 0
                    102: #define SUBBF 0
                    103: #define MULBF 0
                    104: #define DIVBF 0
                    105: #define PWRBF 0
                    106: #define CHSGNBF 0
                    107: #define CMPBF 0
                    108: #endif
1.1       noro      109:
1.7       saito     110: #if defined(INTERVAL)
                    111: int zerorewrite = 0;
1.12      noro      112: void (*addnumt[])() = { addq, addreal, addalg, ADDBF, additvp, additvd, 0, additvf, addcplx, addmi, addlm, addgf2n, addgfpn, addgfs, addgfsn };
1.14      saito     113: void (*subnumt[])() = { subq, subreal, subalg, SUBBF, subitvp, subitvd, 0, subitvf, subcplx, submi, sublm, subgf2n, subgfpn, subgfs, subgfsn };
1.12      noro      114: void (*mulnumt[])() = { mulq, mulreal, mulalg, MULBF, mulitvp, mulitvd, 0, mulitvf, mulcplx, mulmi, mullm, mulgf2n, mulgfpn, mulgfs, mulgfsn };
                    115: void (*divnumt[])() = { divq, divreal, divalg, DIVBF, divitvp, divitvd, 0, divitvf, divcplx, divmi, divlm, divgf2n, divgfpn, divgfs, divgfsn };
                    116: void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, PWRBF, pwritvp, pwritvd, 0, pwritvf, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn, pwrgfs, pwrgfsn };
                    117: void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, CHSGNBF, chsgnitvp, chsgnitvd, 0, chsgnitvf, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn, chsgngfs , chsgngfsn};
                    118: int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, CMPBF, cmpitvp, cmpitvd, 0, cmpitvf, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn, cmpgfs, cmpgfsn };
1.7       saito     119: #else
1.12      noro      120: void (*addnumt[])() = { addq, addreal, addalg, ADDBF, addcplx, addmi, addlm, addgf2n, addgfpn, addgfs, addgfsn };
                    121: void (*subnumt[])() = { subq, subreal, subalg, SUBBF, subcplx, submi, sublm, subgf2n, subgfpn, subgfs, subgfsn };
                    122: void (*mulnumt[])() = { mulq, mulreal, mulalg, MULBF, mulcplx, mulmi, mullm, mulgf2n, mulgfpn, mulgfs, mulgfsn };
                    123: void (*divnumt[])() = { divq, divreal, divalg, DIVBF, divcplx, divmi, divlm, divgf2n, divgfpn, divgfs, divgfsn };
                    124: void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, PWRBF, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn, pwrgfs, pwrgfsn };
                    125: void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, CHSGNBF, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn, chsgngfs, chsgngfsn };
                    126: int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, CMPBF, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn, cmpgfs, cmpgfsn };
1.1       noro      127: #endif
                    128:
                    129: double get_current_time();
1.11      noro      130: void init_lprime();
1.1       noro      131:
                    132: void nglob_init() {
                    133:        PL(&oUNIN) = 1; BD(&oUNIN)[0] = 1;
                    134:        PL(&oTWON) = 1; BD(&oTWON)[0] = 2;
                    135:        PL(&oTHREEN) = 1; BD(&oTHREEN)[0] = 3;
                    136:        PL(&oFOURN) = 1; BD(&oFOURN)[0] = 4;
                    137:        PL(&oFIVEN) = 1; BD(&oFIVEN)[0] = 5;
                    138:        PL(&oSIXN) = 1; BD(&oSIXN)[0] = 6;
                    139:        PL(&oSEVENN) = 1; BD(&oSEVENN)[0] = 7;
                    140:        PL(&oEIGHTN) = 1; BD(&oEIGHTN)[0] = 8;
                    141:
                    142:        oONEUP2.w = 1; oONEUP2.b[0] = 1;
                    143:
                    144:        OID(&oUNIQ) = O_N; NID(&oUNIQ) = N_Q;
                    145:        SGN(&oUNIQ) = 1; NM(&oUNIQ) = &oUNIN; DN(&oUNIQ) = 0;
                    146:
                    147:        OID(&oTWOQ) = O_N; NID(&oTWOQ) = N_Q;
                    148:        SGN(&oTWOQ) = 1; NM(&oTWOQ) = &oTWON; DN(&oTWOQ) = 0;
                    149:
                    150:        OID(&oTHREEQ) = O_N; NID(&oTHREEQ) = N_Q;
                    151:        SGN(&oTHREEQ) = 1; NM(&oTHREEQ) = &oTHREEN; DN(&oTHREEQ) = 0;
                    152:
                    153:        OID(&oFOURQ) = O_N; NID(&oFOURQ) = N_Q;
                    154:        SGN(&oFOURQ) = 1; NM(&oFOURQ) = &oFOURN; DN(&oFOURQ) = 0;
                    155:
                    156:        OID(&oFIVEQ) = O_N; NID(&oFIVEQ) = N_Q;
                    157:        SGN(&oFIVEQ) = 1; NM(&oFIVEQ) = &oFIVEN; DN(&oFIVEQ) = 0;
                    158:
                    159:        OID(&oSIXQ) = O_N; NID(&oSIXQ) = N_Q;
                    160:        SGN(&oSIXQ) = 1; NM(&oSIXQ) = &oSIXN; DN(&oSIXQ) = 0;
                    161:
                    162:        OID(&oSEVENQ) = O_N; NID(&oSEVENQ) = N_Q;
                    163:        SGN(&oSEVENQ) = 1; NM(&oSEVENQ) = &oSEVENN; DN(&oSEVENQ) = 0;
                    164:
                    165:        OID(&oEIGHTQ) = O_N; NID(&oEIGHTQ) = N_Q;
                    166:        SGN(&oEIGHTQ) = 1; NM(&oEIGHTQ) = &oEIGHTN; DN(&oEIGHTQ) = 0;
                    167:
                    168:        OID(&oUNIR) = O_R; NM(&oUNIR) = (P)&oUNIQ; DN(&oUNIR) = (P)&oUNIQ; oUNIR.reduced = 1;
                    169:        OID(&oUNIMQ) = O_N; NID(&oUNIMQ) = N_M; CONT(&oUNIMQ) = 1;
                    170:        OID(&oUNILM) = O_N; NID(&oUNILM) = N_LM; BDY(&oUNILM) = ONEN;
                    171:        OID(&oIU) = O_N; NID(&oIU) = N_C; oIU.r = 0; oIU.i = (Num)ONE;
                    172:
                    173:        MKLM(&oTHREEN,THREE_LM);
                    174:        MKLM(&oFOURN,FOUR_LM);
                    175:        MKLM(&oEIGHTN,EIGHT_LM);
                    176:
                    177:        OID(&oVOID) = O_VOID;
                    178:
                    179: /* moved to parse/main.c */
                    180: #if 0
                    181: #if PARI
                    182:        risa_pari_init();
                    183: #endif
                    184:        srandom((int)get_current_time());
                    185: #endif
                    186:        init_up2_tab();
1.11      noro      187:
                    188:        init_lprime();
1.1       noro      189: }
                    190:
                    191: extern double gctime;
                    192: double suspend_start;
                    193: double suspended_time=0;
                    194:
1.13      noro      195: void get_eg(struct oEGT *p)
1.1       noro      196: {
                    197:        p->exectime = get_clock() - gctime - suspended_time; p->gctime = gctime;
                    198: }
                    199:
1.13      noro      200: void init_eg(struct oEGT *eg)
1.1       noro      201: {
                    202:        bzero((char *)eg,sizeof(struct oEGT));
                    203: }
                    204:
1.13      noro      205: void add_eg(struct oEGT *base,struct oEGT *start,struct oEGT *end)
1.1       noro      206: {
                    207:        base->exectime += end->exectime - start->exectime;
                    208:        base->gctime += end->gctime - start->gctime;
                    209: }
                    210:
1.13      noro      211: void print_eg(char *item,struct oEGT *eg)
1.1       noro      212: {
                    213:        printf("%s=(%.4g,%.4g)",item,eg->exectime,eg->gctime);
                    214: }
                    215:
1.13      noro      216: void print_split_eg(struct oEGT *start,struct oEGT *end)
1.1       noro      217: {
                    218:        struct oEGT base;
                    219:
                    220:        init_eg(&base); add_eg(&base,start,end);
                    221:        printf("(%.4g,%.4g)",base.exectime,base.gctime);
                    222: }
                    223:
1.13      noro      224: void print_split_e(struct oEGT *start,struct oEGT *end)
1.1       noro      225: {
                    226:        struct oEGT base;
                    227:
                    228:        init_eg(&base); add_eg(&base,start,end);
                    229:        printf("(%.4g)",base.exectime);
                    230: }
                    231:
                    232: void suspend_timer() {
                    233:        suspend_start = get_clock();
                    234: }
                    235:
                    236: void resume_timer() {
                    237:        suspended_time += get_clock()-suspend_start;
                    238: }
                    239:
                    240: extern int lm_lazy, up_lazy;
1.6       noro      241: extern int GC_dont_gc;
                    242: extern int do_weyl;
1.8       noro      243: extern int dp_fcoeffs;
1.1       noro      244:
                    245: void reset_engine() {
1.8       noro      246:        lm_lazy = 0;
                    247:        up_lazy = 0;
1.6       noro      248:        do_weyl = 0;
1.8       noro      249:        dp_fcoeffs = 0;
1.1       noro      250:        GC_dont_gc = 0;
                    251: }
                    252:
                    253: unsigned int get_asir_version() {
                    254:        return ASIR_VERSION;
1.4       noro      255: }
1.9       noro      256:
                    257: char *get_asir_distribution() {
                    258:        return ASIR_DISTRIBUTION;
                    259: }
                    260:
1.4       noro      261:
                    262: void create_error(ERR *err,unsigned int serial,char *msg)
                    263: {
                    264:        int len;
                    265:        USINT ui;
                    266:        NODE n,n1;
                    267:        LIST list;
                    268:        char *msg1;
                    269:        STRING errmsg;
                    270:
                    271:        MKUSINT(ui,serial);
                    272:        len = strlen(msg);
                    273:        msg1 = (char *)MALLOC(len+1);
                    274:        strcpy(msg1,msg);
                    275:        MKSTR(errmsg,msg1);
                    276:        MKNODE(n1,errmsg,0); MKNODE(n,ui,n1); MKLIST(list,n);
                    277:        MKERR(*err,list);
1.11      noro      278: }
                    279:
                    280: void init_lprime()
                    281: {
                    282:        int s,i;
                    283:
                    284:        s = sizeof(lprime_init);
                    285:        lprime = (int *)GC_malloc_atomic(s);
                    286:        lprime_size = s/sizeof(int);
                    287:        for ( i = 0; i < lprime_size; i++ )
                    288:                lprime[i] = lprime_init[lprime_size-i-1];
                    289: }
                    290:
                    291: void create_new_lprimes(int);
                    292:
                    293: int get_lprime(index)
                    294: {
                    295:        if ( index >= lprime_size )
                    296:                create_new_lprimes(index);
                    297:        return lprime[index];
                    298: }
                    299:
1.13      noro      300: void create_new_lprimes(int index)
1.11      noro      301: {
                    302:        int count,p,i,j,d;
                    303:
                    304:        if ( index < lprime_size )
                    305:                return;
                    306:        count = index-lprime_size+1;
                    307:        if ( count < 256 )
                    308:                count = 256;
                    309:        lprime = (int *)GC_realloc(lprime,(lprime_size+count)*sizeof(int));
                    310:        p = lprime[lprime_size-1]+2;
                    311:        for ( i = 0; i < count; p += 2 ) {
                    312:                for ( j = 0; d = sprime[j]; j++ ) {
                    313:                        if ( d*d > p ) {
                    314:                                lprime[i+lprime_size] = p;
                    315:                                i++;
                    316:                                break;
                    317:                        }
                    318:                        if ( !(p%d) )
                    319:                                break;
                    320:                }
                    321:        }
                    322:        lprime_size += count;
1.1       noro      323: }

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>