Annotation of OpenXM_contrib2/asir2018/builtin/result.c, Revision 1.2
1.1 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
26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
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.2 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2018/builtin/result.c,v 1.1 2018/09/19 05:45:06 noro Exp $
1.1 noro 49: */
50: #include "ca.h"
51: #include "parse.h"
52:
53: void Presult(), Psrcr(), Pnd_res();
54:
55: struct ftab result_tab[] = {
56: {"res",Presult,-4},
57: {"nd_res",Pnd_res,-4},
58: {"srcr",Psrcr,3},
59: {0,0,0},
60: };
61:
62: void Pnd_res(NODE arg,P *rp)
63: {
64: int mod,d1,d2,i,j;
65: Z q1,q2;
66: P *a1,*a2;
67: P p1,p2,r1,r2,r;
68: V v;
69: MAT m;
70: DCP dc;
71: VL vl;
72:
73: asir_assert(ARG0(arg),O_P,"nd_res");
74: asir_assert(ARG1(arg),O_P,"nd_res");
75: asir_assert(ARG2(arg),O_P,"nd_res");
76: v = VR((P)ARG0(arg)); p1 = ARG1(arg); p2 = ARG2(arg);
77: d1 = getdeg(v,p1);
78: d2 = getdeg(v,p2);
79: if ( d1 == 0 ) {
80: if ( d2 == 0 )
81: *rp = (P)ONE;
82: else {
1.2 ! noro 83: STOZ(d2,q2);
1.1 noro 84: pwrp(CO,p1,q2,rp);
85: }
86: return;
87: } else if ( d2 == 0 ) {
1.2 ! noro 88: STOZ(d1,q1);
1.1 noro 89: pwrp(CO,p2,q1,rp);
90: return;
91: }
92: MKMAT(m,d1+d2,d1+d2);
93: reordvar(CO,v,&vl);
94: reorderp(vl,CO,p1,&r1);
95: reorderp(vl,CO,p2,&r2);
96: a1 = ALLOCA((d1+1)*sizeof(P));
97: a2 = ALLOCA((d2+1)*sizeof(P));
98: for ( i = 0; i <= d1; i++ ) a1[i] = 0;
99: for ( i = 0; i <= d2; i++ ) a2[i] = 0;
1.2 ! noro 100: for ( dc = DC(r1); dc; dc = NEXT(dc) ) a1[d1-ZTOS(DEG(dc))] = COEF(dc);
! 101: for ( dc = DC(r2); dc; dc = NEXT(dc) ) a2[d2-ZTOS(DEG(dc))] = COEF(dc);
1.1 noro 102: for ( i = 0; i < d2; i++ )
103: for ( j = 0; j <= d1; j++ )
104: m->body[i][i+j] = a1[j];
105: for ( i = 0; i < d1; i++ )
106: for ( j = 0; j <= d2; j++ )
107: m->body[i+d2][i+j] = a2[j];
1.2 ! noro 108: nd_det(argc(arg)==3?0:ZTOS((Q)ARG3(arg)),m,rp);
1.1 noro 109: }
110:
111: void Presult(NODE arg,P *rp)
112: {
113: int mod;
114: P p1,p2,r;
115:
116: asir_assert(ARG0(arg),O_P,"res");
117: asir_assert(ARG1(arg),O_P,"res");
118: asir_assert(ARG2(arg),O_P,"res");
119: if ( argc(arg) == 3 )
120: resultp(CO,VR((P)ARG0(arg)),(P)ARG1(arg),(P)ARG2(arg),rp);
121: else {
1.2 ! noro 122: mod = ZTOS((Q)ARG3(arg));
1.1 noro 123: ptomp(mod,(P)ARG1(arg),&p1); ptomp(mod,(P)ARG2(arg),&p2);
124: resultmp(CO,mod,VR((P)ARG0(arg)),p1,p2,&r);
125: mptop(r,rp);
126: }
127: }
128:
129: void Psrcr(NODE arg,P *rp)
130: {
131: asir_assert(ARG0(arg),O_P,"srcr");
132: asir_assert(ARG1(arg),O_P,"srcr");
133: asir_assert(ARG2(arg),O_P,"srcr");
134: res_ch_det(CO,VR((P)ARG0(arg)),(P)ARG1(arg),(P)ARG2(arg),rp);
135: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>