version 1.1.1.1, 1999/12/03 07:39:07 |
version 1.5, 2018/03/29 01:32:50 |
|
|
/* $OpenXM: OpenXM/src/asir99/builtin/result.c,v 1.1.1.1 1999/11/10 08:12:26 noro Exp $ */ |
/* |
|
* Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED |
|
* All rights reserved. |
|
* |
|
* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited, |
|
* non-exclusive and royalty-free license to use, copy, modify and |
|
* redistribute, solely for non-commercial and non-profit purposes, the |
|
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and |
|
* conditions of this Agreement. For the avoidance of doubt, you acquire |
|
* only a limited right to use the SOFTWARE hereunder, and FLL or any |
|
* third party developer retains all rights, including but not limited to |
|
* copyrights, in and to the SOFTWARE. |
|
* |
|
* (1) FLL does not grant you a license in any way for commercial |
|
* purposes. You may use the SOFTWARE only for non-commercial and |
|
* non-profit purposes only, such as academic, research and internal |
|
* business use. |
|
* (2) The SOFTWARE is protected by the Copyright Law of Japan and |
|
* international copyright treaties. If you make copies of the SOFTWARE, |
|
* with or without modification, as permitted hereunder, you shall affix |
|
* to all such copies of the SOFTWARE the above copyright notice. |
|
* (3) An explicit reference to this SOFTWARE and its copyright owner |
|
* shall be made on your publication or presentation in any form of the |
|
* results obtained by use of the SOFTWARE. |
|
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
|
* 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 |
|
* SOFTWARE. |
|
* |
|
* THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL |
|
* MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND |
|
* EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS |
|
* FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES' |
|
* RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY |
|
* MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY. |
|
* UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT, |
|
* OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY |
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL |
|
* DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES |
|
* ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES |
|
* FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY |
|
* DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF |
|
* SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART |
|
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
|
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
|
* |
|
* $OpenXM: OpenXM_contrib2/asir2000/builtin/result.c,v 1.4 2005/03/18 08:55:59 noro Exp $ |
|
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
|
|
void Presult(), Psrcr(); |
void Presult(), Psrcr(), Pnd_res(); |
|
|
struct ftab result_tab[] = { |
struct ftab result_tab[] = { |
{"res",Presult,-4}, |
{"res",Presult,-4}, |
{"srcr",Psrcr,3}, |
{"nd_res",Pnd_res,-4}, |
{0,0,0}, |
{"srcr",Psrcr,3}, |
|
{0,0,0}, |
}; |
}; |
|
|
|
void Pnd_res(arg,rp) |
|
NODE arg; |
|
P *rp; |
|
{ |
|
int mod,d1,d2,i,j; |
|
Q q1,q2; |
|
P *a1,*a2; |
|
P p1,p2,r1,r2,r; |
|
V v; |
|
MAT m; |
|
DCP dc; |
|
VL vl; |
|
|
|
asir_assert(ARG0(arg),O_P,"nd_res"); |
|
asir_assert(ARG1(arg),O_P,"nd_res"); |
|
asir_assert(ARG2(arg),O_P,"nd_res"); |
|
v = VR((P)ARG0(arg)); p1 = ARG1(arg); p2 = ARG2(arg); |
|
d1 = getdeg(v,p1); |
|
d2 = getdeg(v,p2); |
|
if ( d1 == 0 ) { |
|
if ( d2 == 0 ) |
|
*rp = (P)ONE; |
|
else { |
|
STOQ(d2,q2); |
|
pwrp(CO,p1,q2,rp); |
|
} |
|
return; |
|
} else if ( d2 == 0 ) { |
|
STOQ(d1,q1); |
|
pwrp(CO,p2,q1,rp); |
|
return; |
|
} |
|
MKMAT(m,d1+d2,d1+d2); |
|
reordvar(CO,v,&vl); |
|
reorderp(vl,CO,p1,&r1); |
|
reorderp(vl,CO,p2,&r2); |
|
a1 = ALLOCA((d1+1)*sizeof(P)); |
|
a2 = ALLOCA((d2+1)*sizeof(P)); |
|
for ( i = 0; i <= d1; i++ ) a1[i] = 0; |
|
for ( i = 0; i <= d2; i++ ) a2[i] = 0; |
|
for ( dc = DC(r1); dc; dc = NEXT(dc) ) a1[d1-QTOS(DEG(dc))] = COEF(dc); |
|
for ( dc = DC(r2); dc; dc = NEXT(dc) ) a2[d2-QTOS(DEG(dc))] = COEF(dc); |
|
for ( i = 0; i < d2; i++ ) |
|
for ( j = 0; j <= d1; j++ ) |
|
m->body[i][i+j] = a1[j]; |
|
for ( i = 0; i < d1; i++ ) |
|
for ( j = 0; j <= d2; j++ ) |
|
m->body[i+d2][i+j] = a2[j]; |
|
nd_det(argc(arg)==3?0:QTOS((Q)ARG3(arg)),m,rp); |
|
} |
|
|
void Presult(arg,rp) |
void Presult(arg,rp) |
NODE arg; |
NODE arg; |
P *rp; |
P *rp; |
{ |
{ |
int mod; |
int mod; |
P p1,p2,r; |
P p1,p2,r; |
|
|
asir_assert(ARG0(arg),O_P,"res"); |
asir_assert(ARG0(arg),O_P,"res"); |
asir_assert(ARG1(arg),O_P,"res"); |
asir_assert(ARG1(arg),O_P,"res"); |
asir_assert(ARG2(arg),O_P,"res"); |
asir_assert(ARG2(arg),O_P,"res"); |
if ( argc(arg) == 3 ) |
if ( argc(arg) == 3 ) |
resultp(CO,VR((P)ARG0(arg)),(P)ARG1(arg),(P)ARG2(arg),rp); |
resultp(CO,VR((P)ARG0(arg)),(P)ARG1(arg),(P)ARG2(arg),rp); |
else { |
else { |
mod = QTOS((Q)ARG3(arg)); |
mod = QTOS((Q)ARG3(arg)); |
ptomp(mod,(P)ARG1(arg),&p1); ptomp(mod,(P)ARG2(arg),&p2); |
ptomp(mod,(P)ARG1(arg),&p1); ptomp(mod,(P)ARG2(arg),&p2); |
resultmp(CO,mod,VR((P)ARG0(arg)),p1,p2,&r); |
resultmp(CO,mod,VR((P)ARG0(arg)),p1,p2,&r); |
mptop(r,rp); |
mptop(r,rp); |
} |
} |
} |
} |
|
|
void Psrcr(arg,rp) |
void Psrcr(arg,rp) |
NODE arg; |
NODE arg; |
P *rp; |
P *rp; |
{ |
{ |
asir_assert(ARG0(arg),O_P,"srcr"); |
asir_assert(ARG0(arg),O_P,"srcr"); |
asir_assert(ARG1(arg),O_P,"srcr"); |
asir_assert(ARG1(arg),O_P,"srcr"); |
asir_assert(ARG2(arg),O_P,"srcr"); |
asir_assert(ARG2(arg),O_P,"srcr"); |
res_ch_det(CO,VR((P)ARG0(arg)),(P)ARG1(arg),(P)ARG2(arg),rp); |
res_ch_det(CO,VR((P)ARG0(arg)),(P)ARG1(arg),(P)ARG2(arg),rp); |
} |
} |