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