Annotation of OpenXM_contrib2/asir2000/parse/function.c, Revision 1.3
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.3 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/function.c,v 1.2 2000/08/21 08:31:46 noro Exp $
1.2 noro 49: */
1.1 noro 50: #include "ca.h"
51: #include "parse.h"
52:
53: void appendbinf(flistp,name,func,argc)
54: NODE *flistp;
55: char *name;
56: void (*func)();
57: int argc;
58: {
59: FUNC t;
60: NODE n;
61:
62: t = (FUNC)MALLOC(sizeof(struct oFUNC));
63: t->name = name; t->id = A_BIN; t->argc = argc; t->f.binf = func;
64: MKNODE(n,t,*flistp); *flistp = n;
65: }
66:
67: void appendparif(flistp,name,func,type)
68: NODE *flistp;
69: char *name;
70: int (*func)();
71: int type;
72: {
73: FUNC t;
74: NODE n;
75:
76: t = (FUNC)MALLOC(sizeof(struct oFUNC));
77: t->name = name; t->id = A_PARI; t->type = type; t->f.binf = (void (*)())func;
78: MKNODE(n,t,*flistp); *flistp = n;
79: }
80:
81: void appendsysf(name,func,argc)
82: char *name;
83: void (*func)();
84: int argc;
85: {
86: appendbinf(&sysf,name,func,argc);
87: }
88:
89: void appendubinf(name,func,argc)
90: char *name;
91: void (*func)();
92: int argc;
93: {
94: appendbinf(&ubinf,name,func,argc);
95: }
96:
97: void dcptolist(dc,listp)
98: DCP dc;
99: LIST *listp;
100: {
101: NODE node,tnode,ln0,ln1;
102: LIST l;
103:
104: for ( node = 0; dc; dc = NEXT(dc) ) {
105: NEXTNODE(node,tnode);
106: MKNODE(ln1,DEG(dc),0); MKNODE(ln0,COEF(dc),ln1);
107: MKLIST(l,ln0); BDY(tnode) = (pointer)l;
108: }
109: NEXT(tnode) = 0; MKLIST(l,node); *listp = l;
110: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>