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