Annotation of OpenXM_contrib2/asir2000/parse/arith.c, Revision 1.11
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.11 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/arith.c,v 1.10 2003/05/22 07:01:41 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.1 noro 89: };
90:
91: void arf_init() {
92: addfs = &arf[0]; addfs->name = "+"; addfs->fp = arf_add;
93: subfs = &arf[1]; subfs->name = "-"; subfs->fp = arf_sub;
94: mulfs = &arf[2]; mulfs->name = "*"; mulfs->fp = arf_mul;
95: divfs = &arf[3]; divfs->name = "/"; divfs->fp = arf_div;
96: remfs = &arf[4]; remfs->name = "%"; remfs->fp = arf_remain;
97: pwrfs = &arf[5]; pwrfs->name = "^"; pwrfs->fp = arf_pwr;
98: }
99:
100: void arf_add(vl,a,b,r)
101: VL vl;
102: Obj a,b,*r;
103: {
104: int mid;
105:
106: if ( !a )
107: *r = b;
108: else if ( !b )
109: *r = a;
110: else if ( OID(a) == OID(b) )
111: (*afunc[OID(a)].add)(vl,a,b,r);
112: else if ( (mid = MAX(OID(a),OID(b))) <= O_R )
113: (*afunc[mid].add)(vl,a,b,r);
114: else
115: notdef(vl,a,b,r);
116: }
117:
118: void arf_sub(vl,a,b,r)
119: VL vl;
120: Obj a,b,*r;
121: {
122: int mid;
123:
124: if ( !a )
125: if ( !b )
126: *r = 0;
127: else
128: (*afunc[OID(b)].chsgn)(b,r);
129: else if ( !b )
130: *r = a;
131: else if ( OID(a) == OID(b) )
132: (*afunc[OID(a)].sub)(vl,a,b,r);
133: else if ( (mid = MAX(OID(a),OID(b))) <= O_R )
134: (*afunc[mid].sub)(vl,a,b,r);
135: else
136: notdef(vl,a,b,r);
137: }
138:
139: void arf_mul(vl,a,b,r)
140: VL vl;
141: Obj a,b,*r;
142: {
1.10 noro 143: int mid,aid,bid;
1.1 noro 144:
1.9 noro 145: if ( !a && !b )
1.1 noro 146: *r = 0;
1.9 noro 147: else if ( !a || !b ) {
148: if ( !a )
149: a = b;
150: /* compute a*0 */
151: if ( OID(a) == O_MAT || OID(a) == O_VECT )
152: (*(afunc[O_MAT].mul))(vl,a,0,r);
153: else
154: *r = 0;
1.10 noro 155: } else if ( (aid = OID(a)) == (bid = OID(b)) )
156: (*(afunc[aid].mul))(vl,a,b,r);
157: else if ( (mid = MAX(aid,bid)) <= O_R )
1.1 noro 158: (*afunc[mid].mul)(vl,a,b,r);
1.10 noro 159: else {
160: switch ( aid ) {
161: case O_N: case O_P:
162: (*afunc[mid].mul)(vl,a,b,r);
163: break;
164: case O_R:
165: /* rat * something; bid > O_R */
166: if ( bid == O_VECT || bid == O_MAT )
167: (*afunc[mid].mul)(vl,a,b,r);
168: else
169: notdef(vl,a,b,r);
170: break;
171: case O_MAT:
172: if ( bid <= O_R || bid == O_VECT || bid == O_DP )
173: (*afunc[O_MAT].mul)(vl,a,b,r);
174: else
175: notdef(vl,a,b,r);
176: break;
177: case O_VECT:
178: if ( bid <= O_R || bid == O_DP )
179: (*afunc[O_VECT].mul)(vl,a,b,r);
180: else if ( bid == O_MAT )
181: (*afunc[O_MAT].mul)(vl,a,b,r);
182: else
183: notdef(vl,a,b,r);
184: break;
185: case O_DP:
186: if ( bid <= O_P )
187: (*afunc[O_DP].mul)(vl,a,b,r);
188: else if ( bid == O_MAT || bid == O_VECT )
189: (*afunc[bid].mul)(vl,a,b,r);
190: else
191: notdef(vl,a,b,r);
192: break;
193: default:
194: notdef(vl,a,b,r);
195: break;
196: }
197: }
1.1 noro 198: }
199:
200: void arf_div(vl,a,b,r)
201: VL vl;
202: Obj a,b,*r;
203: {
204: int mid;
205:
206: if ( !b )
207: error("div : division by 0");
208: if ( !a )
209: *r = 0;
210: else if ( (OID(a) == OID(b)) )
211: (*(afunc[OID(a)].div))(vl,a,b,r);
212: else if ( (mid = MAX(OID(a),OID(b))) <= O_R ||
213: (mid == O_MAT) || (mid == O_VECT) || (mid == O_DP) )
214: (*afunc[mid].div)(vl,a,b,r);
215: else
216: notdef(vl,a,b,r);
217: }
218:
219: void arf_remain(vl,a,b,r)
220: VL vl;
221: Obj a,b,*r;
222: {
223: if ( !b )
224: error("rem : division by 0");
225: else if ( !a )
226: *r = 0;
227: else if ( MAX(OID(a),OID(b)) <= O_P )
228: cmp((Q)b,(P)a,(P *)r);
229: else
230: notdef(vl,a,b,r);
231: }
232:
233: void arf_pwr(vl,a,e,r)
234: VL vl;
235: Obj a,e,*r;
236: {
237: R t;
238:
239: if ( !a )
1.8 noro 240: if ( !e )
241: *r = (pointer)ONE;
242: else
243: *r = 0;
1.6 noro 244: else if ( OID(a) == O_QUOTE )
245: (*(afunc[O_QUOTE].pwr))(vl,a,e,r);
1.9 noro 246: else if ( !e ) {
247: if ( OID(a) == O_MAT )
248: (*(afunc[O_MAT].pwr))(vl,a,e,r);
249: else
250: *r = (pointer)ONE;
251: } else if ( (OID(e) <= O_N) && INT(e) ) {
1.1 noro 252: if ( (OID(a) == O_P) && (SGN((Q)e) < 0) ) {
253: MKRAT((P)a,(P)ONE,1,t);
254: (*(afunc[O_R].pwr))(vl,t,e,r);
255: } else
256: (*(afunc[OID(a)].pwr))(vl,a,e,r);
257: } else if ( OID(a) <= O_R )
258: mkpow(vl,a,e,r);
259: else
260: notdef(vl,a,e,r);
261: }
262:
263: void arf_chsgn(a,r)
264: Obj a,*r;
265: {
266: if ( !a )
267: *r = 0;
268: else
269: (*(afunc[OID(a)].chsgn))(a,r);
270: }
271:
272: int arf_comp(vl,a,b)
273: VL vl;
274: Obj a,b;
275: {
276: if ( !a )
277: if ( !b )
278: return 0;
279: else
280: return (*afunc[OID(b)].comp)(vl,a,b);
281: else if ( !b )
282: return (*afunc[OID(a)].comp)(vl,a,b);
283: else if ( OID(a) != OID(b) )
284: return OID(a)>OID(b) ? 1 : -1;
285: else
286: return (*afunc[OID(a)].comp)(vl,a,b);
287: }
288:
289: int complist(vl,a,b)
290: VL vl;
291: LIST a,b;
292: {
1.7 noro 293: int t;
1.1 noro 294: NODE an,bn;
295:
296: if ( !a )
297: if ( !b )
298: return 0;
299: else
300: return -1;
301: else if ( !b )
302: return 1;
1.5 noro 303: for ( an = BDY(a), bn = BDY(b); an && bn; an = NEXT(an), bn = NEXT(bn) );
304: if ( an && !bn )
305: return 1;
306: else if ( !an && bn )
307: return -1;
1.1 noro 308: for ( an = BDY(a), bn = BDY(b); an; an = NEXT(an), bn = NEXT(bn) )
309: if ( t = arf_comp(vl,BDY(an),BDY(bn)) )
310: return t;
311: return 0;
312: }
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