[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.30

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.30    ! ohara      48:  * $OpenXM: OpenXM_contrib2/asir2000/engine/init.c,v 1.29 2012/12/17 07:20:44 noro Exp $
1.2       noro       49: */
1.1       noro       50: #include "ca.h"
1.30    ! ohara      51: #include "parse.h"
1.1       noro       52: #include "version.h"
1.11      noro       53: #include "prime.h"
1.1       noro       54:
                     55: struct oN oUNIN,oTWON,oTHREEN,oFOURN,oFIVEN,oSIXN,oSEVENN,oEIGHTN;
                     56: struct oQ oUNIQ,oTWOQ,oTHREEQ,oFOURQ,oFIVEQ,oSIXQ,oSEVENQ,oEIGHTQ;
                     57:
                     58: struct oUP2 oONEUP2;
                     59:
                     60: N ONEN = &oUNIN;
                     61: Q ONE = &oUNIQ;
                     62: Q TWO = &oTWOQ;
                     63: Q THREE = &oTHREEQ;
                     64: Q FOUR = &oFOURQ;
                     65: Q FIVE = &oFIVEQ;
                     66: Q SIX = &oSIXQ;
                     67: Q SEVEN = &oSEVENQ;
                     68: Q EIGHT = &oEIGHTQ;
                     69:
                     70: LM THREE_LM,FOUR_LM,EIGHT_LM;
                     71:
                     72: struct oR oUNIR;
                     73: struct oMQ oUNIMQ;
                     74: struct oLM oUNILM;
                     75: struct oC oIU;
                     76: struct oUSINT oVOID;
                     77:
                     78: MQ ONEM = &oUNIMQ;
                     79: LM ONELM = &oUNILM;
                     80: UP2 ONEUP2 = &oONEUP2;
                     81: C IU = &oIU;
                     82: USINT VOIDobj = &oVOID;
                     83:
                     84: int bigfloat;
                     85: int nez = 1;
                     86: int current_mod = 0;
1.18      noro       87: int StrassenSize = 0;
1.21      saito      88: int outputstyle = 0;
1.27      saito      89: int Itvplot = 33;
1.1       noro       90:
1.11      noro       91: static int *lprime;
1.23      ohara      92: static int lprime_size;
1.11      noro       93:
1.19      ohara      94: #if defined(PARI)
1.1       noro       95: int paristack = 1<<16;
1.10      noro       96: #define ADDBF addbf
                     97: #define SUBBF subbf
                     98: #define MULBF mulbf
                     99: #define DIVBF divbf
                    100: #define PWRBF pwrbf
                    101: #define CHSGNBF chsgnbf
                    102: #define CMPBF cmpbf
                    103: # else
                    104: #define ADDBF 0
                    105: #define SUBBF 0
                    106: #define MULBF 0
                    107: #define DIVBF 0
                    108: #define PWRBF 0
                    109: #define CHSGNBF 0
                    110: #define CMPBF 0
                    111: #endif
1.1       noro      112:
1.7       saito     113: #if defined(INTERVAL)
                    114: int zerorewrite = 0;
1.22      noro      115: void (*addnumt[])() = { addq, addreal, addalg, ADDBF, 0, additvp, additvd, 0, additvf, addcplx, addmi, addlm, addgf2n, addgfpn, addgfs, addgfsn, adddalg };
                    116: void (*subnumt[])() = { subq, subreal, subalg, SUBBF, 0, subitvp, subitvd, 0, subitvf, subcplx, submi, sublm, subgf2n, subgfpn, subgfs, subgfsn, subdalg };
                    117: void (*mulnumt[])() = { mulq, mulreal, mulalg, MULBF, 0, mulitvp, mulitvd, 0, mulitvf, mulcplx, mulmi, mullm, mulgf2n, mulgfpn, mulgfs, mulgfsn, muldalg };
                    118: void (*divnumt[])() = { divq, divreal, divalg, DIVBF, 0, divitvp, divitvd, 0, divitvf, divcplx, divmi, divlm, divgf2n, divgfpn, divgfs, divgfsn, divdalg };
                    119: void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, PWRBF, 0, pwritvp, pwritvd, 0, pwritvf, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn, pwrgfs, pwrgfsn, pwrdalg };
                    120: void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, CHSGNBF, 0, chsgnitvp, chsgnitvd, 0, chsgnitvf, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn, chsgngfs , chsgngfsn, chsgndalg};
                    121: int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, CMPBF, 0, cmpitvp, cmpitvd, 0, cmpitvf, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn, cmpgfs, cmpgfsn, cmpdalg };
1.7       saito     122: #else
1.22      noro      123: void (*addnumt[])() = { addq, addreal, addalg, ADDBF, addcplx, addmi, addlm, addgf2n, addgfpn, addgfs, addgfsn, adddalg };
                    124: void (*subnumt[])() = { subq, subreal, subalg, SUBBF, subcplx, submi, sublm, subgf2n, subgfpn, subgfs, subgfsn, subdalg };
                    125: void (*mulnumt[])() = { mulq, mulreal, mulalg, MULBF, mulcplx, mulmi, mullm, mulgf2n, mulgfpn, mulgfs, mulgfsn, muldalg };
                    126: void (*divnumt[])() = { divq, divreal, divalg, DIVBF, divcplx, divmi, divlm, divgf2n, divgfpn, divgfs, divgfsn, divdalg };
                    127: void (*pwrnumt[])() = { pwrq, pwrreal, pwralg, PWRBF, pwrcplx, pwrmi, pwrlm, pwrgf2n, pwrgfpn, pwrgfs, pwrgfsn, pwrdalg };
                    128: void (*chsgnnumt[])() = { chsgnq, chsgnreal, chsgnalg, CHSGNBF, chsgncplx, chsgnmi, chsgnlm, chsgngf2n, chsgngfpn, chsgngfs, chsgngfsn, chsgndalg };
                    129: int (*cmpnumt[])() = { cmpq, cmpreal, cmpalg, CMPBF, cmpcplx, cmpmi, cmplm, cmpgf2n, cmpgfpn, cmpgfs, cmpgfsn, cmpdalg };
1.1       noro      130: #endif
                    131:
                    132: double get_current_time();
1.11      noro      133: void init_lprime();
1.1       noro      134:
                    135: void nglob_init() {
                    136:        PL(&oUNIN) = 1; BD(&oUNIN)[0] = 1;
                    137:        PL(&oTWON) = 1; BD(&oTWON)[0] = 2;
                    138:        PL(&oTHREEN) = 1; BD(&oTHREEN)[0] = 3;
                    139:        PL(&oFOURN) = 1; BD(&oFOURN)[0] = 4;
                    140:        PL(&oFIVEN) = 1; BD(&oFIVEN)[0] = 5;
                    141:        PL(&oSIXN) = 1; BD(&oSIXN)[0] = 6;
                    142:        PL(&oSEVENN) = 1; BD(&oSEVENN)[0] = 7;
                    143:        PL(&oEIGHTN) = 1; BD(&oEIGHTN)[0] = 8;
                    144:
                    145:        oONEUP2.w = 1; oONEUP2.b[0] = 1;
                    146:
                    147:        OID(&oUNIQ) = O_N; NID(&oUNIQ) = N_Q;
                    148:        SGN(&oUNIQ) = 1; NM(&oUNIQ) = &oUNIN; DN(&oUNIQ) = 0;
                    149:
                    150:        OID(&oTWOQ) = O_N; NID(&oTWOQ) = N_Q;
                    151:        SGN(&oTWOQ) = 1; NM(&oTWOQ) = &oTWON; DN(&oTWOQ) = 0;
                    152:
                    153:        OID(&oTHREEQ) = O_N; NID(&oTHREEQ) = N_Q;
                    154:        SGN(&oTHREEQ) = 1; NM(&oTHREEQ) = &oTHREEN; DN(&oTHREEQ) = 0;
                    155:
                    156:        OID(&oFOURQ) = O_N; NID(&oFOURQ) = N_Q;
                    157:        SGN(&oFOURQ) = 1; NM(&oFOURQ) = &oFOURN; DN(&oFOURQ) = 0;
                    158:
                    159:        OID(&oFIVEQ) = O_N; NID(&oFIVEQ) = N_Q;
                    160:        SGN(&oFIVEQ) = 1; NM(&oFIVEQ) = &oFIVEN; DN(&oFIVEQ) = 0;
                    161:
                    162:        OID(&oSIXQ) = O_N; NID(&oSIXQ) = N_Q;
                    163:        SGN(&oSIXQ) = 1; NM(&oSIXQ) = &oSIXN; DN(&oSIXQ) = 0;
                    164:
                    165:        OID(&oSEVENQ) = O_N; NID(&oSEVENQ) = N_Q;
                    166:        SGN(&oSEVENQ) = 1; NM(&oSEVENQ) = &oSEVENN; DN(&oSEVENQ) = 0;
                    167:
                    168:        OID(&oEIGHTQ) = O_N; NID(&oEIGHTQ) = N_Q;
                    169:        SGN(&oEIGHTQ) = 1; NM(&oEIGHTQ) = &oEIGHTN; DN(&oEIGHTQ) = 0;
                    170:
                    171:        OID(&oUNIR) = O_R; NM(&oUNIR) = (P)&oUNIQ; DN(&oUNIR) = (P)&oUNIQ; oUNIR.reduced = 1;
                    172:        OID(&oUNIMQ) = O_N; NID(&oUNIMQ) = N_M; CONT(&oUNIMQ) = 1;
                    173:        OID(&oUNILM) = O_N; NID(&oUNILM) = N_LM; BDY(&oUNILM) = ONEN;
                    174:        OID(&oIU) = O_N; NID(&oIU) = N_C; oIU.r = 0; oIU.i = (Num)ONE;
                    175:
                    176:        MKLM(&oTHREEN,THREE_LM);
                    177:        MKLM(&oFOURN,FOUR_LM);
                    178:        MKLM(&oEIGHTN,EIGHT_LM);
                    179:
                    180:        OID(&oVOID) = O_VOID;
                    181:
                    182: /* moved to parse/main.c */
                    183: #if 0
1.19      ohara     184: #if defined(PARI)
1.1       noro      185:        risa_pari_init();
                    186: #endif
                    187:        srandom((int)get_current_time());
                    188: #endif
                    189:        init_up2_tab();
1.11      noro      190:
                    191:        init_lprime();
1.1       noro      192: }
                    193:
1.28      ohara     194: extern double GC_get_gctime();
1.1       noro      195: double suspend_start;
                    196: double suspended_time=0;
                    197:
1.13      noro      198: void get_eg(struct oEGT *p)
1.1       noro      199: {
1.28      ohara     200:        double gctime = GC_get_gctime();
1.1       noro      201:        p->exectime = get_clock() - gctime - suspended_time; p->gctime = gctime;
                    202: }
                    203:
1.13      noro      204: void init_eg(struct oEGT *eg)
1.1       noro      205: {
                    206:        bzero((char *)eg,sizeof(struct oEGT));
                    207: }
                    208:
1.13      noro      209: void add_eg(struct oEGT *base,struct oEGT *start,struct oEGT *end)
1.1       noro      210: {
                    211:        base->exectime += end->exectime - start->exectime;
                    212:        base->gctime += end->gctime - start->gctime;
                    213: }
                    214:
1.13      noro      215: void print_eg(char *item,struct oEGT *eg)
1.1       noro      216: {
                    217:        printf("%s=(%.4g,%.4g)",item,eg->exectime,eg->gctime);
                    218: }
                    219:
1.13      noro      220: void print_split_eg(struct oEGT *start,struct oEGT *end)
1.1       noro      221: {
                    222:        struct oEGT base;
                    223:
                    224:        init_eg(&base); add_eg(&base,start,end);
                    225:        printf("(%.4g,%.4g)",base.exectime,base.gctime);
                    226: }
                    227:
1.13      noro      228: void print_split_e(struct oEGT *start,struct oEGT *end)
1.1       noro      229: {
                    230:        struct oEGT base;
                    231:
                    232:        init_eg(&base); add_eg(&base,start,end);
                    233:        printf("(%.4g)",base.exectime);
                    234: }
                    235:
                    236: void suspend_timer() {
                    237:        suspend_start = get_clock();
                    238: }
                    239:
                    240: void resume_timer() {
                    241:        suspended_time += get_clock()-suspend_start;
                    242: }
                    243:
                    244: extern int lm_lazy, up_lazy;
1.6       noro      245: extern int GC_dont_gc;
                    246: extern int do_weyl;
1.8       noro      247: extern int dp_fcoeffs;
1.1       noro      248:
                    249: void reset_engine() {
1.8       noro      250:        lm_lazy = 0;
                    251:        up_lazy = 0;
1.6       noro      252:        do_weyl = 0;
1.8       noro      253:        dp_fcoeffs = 0;
1.1       noro      254:        GC_dont_gc = 0;
                    255: }
                    256:
                    257: unsigned int get_asir_version() {
                    258:        return ASIR_VERSION;
1.4       noro      259: }
1.9       noro      260:
                    261: char *get_asir_distribution() {
                    262:        return ASIR_DISTRIBUTION;
                    263: }
                    264:
1.4       noro      265:
1.24      noro      266: void create_error(ERR *err,unsigned int serial,char *msg,LIST trace)
1.4       noro      267: {
                    268:        int len;
1.25      noro      269:        USINT ui,notsupp;
1.4       noro      270:        NODE n,n1;
                    271:        LIST list;
                    272:        char *msg1;
                    273:        STRING errmsg;
                    274:
                    275:        MKUSINT(ui,serial);
1.25      noro      276:        MKUSINT(notsupp,-1);
1.4       noro      277:        len = strlen(msg);
                    278:        msg1 = (char *)MALLOC(len+1);
                    279:        strcpy(msg1,msg);
                    280:        MKSTR(errmsg,msg1);
1.25      noro      281:        if ( !trace )
                    282:                MKLIST(trace,0);
1.26      noro      283:        n = mknode(4,ui,notsupp,errmsg,trace); MKLIST(list,n);
1.4       noro      284:        MKERR(*err,list);
1.11      noro      285: }
                    286:
                    287: void init_lprime()
                    288: {
                    289:        int s,i;
                    290:
                    291:        s = sizeof(lprime_init);
1.29      noro      292:        lprime = (int *)MALLOC_ATOMIC(s);
1.11      noro      293:        lprime_size = s/sizeof(int);
                    294:        for ( i = 0; i < lprime_size; i++ )
                    295:                lprime[i] = lprime_init[lprime_size-i-1];
                    296: }
                    297:
                    298: void create_new_lprimes(int);
                    299:
                    300: int get_lprime(index)
                    301: {
                    302:        if ( index >= lprime_size )
                    303:                create_new_lprimes(index);
                    304:        return lprime[index];
                    305: }
                    306:
1.13      noro      307: void create_new_lprimes(int index)
1.11      noro      308: {
                    309:        int count,p,i,j,d;
                    310:
                    311:        if ( index < lprime_size )
                    312:                return;
                    313:        count = index-lprime_size+1;
                    314:        if ( count < 256 )
                    315:                count = 256;
                    316:        lprime = (int *)GC_realloc(lprime,(lprime_size+count)*sizeof(int));
                    317:        p = lprime[lprime_size-1]+2;
                    318:        for ( i = 0; i < count; p += 2 ) {
                    319:                for ( j = 0; d = sprime[j]; j++ ) {
                    320:                        if ( d*d > p ) {
                    321:                                lprime[i+lprime_size] = p;
                    322:                                i++;
                    323:                                break;
                    324:                        }
                    325:                        if ( !(p%d) )
                    326:                                break;
                    327:                }
                    328:        }
                    329:        lprime_size += count;
1.1       noro      330: }

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