Annotation of OpenXM_contrib2/asir2000/parse/arith.c, Revision 1.26
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.26 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/arith.c,v 1.25 2005/11/27 00:07:06 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();
1.20 noro 67: int compqa();
68: int compquote();
1.26 ! noro 69: int compvoid();
1.1 noro 70:
1.26 ! noro 71: struct oAFUNC afunc0[] = {
! 72: /* O_VOID=-1 */ {notdef,notdef,notdef,notdef,notdef,notdef,compvoid},
! 73: /* ???=0 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
1.4 noro 74: /* O_N=1 */ {addnum,subnum,mulnum,divnum,pwrnum,chsgnnum,compnum},
75: /* O_P=2 */ {addp,subp,mulp,divr,pwrp,chsgnp,compp},
76: /* O_R=3 */ {addr,subr,mulr,divr,pwrr,chsgnr,compr},
77: /* O_LIST=4 */ {notdef,notdef,notdef,notdef,notdef,notdef,complist},
78: /* O_VECT=5 */ {addvect,subvect,mulvect,divvect,notdef,chsgnvect,compvect},
79: /* O_MAT=6 */ {addmat,submat,mulmat,divmat,pwrmat,chsgnmat,compmat},
80: /* O_STR=7 */ {addstr,notdef,notdef,notdef,notdef,notdef,compstr},
81: /* O_COMP=8 */ {addcomp,subcomp,mulcomp,divcomp,pwrcomp,chsgncomp,compcomp},
82: /* O_DP=9 */ {addd,subd,muld,divsdc,notdef,chsgnd,compd},
83: /* O_USINT=10 */ {notdef,notdef,notdef,notdef,notdef,notdef,compui},
84: /* O_ERR=11 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
85: /* O_GF2MAT=12 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
86: /* O_MATHCAP=13 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
87: /* O_F=14 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
88: /* O_GFMMAT=15 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
89: /* O_BYTEARRAY=16 */ {notdef,notdef,notdef,notdef,notdef,notdef,compbytearray},
1.20 noro 90: /* O_QUOTE=17 */ {addquote,subquote,mulquote,divquote,pwrquote,chsgnquote,compquote},
1.11 noro 91: /* O_OPTLIST=18 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
92: /* O_SYMBOL=19 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
1.12 noro 93: /* O_RANGE=20 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
94: /* O_TB=21 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
1.14 noro 95: /* O_DPV=22 */ {adddv,subdv,muldv,notdef,notdef,chsgndv,compdv},
1.20 noro 96: /* O_QUOTEARG=23 */ {notdef,notdef,notdef,notdef,notdef,notdef,compqa},
1.19 saito 97: /* O_MAT=24 */ {AddMatI,SubMatI,MulMatG,notdef,notdef,ChsgnI,(int(*)())notdef},
1.25 noro 98: /* O_NBP=25 */ {addnbp,subnbp,mulnbp,notdef,pwrnbp,chsgnnbp,compnbp},
1.1 noro 99: };
100:
1.26 ! noro 101: struct oAFUNC *afunc = &afunc0[1];
! 102:
1.1 noro 103: void arf_init() {
104: addfs = &arf[0]; addfs->name = "+"; addfs->fp = arf_add;
105: subfs = &arf[1]; subfs->name = "-"; subfs->fp = arf_sub;
106: mulfs = &arf[2]; mulfs->name = "*"; mulfs->fp = arf_mul;
107: divfs = &arf[3]; divfs->name = "/"; divfs->fp = arf_div;
108: remfs = &arf[4]; remfs->name = "%"; remfs->fp = arf_remain;
109: pwrfs = &arf[5]; pwrfs->name = "^"; pwrfs->fp = arf_pwr;
110: }
111:
1.26 ! noro 112: void arf_add(VL vl,Obj a,Obj b,Obj *r)
1.1 noro 113: {
114: int mid;
115:
116: if ( !a )
117: *r = b;
118: else if ( !b )
119: *r = a;
120: else if ( OID(a) == OID(b) )
121: (*afunc[OID(a)].add)(vl,a,b,r);
1.21 noro 122: else if ( (mid = MAX(OID(a),OID(b))) <= O_R || mid == O_QUOTE )
1.13 ohara 123: (*afunc[mid].add)(vl,a,b,r);
124: else if ( (mid = MAX(OID(a),OID(b))) == O_DP && MIN(OID(a),OID(b)) <= O_R )
1.1 noro 125: (*afunc[mid].add)(vl,a,b,r);
126: else
127: notdef(vl,a,b,r);
128: }
129:
1.26 ! noro 130: void arf_sub(VL vl,Obj a,Obj b,Obj *r)
1.1 noro 131: {
132: int mid;
133:
134: if ( !a )
135: if ( !b )
136: *r = 0;
137: else
138: (*afunc[OID(b)].chsgn)(b,r);
139: else if ( !b )
140: *r = a;
141: else if ( OID(a) == OID(b) )
142: (*afunc[OID(a)].sub)(vl,a,b,r);
1.21 noro 143: else if ( (mid = MAX(OID(a),OID(b))) <= O_R || mid == O_QUOTE )
1.15 ohara 144: (*afunc[mid].sub)(vl,a,b,r);
145: else if ( (mid = MAX(OID(a),OID(b))) == O_DP && MIN(OID(a),OID(b)) <= O_R )
1.1 noro 146: (*afunc[mid].sub)(vl,a,b,r);
147: else
148: notdef(vl,a,b,r);
149: }
150:
1.26 ! noro 151: void arf_mul(VL vl,Obj a,Obj b,Obj *r)
1.1 noro 152: {
1.10 noro 153: int mid,aid,bid;
1.1 noro 154:
1.9 noro 155: if ( !a && !b )
1.1 noro 156: *r = 0;
1.9 noro 157: else if ( !a || !b ) {
1.18 saito 158: if ( !a ) a = b;
1.9 noro 159: /* compute a*0 */
160: if ( OID(a) == O_MAT || OID(a) == O_VECT )
161: (*(afunc[O_MAT].mul))(vl,a,0,r);
1.18 saito 162: else if ( OID(a) == O_IMAT )
163: (*(afunc[O_IMAT].mul))(vl,0,a,r);
1.9 noro 164: else
165: *r = 0;
1.10 noro 166: } else if ( (aid = OID(a)) == (bid = OID(b)) )
167: (*(afunc[aid].mul))(vl,a,b,r);
1.21 noro 168: else if ( (mid = MAX(aid,bid)) <= O_R || mid == O_QUOTE )
1.1 noro 169: (*afunc[mid].mul)(vl,a,b,r);
1.10 noro 170: else {
171: switch ( aid ) {
1.24 noro 172: case O_N: case O_P: case O_NBP:
1.10 noro 173: (*afunc[mid].mul)(vl,a,b,r);
174: break;
175: case O_R:
176: /* rat * something; bid > O_R */
177: if ( bid == O_VECT || bid == O_MAT )
178: (*afunc[mid].mul)(vl,a,b,r);
179: else
180: notdef(vl,a,b,r);
181: break;
182: case O_MAT:
183: if ( bid <= O_R || bid == O_VECT || bid == O_DP )
184: (*afunc[O_MAT].mul)(vl,a,b,r);
185: else
186: notdef(vl,a,b,r);
187: break;
188: case O_VECT:
189: if ( bid <= O_R || bid == O_DP )
190: (*afunc[O_VECT].mul)(vl,a,b,r);
191: else if ( bid == O_MAT )
192: (*afunc[O_MAT].mul)(vl,a,b,r);
193: else
194: notdef(vl,a,b,r);
195: break;
196: case O_DP:
197: if ( bid <= O_P )
198: (*afunc[O_DP].mul)(vl,a,b,r);
1.14 noro 199: else if ( bid == O_MAT || bid == O_VECT || bid == O_DPV )
1.10 noro 200: (*afunc[bid].mul)(vl,a,b,r);
201: else
202: notdef(vl,a,b,r);
1.18 saito 203: break;
204: case O_IMAT:
205: (*afunc[O_IMAT].mul)(vl,a,b,r);
1.10 noro 206: break;
207: default:
208: notdef(vl,a,b,r);
209: break;
210: }
211: }
1.1 noro 212: }
213:
1.26 ! noro 214: void arf_div(VL vl,Obj a,Obj b,Obj *r)
1.1 noro 215: {
216: int mid;
217:
218: if ( !b )
219: error("div : division by 0");
220: if ( !a )
221: *r = 0;
222: else if ( (OID(a) == OID(b)) )
223: (*(afunc[OID(a)].div))(vl,a,b,r);
224: else if ( (mid = MAX(OID(a),OID(b))) <= O_R ||
1.21 noro 225: (mid == O_MAT) || (mid == O_VECT) || (mid == O_DP) || mid == O_QUOTE )
1.1 noro 226: (*afunc[mid].div)(vl,a,b,r);
227: else
228: notdef(vl,a,b,r);
229: }
230:
1.26 ! noro 231: void arf_remain(VL vl,Obj a,Obj b,Obj *r)
1.1 noro 232: {
233: if ( !b )
234: error("rem : division by 0");
235: else if ( !a )
236: *r = 0;
237: else if ( MAX(OID(a),OID(b)) <= O_P )
238: cmp((Q)b,(P)a,(P *)r);
239: else
240: notdef(vl,a,b,r);
241: }
242:
1.17 noro 243: int allow_laurent;
244:
1.26 ! noro 245: void arf_pwr(VL vl,Obj a,Obj e,Obj *r)
1.1 noro 246: {
247: R t;
248:
1.16 noro 249: if ( !a ) {
1.8 noro 250: if ( !e )
251: *r = (pointer)ONE;
1.16 noro 252: else if ( RATN(e) && SGN((Q)e)>0 )
253: *r = 0;
1.8 noro 254: else
1.16 noro 255: mkpow(vl,a,e,r);
1.22 noro 256: } else if ( !e ) {
1.9 noro 257: if ( OID(a) == O_MAT )
258: (*(afunc[O_MAT].pwr))(vl,a,e,r);
259: else
260: *r = (pointer)ONE;
1.22 noro 261: } else if ( OID(a) == O_QUOTE || OID(e) == O_QUOTE )
262: (*(afunc[O_QUOTE].pwr))(vl,a,e,r);
263: else if ( (OID(e) <= O_N) && INT(e) ) {
1.1 noro 264: if ( (OID(a) == O_P) && (SGN((Q)e) < 0) ) {
1.17 noro 265: if ( allow_laurent )
266: (*(afunc[O_P].pwr))(vl,a,e,r);
267: else {
268: MKRAT((P)a,(P)ONE,1,t);
269: (*(afunc[O_R].pwr))(vl,t,e,r);
270: }
1.1 noro 271: } else
272: (*(afunc[OID(a)].pwr))(vl,a,e,r);
1.17 noro 273: } else if ( (OID(e) <= O_N) && RATN(e) ) {
274: if ( (OID(a) == O_P) && allow_laurent )
275: (*(afunc[O_P].pwr))(vl,a,e,r);
276: else if ( OID(a) <= O_R )
277: mkpow(vl,a,e,r);
278: else
279: notdef(vl,a,e,r);
1.1 noro 280: } else if ( OID(a) <= O_R )
281: mkpow(vl,a,e,r);
282: else
283: notdef(vl,a,e,r);
284: }
285:
1.26 ! noro 286: void arf_chsgn(Obj a,Obj *r)
1.1 noro 287: {
288: if ( !a )
289: *r = 0;
290: else
291: (*(afunc[OID(a)].chsgn))(a,r);
292: }
293:
1.26 ! noro 294: int arf_comp(VL vl,Obj a,Obj b)
1.1 noro 295: {
296: if ( !a )
297: if ( !b )
298: return 0;
299: else
300: return (*afunc[OID(b)].comp)(vl,a,b);
301: else if ( !b )
302: return (*afunc[OID(a)].comp)(vl,a,b);
303: else if ( OID(a) != OID(b) )
304: return OID(a)>OID(b) ? 1 : -1;
305: else
306: return (*afunc[OID(a)].comp)(vl,a,b);
307: }
308:
1.26 ! noro 309: int complist(VL vl,LIST a,LIST b)
1.1 noro 310: {
1.7 noro 311: int t;
1.1 noro 312: NODE an,bn;
313:
314: if ( !a )
315: if ( !b )
316: return 0;
317: else
318: return -1;
319: else if ( !b )
320: return 1;
1.5 noro 321: for ( an = BDY(a), bn = BDY(b); an && bn; an = NEXT(an), bn = NEXT(bn) );
322: if ( an && !bn )
323: return 1;
324: else if ( !an && bn )
325: return -1;
1.1 noro 326: for ( an = BDY(a), bn = BDY(b); an; an = NEXT(an), bn = NEXT(bn) )
327: if ( t = arf_comp(vl,BDY(an),BDY(bn)) )
328: return t;
329: return 0;
1.26 ! noro 330: }
! 331:
! 332: int compvoid(VL vl,Obj a,Obj b)
! 333: {
! 334: if ( !a )
! 335: if ( !b ) return 0;
! 336: else return -1;
! 337: else if ( !b )
! 338: return 1;
! 339: else if ( OID(a) > OID(b) ) return 1;
! 340: else if ( OID(b) < OID(a) ) return -1;
! 341: else return 0;
1.1 noro 342: }
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