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

Annotation of OpenXM_contrib2/asir2000/parse/function.c, Revision 1.6

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.6     ! noro       48:  * $OpenXM: OpenXM_contrib2/asir2000/parse/function.c,v 1.5 2004/06/28 01:50:22 noro Exp $
1.2       noro       49: */
1.1       noro       50: #include "ca.h"
                     51: #include "parse.h"
1.6     ! noro       52:
        !            53: static int secure_mode;
        !            54:
        !            55: void setsecuremode(int value)
        !            56: {
        !            57:        secure_mode = value;
        !            58: }
        !            59:
        !            60: int getsecuremode()
        !            61: {
        !            62:        return secure_mode;
        !            63: }
        !            64:
        !            65: void setsecureflag(char *name)
        !            66: {
        !            67:        FUNC f;
        !            68:
        !            69:        searchf(noargsysf,name,&f);
        !            70:        if ( f ) {
        !            71:                f->secure = 1;
        !            72:        }
        !            73:        gen_searchf_searchonly(name,&f);
        !            74:        if ( f ) {
        !            75:                f->secure = 1;
        !            76:        }
        !            77: }
1.1       noro       78:
                     79: void appendbinf(flistp,name,func,argc)
                     80: NODE *flistp;
                     81: char *name;
                     82: void (*func)();
                     83: int argc;
                     84: {
                     85:        FUNC t;
                     86:        NODE n;
                     87:
                     88:        t = (FUNC)MALLOC(sizeof(struct oFUNC));
                     89:        t->name = name; t->id = A_BIN; t->argc = argc; t->f.binf = func;
1.4       noro       90:        t->fullname = name;
1.1       noro       91:        MKNODE(n,t,*flistp); *flistp = n;
                     92: }
                     93:
                     94: void appendparif(flistp,name,func,type)
                     95: NODE *flistp;
                     96: char *name;
                     97: int (*func)();
                     98: int type;
                     99: {
                    100:        FUNC t;
                    101:        NODE n;
                    102:
                    103:        t = (FUNC)MALLOC(sizeof(struct oFUNC));
                    104:        t->name = name; t->id = A_PARI; t->type = type; t->f.binf = (void (*)())func;
1.4       noro      105:        t->fullname = name;
1.1       noro      106:        MKNODE(n,t,*flistp); *flistp = n;
                    107: }
                    108:
                    109: void appendsysf(name,func,argc)
                    110: char *name;
                    111: void (*func)();
                    112: int argc;
                    113: {
                    114:        appendbinf(&sysf,name,func,argc);
                    115: }
                    116:
                    117: void appendubinf(name,func,argc)
                    118: char *name;
                    119: void (*func)();
                    120: int argc;
                    121: {
                    122:        appendbinf(&ubinf,name,func,argc);
                    123: }
                    124:
1.5       noro      125: int comp_dcp(DCP *a,DCP *b)
                    126: {
                    127:        int c;
                    128:
                    129:        c = arf_comp(CO,(Obj)(*a)->c,(Obj)(*b)->c);
                    130:        if ( c > 0 ) return 1;
                    131:        else if ( c < 0 ) return -1;
                    132:        else return 0;
                    133: }
                    134:
1.1       noro      135: void dcptolist(dc,listp)
                    136: DCP dc;
                    137: LIST *listp;
                    138: {
                    139:        NODE node,tnode,ln0,ln1;
                    140:        LIST l;
1.5       noro      141:        DCP *w,t;
                    142:        int i,n;
1.1       noro      143:
1.5       noro      144:        for ( n = 0, t = dc; t; t = NEXT(t), n++ );
                    145:        w = (DCP *)ALLOCA(n*sizeof(DCP));
                    146:        for ( i = 0, t = dc; i < n; t = NEXT(t), i++ )
                    147:                w[i] = t;
                    148:        qsort(w,n,sizeof(DCP),(int (*)(const void *,const void *))comp_dcp);
                    149:        for ( node = 0, i = 0; i < n; i++ ) {
1.1       noro      150:                NEXTNODE(node,tnode);
1.5       noro      151:                MKNODE(ln1,DEG(w[i]),0); MKNODE(ln0,COEF(w[i]),ln1);
1.1       noro      152:                MKLIST(l,ln0); BDY(tnode) = (pointer)l;
                    153:        }
                    154:        NEXT(tnode) = 0; MKLIST(l,node); *listp = l;
                    155: }

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