Annotation of OpenXM_contrib2/asir2000/builtin/pdiv.c, Revision 1.3
1.3 ! 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@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: *
! 48: * $OpenXM: OpenXM_contrib2/asir2000/builtin/pdiv.c,v 1.2 2000/01/26 01:36:12 noro Exp $
! 49: */
1.1 noro 50: #include "ca.h"
51: #include "parse.h"
52:
53: void Psdiv(), Psrem(), Ptdiv(), Psqr(), Pinva_mod();
54: void Psdiv_gf2n(), Psrem_gf2n();
55: void Psdivm(), Psremm(), Psqrm();
56: void Psrem_mod();
57: void Pugcd();
58: void Purem();
59: void Pudiv();
60:
61: struct ftab pdiv_tab[] = {
62: {"sdiv",Psdiv,-3},
63: {"srem",Psrem,-3},
64: {"sdiv_gf2n",Psdiv_gf2n,2},
65: {"srem_gf2n",Psrem_gf2n,2},
66: {"sqr",Psqr,-3},
67: {"tdiv",Ptdiv,2},
68: {"udiv",Pudiv,2},
69: {"sdivm",Psdivm,-4},
70: {"sremm",Psremm,-4},
71: {"sqrm",Psqrm,-4},
72: {"inva_mod",Pinva_mod,3},
73: {"srem_mod",Psrem_mod,3},
74: {"ugcd",Pugcd,2},
75: {"urem",Purem,2},
76: {0,0,0},
77: };
78:
79: void Psdiv(arg,rp)
80: NODE arg;
81: Obj *rp;
82: {
83: P q,r,dnd,dnd1,dvr,dvr1;
84: V v;
85: VL vl;
86:
87: asir_assert(ARG0(arg),O_P,"sdiv");
88: asir_assert(ARG1(arg),O_P,"sdiv");
89: dnd = (P)ARG0(arg); dvr = (P)ARG1(arg);
90: if ( argc(arg) == 3 ) {
91: v = VR((P)ARG2(arg));
92: change_mvar(CO,dnd,v,&dnd1); change_mvar(CO,dvr,v,&dvr1);
93: reordvar(CO,v,&vl);
94: divsrp(vl,dnd1,dvr1,&q,&r);
95: restore_mvar(CO,q,v,(P *)rp);
96: } else
97: divsrp(CO,dnd,dvr,(P *)rp,&r);
98: }
99:
100: void Psrem(arg,rp)
101: NODE arg;
102: Obj *rp;
103: {
104: P q,r,dnd,dnd1,dvr,dvr1;
105: V v;
106: VL vl;
107:
108: asir_assert(ARG0(arg),O_P,"srem");
109: asir_assert(ARG1(arg),O_P,"srem");
110: dnd = (P)ARG0(arg); dvr = (P)ARG1(arg);
111: if ( argc(arg) == 3 ) {
112: v = VR((P)ARG2(arg));
113: change_mvar(CO,dnd,v,&dnd1); change_mvar(CO,dvr,v,&dvr1);
114: reordvar(CO,v,&vl);
115: divsrp(vl,dnd1,dvr1,&q,&r);
116: restore_mvar(CO,r,v,(P *)rp);
117: } else
118: divsrp(CO,dnd,dvr,&q,(P *)rp);
119: }
120:
121: void Psqr(arg,rp)
122: NODE arg;
123: LIST *rp;
124: {
125: P q,q1,r,r1,dnd,dnd1,dvr,dvr1;
126: NODE n,tn;
127: V v;
128: VL vl;
129:
130: asir_assert(ARG0(arg),O_P,"sqr");
131: asir_assert(ARG1(arg),O_P,"sqr");
132: dnd = (P)ARG0(arg); dvr = (P)ARG1(arg);
133: if ( argc(arg) == 3 ) {
134: v = VR((P)ARG2(arg));
135: change_mvar(CO,dnd,v,&dnd1); change_mvar(CO,dvr,v,&dvr1);
136: reordvar(CO,v,&vl);
137: divsrp(vl,dnd1,dvr1,&q1,&r1);
138: restore_mvar(CO,q1,v,&q); restore_mvar(CO,r1,v,&r);
139: } else
140: divsrp(CO,dnd,dvr,&q,&r);
141: MKNODE(tn,r,0); MKNODE(n,q,tn); MKLIST(*rp,n);
142: }
143:
144: void Psdiv_gf2n(arg,rp)
145: NODE arg;
146: GF2N *rp;
147: {
148: GF2N dnd,dvr;
149: UP2 q,r;
150:
151: dnd = (GF2N)ARG0(arg); dvr = (GF2N)ARG1(arg);
152: if ( !dvr )
153: error("sdiv_gf2n : division by 0");
154: else if ( !dnd )
155: *rp = 0;
156: else {
157: qrup2(dnd->body,dvr->body,&q,&r);
158: MKGF2N(q,*rp);
159: }
160: }
161:
162: void Psrem_gf2n(arg,rp)
163: NODE arg;
164: GF2N *rp;
165: {
166: GF2N dnd,dvr;
167: UP2 q,r;
168:
169: dnd = (GF2N)ARG0(arg); dvr = (GF2N)ARG1(arg);
170: if ( !dvr )
171: error("srem_gf2n : division by 0");
172: else if ( !dnd )
173: *rp = 0;
174: else {
175: qrup2(dnd->body,dvr->body,&q,&r);
176: MKGF2N(r,*rp);
177: }
178: }
179:
180: void Ptdiv(arg,rp)
181: NODE arg;
182: P *rp;
183: {
184: P p1,p2,q1,q2,q,c1,c2,c;
185:
186: p1 = (P)ARG0(arg); p2 = (P)ARG1(arg);
187: asir_assert(p1,O_P,"tdiv");
188: asir_assert(p2,O_P,"tdiv");
189: if ( !p1 || !p2 )
190: *rp = 0;
191: else if ( (OID(p1) > O_P) || (OID(p2) > O_P ) )
192: *rp = 0;
193: else {
194: ptozp(p1,1,(Q *)&c1,&q1); ptozp(p2,1,(Q *)&c2,&q2);
195: if ( divtpz(CO,q1,q2,&q) ) {
196: divq((Q)c1,(Q)c2,(Q *)&c); mulp(CO,q,c,rp);
197: } else
198: *rp = 0;
199: }
200: }
201:
202: void Pudiv(arg,rp)
203: NODE arg;
204: LIST *rp;
205: {
206: P q,r,dnd,dvr;
207: NODE n,tn;
208:
209: asir_assert(ARG0(arg),O_P,"udiv");
210: asir_assert(ARG1(arg),O_P,"udiv");
211: dnd = (P)ARG0(arg); dvr = (P)ARG1(arg);
212: udivpz(dnd,dvr,&q,&r);
213: MKNODE(tn,r,0); MKNODE(n,q,tn); MKLIST(*rp,n);
214: }
215:
216: void Psdivm(arg,rp)
217: NODE arg;
218: Obj *rp;
219: {
220: P q,r,dnd,dnd1,dndm,dvr,dvr1,dvrm,t;
221: V v;
222: VL vl;
223: int m;
224:
225: asir_assert(ARG0(arg),O_P,"sdivm");
226: asir_assert(ARG1(arg),O_P,"sdivm");
227: asir_assert(ARG2(arg),O_N,"sdivm");
228: dnd = (P)ARG0(arg); dvr = (P)ARG1(arg); m = QTOS((Q)ARG2(arg));
229: if ( argc(arg) == 4 ) {
230: v = VR((P)ARG3(arg));
231: change_mvar(CO,dnd,v,&dnd1); change_mvar(CO,dvr,v,&dvr1);
232: reordvar(CO,v,&vl);
233: ptomp(m,dnd1,&dndm); ptomp(m,dvr1,&dvrm);
234: divsrmp(vl,m,dndm,dvrm,&t,&r); mptop(t,&q);
235: restore_mvar(CO,q,v,(P *)rp);
236: } else {
237: ptomp(m,dnd,&dndm); ptomp(m,dvr,&dvrm);
238: divsrmp(CO,m,dndm,dvrm,&t,&r); mptop(t,(P *)rp);
239: }
240: }
241:
242: void Psremm(arg,rp)
243: NODE arg;
244: Obj *rp;
245: {
246: P q,r,dnd,dnd1,dndm,dvr,dvr1,dvrm,t;
247: V v;
248: VL vl;
249: int m;
250:
251: asir_assert(ARG0(arg),O_P,"sremm");
252: asir_assert(ARG1(arg),O_P,"sremm");
253: asir_assert(ARG2(arg),O_N,"sremm");
254: dnd = (P)ARG0(arg); dvr = (P)ARG1(arg); m = QTOS((Q)ARG2(arg));
255: if ( argc(arg) == 4 ) {
256: v = VR((P)ARG3(arg));
257: change_mvar(CO,dnd,v,&dnd1); change_mvar(CO,dvr,v,&dvr1);
258: reordvar(CO,v,&vl);
259: ptomp(m,dnd1,&dndm); ptomp(m,dvr1,&dvrm);
260: divsrmp(vl,m,dndm,dvrm,&q,&t); mptop(t,&r);
261: restore_mvar(CO,r,v,(P *)rp);
262: } else {
263: ptomp(m,dnd,&dndm); ptomp(m,dvr,&dvrm);
264: divsrmp(CO,m,dndm,dvrm,&q,&t); mptop(t,(P *)rp);
265: }
266: }
267:
268: void Psqrm(arg,rp)
269: NODE arg;
270: LIST *rp;
271: {
272: P q,q1,r,r1,dnd,dnd1,dndm,dvr,dvr1,dvrm;
273: NODE n,tn;
274: V v;
275: VL vl;
276: int m;
277:
278: asir_assert(ARG0(arg),O_P,"sqrm");
279: asir_assert(ARG1(arg),O_P,"sqrm");
280: asir_assert(ARG2(arg),O_N,"sqrm");
281: dnd = (P)ARG0(arg); dvr = (P)ARG1(arg); m = QTOS((Q)ARG2(arg));
282: if ( argc(arg) == 4 ) {
283: v = VR((P)ARG3(arg));
284: change_mvar(CO,dnd,v,&dnd1); change_mvar(CO,dvr,v,&dvr1);
285: reordvar(CO,v,&vl);
286: ptomp(m,dnd1,&dndm); ptomp(m,dvr1,&dvrm);
1.2 noro 287: divsrmp(vl,m,dndm,dvrm,&q,&r); mptop(q,&q1); mptop(r,&r1);
1.1 noro 288: restore_mvar(CO,q1,v,&q); restore_mvar(CO,r1,v,&r);
289: } else {
290: ptomp(m,dnd,&dndm); ptomp(m,dvr,&dvrm);
1.2 noro 291: divsrmp(CO,m,dndm,dvrm,&q1,&r1); mptop(q1,&q); mptop(r1,&r);
1.1 noro 292: }
293: MKNODE(tn,r,0); MKNODE(n,q,tn); MKLIST(*rp,n);
294: }
295:
296: void Pinva_mod(arg,rp)
297: NODE arg;
298: P *rp;
299: {
300: P dp,f;
301: Q q;
302: int n,i;
303: int mod;
304: V v;
305: UM wf,wdp,winv;
306:
307: asir_assert(ARG0(arg),O_P,"gcda_mod");
308: asir_assert(ARG1(arg),O_N,"gcda_mod");
309: asir_assert(ARG2(arg),O_P,"gcda_mod");
310: dp = (P)ARG0(arg);
311: mod = QTOS((Q)ARG1(arg));
312: f = (P)ARG2(arg);
313: if ( NUM(f) ) {
314: i = invm(rem(NM((Q)f),mod),mod);
315: STOQ(i,q); *rp = (P)q;
316: } else {
317: v = VR(dp);
318: n = MAX(UDEG(dp),UDEG(f));
319: wf = W_UMALLOC(n); wdp = W_UMALLOC(n);
320: winv = W_UMALLOC(n);
321: ptoum(mod,f,wf); ptoum(mod,dp,wdp);
322: invum(mod,wdp,wf,winv);
323: if ( DEG(winv) < 0 )
324: *rp = 0;
325: else {
326: umtop(v,winv,rp);
327: }
328: }
329: }
330:
331: void Psrem_mod(arg,rp)
332: NODE arg;
333: P *rp;
334: {
335: P p1,p2;
336: int n,dr;
337: int mod;
338: V v;
339: UM wp1,wp2,q;
340:
341: asir_assert(ARG0(arg),O_P,"srem_mod");
342: asir_assert(ARG1(arg),O_P,"srem_mod");
343: asir_assert(ARG2(arg),O_N,"srem_mod");
344: p1 = (P)ARG0(arg); p2 = (P)ARG1(arg); mod = QTOS((Q)ARG2(arg));
345: if ( !p1 || NUM(p1) )
346: *rp = p1;
347: else {
348: v = VR(p1);
349: n = MAX(UDEG(p1),UDEG(p2));
350: wp1 = W_UMALLOC(n); wp2 = W_UMALLOC(n); q = W_UMALLOC(n);
351: ptoum(mod,p1,wp1); ptoum(mod,p2,wp2);
352: dr = divum(mod,wp1,wp2,q);
353: if ( ( DEG(wp1) = dr ) == -1 )
354: *rp = 0;
355: else
356: umtop(v,wp1,rp);
357: }
358: }
359:
360: void Purem(arg,rp)
361: NODE arg;
362: P *rp;
363: {
364: asir_assert(ARG0(arg),O_P,"urem");
365: asir_assert(ARG1(arg),O_P,"urem");
366: uremp((P)ARG0(arg),(P)ARG1(arg),rp);
367: }
368:
369: void Pugcd(arg,rp)
370: NODE arg;
371: P *rp;
372: {
373: asir_assert(ARG0(arg),O_P,"ugcd");
374: asir_assert(ARG1(arg),O_P,"ugcd");
375: ugcdp((P)ARG0(arg),(P)ARG1(arg),rp);
376: }
377:
378: void invum(mod,dp,f,inv)
379: int mod;
380: UM dp,f,inv;
381: {
382: UM g1,g2,a1,a2,a3,wm,q,tum;
383: int d,dr;
384:
385: d = DEG(dp)+DEG(f)+10;
386: g1 = W_UMALLOC(d); g2 = W_UMALLOC(d); a1 = W_UMALLOC(d);
387: a2 = W_UMALLOC(d); a3 = W_UMALLOC(d); wm = W_UMALLOC(d);
388: q = W_UMALLOC(d);
389: DEG(a1) = 0; COEF(a1)[0] = 1; DEG(a2) = -1;
390: cpyum(f,g1); cpyum(dp,g2);
391: while ( 1 ) {
392: dr = divum(mod,g1,g2,q); tum = g1; g1 = g2; g2 = tum;
393: if ( ( DEG(g2) = dr ) == -1 )
394: break;
395: mulum(mod,a2,q,wm); subum(mod,a1,wm,a3); dr = divum(mod,a3,dp,q);
396: tum = a1; a1 = a2; a2 = a3; a3 = tum; DEG(a3) = dr;
397: }
398: if ( DEG(g1) != 0 )
399: DEG(inv) = -1;
400: else if ( COEF(g1)[0] != 1 )
401: mulsum(mod,a2,invm(COEF(g1)[0],mod),inv);
402: else
403: cpyum(a2,inv);
404: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to pdiv.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / builtin