| version 1.2, 2000/08/21 08:31:45 |
version 1.6, 2001/08/20 09:03:27 |
|
|
| * shall be made on your publication or presentation in any form of the |
* shall be made on your publication or presentation in any form of the |
| * results obtained by use of the SOFTWARE. |
* results obtained by use of the SOFTWARE. |
| * (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
| * e-mail at risa-admin@flab.fujitsu.co.jp of the detailed specification |
* e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification |
| * for such modification or the source code of the modified part of the |
* for such modification or the source code of the modified part of the |
| * SOFTWARE. |
* SOFTWARE. |
| * |
* |
|
|
| * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
| * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
| * |
* |
| * $OpenXM: OpenXM_contrib2/asir2000/parse/arith.c,v 1.1.1.1 1999/12/03 07:39:11 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/arith.c,v 1.5 2000/12/11 09:28:03 noro Exp $ |
| */ |
*/ |
| #include "ca.h" |
#include "ca.h" |
| #include "parse.h" |
#include "parse.h" |
| Line 66 ARF addfs, subfs, mulfs, divfs, remfs, pwrfs; |
|
| Line 66 ARF addfs, subfs, mulfs, divfs, remfs, pwrfs; |
|
| void divsdc(); |
void divsdc(); |
| |
|
| struct oAFUNC afunc[] = { |
struct oAFUNC afunc[] = { |
| /* ??? */ {0,0,0,0,0,0,0}, |
/* ???=0 */ {0,0,0,0,0,0,0}, |
| /* O_N */ {addnum,subnum,mulnum,divnum,pwrnum,chsgnnum,compnum}, |
/* O_N=1 */ {addnum,subnum,mulnum,divnum,pwrnum,chsgnnum,compnum}, |
| /* O_P */ {addp,subp,mulp,divr,pwrp,chsgnp,compp}, |
/* O_P=2 */ {addp,subp,mulp,divr,pwrp,chsgnp,compp}, |
| /* O_R */ {addr,subr,mulr,divr,pwrr,chsgnr,compr}, |
/* O_R=3 */ {addr,subr,mulr,divr,pwrr,chsgnr,compr}, |
| /* O_LIST */ {notdef,notdef,notdef,notdef,notdef,notdef,complist}, |
/* O_LIST=4 */ {notdef,notdef,notdef,notdef,notdef,notdef,complist}, |
| /* O_VECT */ {addvect,subvect,mulvect,divvect,notdef,chsgnvect,compvect}, |
/* O_VECT=5 */ {addvect,subvect,mulvect,divvect,notdef,chsgnvect,compvect}, |
| /* O_MAT */ {addmat,submat,mulmat,divmat,pwrmat,chsgnmat,compmat}, |
/* O_MAT=6 */ {addmat,submat,mulmat,divmat,pwrmat,chsgnmat,compmat}, |
| /* O_STR */ {addstr,notdef,notdef,notdef,notdef,notdef,compstr}, |
/* O_STR=7 */ {addstr,notdef,notdef,notdef,notdef,notdef,compstr}, |
| /* O_COMP */ {addcomp,subcomp,mulcomp,divcomp,pwrcomp,chsgncomp,compcomp}, |
/* O_COMP=8 */ {addcomp,subcomp,mulcomp,divcomp,pwrcomp,chsgncomp,compcomp}, |
| /* O_DP */ {addd,subd,muld,divsdc,notdef,chsgnd,compd}, |
/* O_DP=9 */ {addd,subd,muld,divsdc,notdef,chsgnd,compd}, |
| /* O_UI */ {notdef,notdef,notdef,notdef,notdef,notdef,compui}, |
/* O_USINT=10 */ {notdef,notdef,notdef,notdef,notdef,notdef,compui}, |
| /* O_GF2MAT */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
/* O_ERR=11 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
| /* O_ERR */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
/* O_GF2MAT=12 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
| /* O_GFMMAT */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
/* O_MATHCAP=13 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
| |
/* O_F=14 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
| |
/* O_GFMMAT=15 */ {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef}, |
| |
/* O_BYTEARRAY=16 */ {notdef,notdef,notdef,notdef,notdef,notdef,compbytearray}, |
| |
/* O_QUOTE=17 */ {addquote,subquote,mulquote,divquote,pwrquote,chsgnquote,(int(*)())notdef}, |
| }; |
}; |
| |
|
| void arf_init() { |
void arf_init() { |
|
|
| |
|
| if ( !a ) |
if ( !a ) |
| *r = 0; |
*r = 0; |
| |
else if ( OID(a) == O_QUOTE ) |
| |
(*(afunc[O_QUOTE].pwr))(vl,a,e,r); |
| else if ( !e ) |
else if ( !e ) |
| *r = (pointer)ONE; |
*r = (pointer)ONE; |
| else if ( (OID(e) <= O_N) && INT(e) ) { |
else if ( (OID(e) <= O_N) && INT(e) ) { |
|
|
| return -1; |
return -1; |
| else if ( !b ) |
else if ( !b ) |
| return 1; |
return 1; |
| for ( i = 0, an = BDY(a); an; i++, an = NEXT(an) ); |
for ( an = BDY(a), bn = BDY(b); an && bn; an = NEXT(an), bn = NEXT(bn) ); |
| for ( an = BDY(b); an; i--, an = NEXT(an) ); |
if ( an && !bn ) |
| if ( i ) |
return 1; |
| return i > 0 ? 1 : -1; |
else if ( !an && bn ) |
| |
return -1; |
| for ( an = BDY(a), bn = BDY(b); an; an = NEXT(an), bn = NEXT(bn) ) |
for ( an = BDY(a), bn = BDY(b); an; an = NEXT(an), bn = NEXT(bn) ) |
| if ( t = arf_comp(vl,BDY(an),BDY(bn)) ) |
if ( t = arf_comp(vl,BDY(an),BDY(bn)) ) |
| return t; |
return t; |