Return to function.c CVS log

Up to [local] / OpenXM_contrib2 / asir2018 / parse

Annotation of OpenXM_contrib2/asir2018/parse/function.c, Revision 1.1

1.1     ! 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
        !            26:  * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
        !            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:  *
        !            48:  * $OpenXM$
        !            49: */
        !            50: #include "ca.h"
        !            51: #include "parse.h"
        !            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: int setsecureflag(char *name,int value)
        !            66: {
        !            67:   FUNC f;
        !            68:
        !            69:   searchf(noargsysf,name,&f);
        !            70:   if ( f ) {
        !            71:     f->secure = value;
        !            72:     return 0;
        !            73:   }
        !            74:   gen_searchf_searchonly(name,&f,0);
        !            75:   if ( f ) {
        !            76:     f->secure = value;
        !            77:     return 0;
        !            78:   }
        !            79:   return -1;
        !            80: }
        !            81:
        !            82: void appendbinf(flistp,name,func,argc,quote)
        !            83: NODE *flistp;
        !            84: char *name;
        !            85: void (*func)();
        !            86: int argc;
        !            87: unsigned int quote;
        !            88: {
        !            89:   FUNC t;
        !            90:   NODE n;
        !            91:
        !            92:   t = (FUNC)MALLOC(sizeof(struct oFUNC));
        !            93:   t->name = name; t->id = A_BIN; t->argc = argc; t->f.binf = func;
        !            94:   t->fullname = name; t->quote = quote;
        !            95:   MKNODE(n,t,*flistp); *flistp = n;
        !            96: }
        !            97:
        !            98: void appendparif(flistp,name,func,type)
        !            99: NODE *flistp;
        !           100: char *name;
        !           101: int (*func)();
        !           102: int type;
        !           103: {
        !           104:   FUNC t;
        !           105:   NODE n;
        !           106:
        !           107:   t = (FUNC)MALLOC(sizeof(struct oFUNC));
        !           108:   t->name = name; t->id = A_PARI; t->type = type; t->f.binf = (void (*)())func;
        !           109:   t->fullname = name;
        !           110:   MKNODE(n,t,*flistp); *flistp = n;
        !           111: }
        !           112:
        !           113: void appendsysf(name,func,argc,quote)
        !           114: char *name;
        !           115: void (*func)();
        !           116: int argc;
        !           117: unsigned int quote;
        !           118: {
        !           119:   appendbinf(&sysf,name,func,argc,quote);
        !           120: }
        !           121:
        !           122: void appendubinf(name,func,argc,quote)
        !           123: char *name;
        !           124: void (*func)();
        !           125: int argc;
        !           126: unsigned int quote;
        !           127: {
        !           128:   appendbinf(&ubinf,name,func,argc,quote);
        !           129: }
        !           130:
        !           131: int comp_dcp(DCP *a,DCP *b)
        !           132: {
        !           133:   int c;
        !           134:
        !           135:   c = arf_comp(CO,(Obj)(*a)->c,(Obj)(*b)->c);
        !           136:   if ( c > 0 ) return 1;
        !           137:   else if ( c < 0 ) return -1;
        !           138:   else return 0;
        !           139: }
        !           140:
        !           141: void dcptolist(dc,listp)
        !           142: DCP dc;
        !           143: LIST *listp;
        !           144: {
        !           145:   NODE node,tnode,ln0,ln1;
        !           146:   LIST l;
        !           147:   DCP *w,t;
        !           148:   int i,n;
        !           149:
        !           150:   for ( n = 0, t = dc; t; t = NEXT(t), n++ );
        !           151:   w = (DCP *)ALLOCA(n*sizeof(DCP));
        !           152:   for ( i = 0, t = dc; i < n; t = NEXT(t), i++ )
        !           153:     w[i] = t;
        !           154:   qsort(w,n,sizeof(DCP),(int (*)(const void *,const void *))comp_dcp);
        !           155:   for ( node = 0, i = 0; i < n; i++ ) {
        !           156:     NEXTNODE(node,tnode);
        !           157:     MKNODE(ln1,DEG(w[i]),0); MKNODE(ln0,COEF(w[i]),ln1);
        !           158:     MKLIST(l,ln0); BDY(tnode) = (pointer)l;
        !           159:   }
        !           160:   NEXT(tnode) = 0; MKLIST(l,node); *listp = l;
        !           161: }