Annotation of OpenXM_contrib2/asir2000/builtin/rat.c, Revision 1.5
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.5 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/builtin/rat.c,v 1.4 2003/12/23 10:39:57 ohara Exp $
1.2 noro 49: */
1.1 noro 50: #include "ca.h"
51: #include "parse.h"
52:
1.5 ! noro 53: void Pnm(), Pdn(), Pderiv(), Pederiv(), Prderiv();
1.1 noro 54:
55: struct ftab rat_tab[] = {
56: {"nm",Pnm,1},
57: {"dn",Pdn,1},
58: {"diff",Pderiv,-99999999},
1.4 ohara 59: {"ediff",Pederiv,-99999999},
1.5 ! noro 60: {"rdiff",Prderiv,-99999999},
1.1 noro 61: {0,0,0},
62: };
63:
64: void Pnm(arg,rp)
65: NODE arg;
66: Obj *rp;
67: {
68: Obj t;
69: Q q;
70:
71: asir_assert(ARG0(arg),O_R,"nm");
72: if ( !(t = (Obj)ARG0(arg)) )
73: *rp = 0;
74: else
75: switch ( OID(t) ) {
76: case O_N:
77: switch ( NID(t) ) {
78: case N_Q:
79: NTOQ(NM((Q)t),SGN((Q)t),q); *rp = (Obj)q; break;
80: default:
81: *rp = t; break;
82: }
83: break;
84: case O_P:
85: *rp = t; break;
86: case O_R:
87: *rp = (Obj)NM((R)t); break;
88: default:
89: *rp = 0;
90: }
91: }
92:
93: void Pdn(arg,rp)
94: NODE arg;
95: Obj *rp;
96: {
97: Obj t;
98: Q q;
99:
100: asir_assert(ARG0(arg),O_R,"dn");
101: if ( !(t = (Obj)ARG0(arg)) )
102: *rp = (Obj)ONE;
103: else
104: switch ( OID(t) ) {
105: case O_N:
106: switch ( NID(t) ) {
107: case N_Q:
108: if ( DN((Q)t) )
109: NTOQ(DN((Q)t),1,q);
110: else
111: q = ONE;
112: *rp = (Obj)q; break;
113: default:
114: *rp = (Obj)ONE; break;
115: }
116: break;
117: case O_P:
118: *rp = (Obj)ONE; break;
119: case O_R:
120: *rp = (Obj)DN((R)t); break;
121: default:
122: *rp = 0;
123: }
124: }
125:
126: void Pderiv(arg,rp)
127: NODE arg;
128: Obj *rp;
129: {
130: Obj a,t;
131: LIST l;
132: P v;
133: NODE n;
134:
135: if ( !arg ) {
136: *rp = 0; return;
137: }
138: asir_assert(ARG0(arg),O_R,"diff");
139: reductr(CO,(Obj)ARG0(arg),&a);
140: n = NEXT(arg);
141: if ( n && (l = (LIST)ARG0(n)) && OID(l) == O_LIST )
142: n = BDY(l);
143: for ( ; n; n = NEXT(n) ) {
144: if ( !(v = (P)BDY(n)) || OID(v) != O_P )
145: error("diff : invalid argument");
146: derivr(CO,a,VR(v),&t); a = t;
1.4 ohara 147: }
148: *rp = a;
149: }
150:
1.5 ! noro 151: /* simple derivation with reduction */
! 152: void Prderiv(arg,rp)
! 153: NODE arg;
! 154: Obj *rp;
! 155: {
! 156: Obj a,t;
! 157: LIST l;
! 158: P v;
! 159: NODE n;
! 160:
! 161: if ( !arg ) {
! 162: *rp = 0; return;
! 163: }
! 164: asir_assert(ARG0(arg),O_R,"rdiff");
! 165: a = (Obj)ARG0(arg);
! 166: n = NEXT(arg);
! 167: if ( n && (l = (LIST)ARG0(n)) && OID(l) == O_LIST )
! 168: n = BDY(l);
! 169: for ( ; n; n = NEXT(n) ) {
! 170: if ( !(v = (P)BDY(n)) || OID(v) != O_P )
! 171: error("rdiff : invalid argument");
! 172: simple_derivr(CO,a,VR(v),&t); a = t;
! 173: }
! 174: *rp = a;
! 175: }
! 176:
1.4 ohara 177: /* Euler derivation */
178: void Pederiv(arg,rp)
179: NODE arg;
180: Obj *rp;
181: {
182: Obj a,t;
183: LIST l;
184: P v;
185: NODE n;
186:
187: if ( !arg ) {
188: *rp = 0; return;
189: }
190: asir_assert(ARG0(arg),O_P,"ediff");
191: reductr(CO,(Obj)ARG0(arg),&a);
192: n = NEXT(arg);
193: if ( n && (l = (LIST)ARG0(n)) && OID(l) == O_LIST )
194: n = BDY(l);
195: for ( ; n; n = NEXT(n) ) {
196: if ( !(v = (P)BDY(n)) || OID(v) != O_P )
197: error("diff : invalid argument");
198: ediffp(CO,a,VR(v),&t); a = t;
1.1 noro 199: }
200: *rp = a;
201: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>