Annotation of OpenXM_contrib2/asir2000/parse/arith.c, Revision 1.13
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.13 ! ohara 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/arith.c,v 1.12 2004/03/03 09:25:30 noro Exp $
1.2 noro 49: */
1.1 noro 50: #include "ca.h"
51: #include "parse.h"
52:
53: struct oAFUNC {
54: void (*add)();
55: void (*sub)();
56: void (*mul)();
57: void (*div)();
58: void (*pwr)();
59: void (*chsgn)();
60: int (*comp)();
61: };
62:
63: struct oARF arf[6];
64: ARF addfs, subfs, mulfs, divfs, remfs, pwrfs;
65:
66: void divsdc();
67:
68: struct oAFUNC afunc[] = {
1.4 noro 69: /* ???=0 */ {0,0,0,0,0,0,0},
70: /* O_N=1 */ {addnum,subnum,mulnum,divnum,pwrnum,chsgnnum,compnum},
71: /* O_P=2 */ {addp,subp,mulp,divr,pwrp,chsgnp,compp},
72: /* O_R=3 */ {addr,subr,mulr,divr,pwrr,chsgnr,compr},
73: /* O_LIST=4 */ {notdef,notdef,notdef,notdef,notdef,notdef,complist},
74: /* O_VECT=5 */ {addvect,subvect,mulvect,divvect,notdef,chsgnvect,compvect},
75: /* O_MAT=6 */ {addmat,submat,mulmat,divmat,pwrmat,chsgnmat,compmat},
76: /* O_STR=7 */ {addstr,notdef,notdef,notdef,notdef,notdef,compstr},
77: /* O_COMP=8 */ {addcomp,subcomp,mulcomp,divcomp,pwrcomp,chsgncomp,compcomp},
78: /* O_DP=9 */ {addd,subd,muld,divsdc,notdef,chsgnd,compd},
79: /* O_USINT=10 */ {notdef,notdef,notdef,notdef,notdef,notdef,compui},
80: /* O_ERR=11 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
81: /* O_GF2MAT=12 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
82: /* O_MATHCAP=13 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
83: /* O_F=14 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
84: /* O_GFMMAT=15 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
85: /* O_BYTEARRAY=16 */ {notdef,notdef,notdef,notdef,notdef,notdef,compbytearray},
1.6 noro 86: /* O_QUOTE=17 */ {addquote,subquote,mulquote,divquote,pwrquote,chsgnquote,(int(*)())notdef},
1.11 noro 87: /* O_OPTLIST=18 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
88: /* O_SYMBOL=19 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
1.12 noro 89: /* O_RANGE=20 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
90: /* O_TB=21 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
1.1 noro 91: };
92:
93: void arf_init() {
94: addfs = &arf[0]; addfs->name = "+"; addfs->fp = arf_add;
95: subfs = &arf[1]; subfs->name = "-"; subfs->fp = arf_sub;
96: mulfs = &arf[2]; mulfs->name = "*"; mulfs->fp = arf_mul;
97: divfs = &arf[3]; divfs->name = "/"; divfs->fp = arf_div;
98: remfs = &arf[4]; remfs->name = "%"; remfs->fp = arf_remain;
99: pwrfs = &arf[5]; pwrfs->name = "^"; pwrfs->fp = arf_pwr;
100: }
101:
102: void arf_add(vl,a,b,r)
103: VL vl;
104: Obj a,b,*r;
105: {
106: int mid;
107:
108: if ( !a )
109: *r = b;
110: else if ( !b )
111: *r = a;
112: else if ( OID(a) == OID(b) )
113: (*afunc[OID(a)].add)(vl,a,b,r);
114: else if ( (mid = MAX(OID(a),OID(b))) <= O_R )
1.13 ! ohara 115: (*afunc[mid].add)(vl,a,b,r);
! 116: else if ( (mid = MAX(OID(a),OID(b))) == O_DP && MIN(OID(a),OID(b)) <= O_R )
1.1 noro 117: (*afunc[mid].add)(vl,a,b,r);
118: else
119: notdef(vl,a,b,r);
120: }
121:
122: void arf_sub(vl,a,b,r)
123: VL vl;
124: Obj a,b,*r;
125: {
126: int mid;
127:
128: if ( !a )
129: if ( !b )
130: *r = 0;
131: else
132: (*afunc[OID(b)].chsgn)(b,r);
133: else if ( !b )
134: *r = a;
135: else if ( OID(a) == OID(b) )
136: (*afunc[OID(a)].sub)(vl,a,b,r);
137: else if ( (mid = MAX(OID(a),OID(b))) <= O_R )
138: (*afunc[mid].sub)(vl,a,b,r);
139: else
140: notdef(vl,a,b,r);
141: }
142:
143: void arf_mul(vl,a,b,r)
144: VL vl;
145: Obj a,b,*r;
146: {
1.10 noro 147: int mid,aid,bid;
1.1 noro 148:
1.9 noro 149: if ( !a && !b )
1.1 noro 150: *r = 0;
1.9 noro 151: else if ( !a || !b ) {
152: if ( !a )
153: a = b;
154: /* compute a*0 */
155: if ( OID(a) == O_MAT || OID(a) == O_VECT )
156: (*(afunc[O_MAT].mul))(vl,a,0,r);
157: else
158: *r = 0;
1.10 noro 159: } else if ( (aid = OID(a)) == (bid = OID(b)) )
160: (*(afunc[aid].mul))(vl,a,b,r);
161: else if ( (mid = MAX(aid,bid)) <= O_R )
1.1 noro 162: (*afunc[mid].mul)(vl,a,b,r);
1.10 noro 163: else {
164: switch ( aid ) {
165: case O_N: case O_P:
166: (*afunc[mid].mul)(vl,a,b,r);
167: break;
168: case O_R:
169: /* rat * something; bid > O_R */
170: if ( bid == O_VECT || bid == O_MAT )
171: (*afunc[mid].mul)(vl,a,b,r);
172: else
173: notdef(vl,a,b,r);
174: break;
175: case O_MAT:
176: if ( bid <= O_R || bid == O_VECT || bid == O_DP )
177: (*afunc[O_MAT].mul)(vl,a,b,r);
178: else
179: notdef(vl,a,b,r);
180: break;
181: case O_VECT:
182: if ( bid <= O_R || bid == O_DP )
183: (*afunc[O_VECT].mul)(vl,a,b,r);
184: else if ( bid == O_MAT )
185: (*afunc[O_MAT].mul)(vl,a,b,r);
186: else
187: notdef(vl,a,b,r);
188: break;
189: case O_DP:
190: if ( bid <= O_P )
191: (*afunc[O_DP].mul)(vl,a,b,r);
192: else if ( bid == O_MAT || bid == O_VECT )
193: (*afunc[bid].mul)(vl,a,b,r);
194: else
195: notdef(vl,a,b,r);
196: break;
197: default:
198: notdef(vl,a,b,r);
199: break;
200: }
201: }
1.1 noro 202: }
203:
204: void arf_div(vl,a,b,r)
205: VL vl;
206: Obj a,b,*r;
207: {
208: int mid;
209:
210: if ( !b )
211: error("div : division by 0");
212: if ( !a )
213: *r = 0;
214: else if ( (OID(a) == OID(b)) )
215: (*(afunc[OID(a)].div))(vl,a,b,r);
216: else if ( (mid = MAX(OID(a),OID(b))) <= O_R ||
217: (mid == O_MAT) || (mid == O_VECT) || (mid == O_DP) )
218: (*afunc[mid].div)(vl,a,b,r);
219: else
220: notdef(vl,a,b,r);
221: }
222:
223: void arf_remain(vl,a,b,r)
224: VL vl;
225: Obj a,b,*r;
226: {
227: if ( !b )
228: error("rem : division by 0");
229: else if ( !a )
230: *r = 0;
231: else if ( MAX(OID(a),OID(b)) <= O_P )
232: cmp((Q)b,(P)a,(P *)r);
233: else
234: notdef(vl,a,b,r);
235: }
236:
237: void arf_pwr(vl,a,e,r)
238: VL vl;
239: Obj a,e,*r;
240: {
241: R t;
242:
243: if ( !a )
1.8 noro 244: if ( !e )
245: *r = (pointer)ONE;
246: else
247: *r = 0;
1.6 noro 248: else if ( OID(a) == O_QUOTE )
249: (*(afunc[O_QUOTE].pwr))(vl,a,e,r);
1.9 noro 250: else if ( !e ) {
251: if ( OID(a) == O_MAT )
252: (*(afunc[O_MAT].pwr))(vl,a,e,r);
253: else
254: *r = (pointer)ONE;
255: } else if ( (OID(e) <= O_N) && INT(e) ) {
1.1 noro 256: if ( (OID(a) == O_P) && (SGN((Q)e) < 0) ) {
257: MKRAT((P)a,(P)ONE,1,t);
258: (*(afunc[O_R].pwr))(vl,t,e,r);
259: } else
260: (*(afunc[OID(a)].pwr))(vl,a,e,r);
261: } else if ( OID(a) <= O_R )
262: mkpow(vl,a,e,r);
263: else
264: notdef(vl,a,e,r);
265: }
266:
267: void arf_chsgn(a,r)
268: Obj a,*r;
269: {
270: if ( !a )
271: *r = 0;
272: else
273: (*(afunc[OID(a)].chsgn))(a,r);
274: }
275:
276: int arf_comp(vl,a,b)
277: VL vl;
278: Obj a,b;
279: {
280: if ( !a )
281: if ( !b )
282: return 0;
283: else
284: return (*afunc[OID(b)].comp)(vl,a,b);
285: else if ( !b )
286: return (*afunc[OID(a)].comp)(vl,a,b);
287: else if ( OID(a) != OID(b) )
288: return OID(a)>OID(b) ? 1 : -1;
289: else
290: return (*afunc[OID(a)].comp)(vl,a,b);
291: }
292:
293: int complist(vl,a,b)
294: VL vl;
295: LIST a,b;
296: {
1.7 noro 297: int t;
1.1 noro 298: NODE an,bn;
299:
300: if ( !a )
301: if ( !b )
302: return 0;
303: else
304: return -1;
305: else if ( !b )
306: return 1;
1.5 noro 307: for ( an = BDY(a), bn = BDY(b); an && bn; an = NEXT(an), bn = NEXT(bn) );
308: if ( an && !bn )
309: return 1;
310: else if ( !an && bn )
311: return -1;
1.1 noro 312: for ( an = BDY(a), bn = BDY(b); an; an = NEXT(an), bn = NEXT(bn) )
313: if ( t = arf_comp(vl,BDY(an),BDY(bn)) )
314: return t;
315: return 0;
316: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to arith.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / parse