Annotation of OpenXM_contrib2/asir2000/builtin/poly.c, Revision 1.25
1.4 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.5 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.4 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.25 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/builtin/poly.c,v 1.24 2011/07/21 04:43:26 noro Exp $
1.4 noro 49: */
1.1 noro 50: #include "ca.h"
51: #include "parse.h"
52: #include "base.h"
53:
54: void Pranp();
55:
1.20 noro 56: void Pheadsgn();
1.21 noro 57: void Pmul_trunc(),Pquo_trunc();
1.1 noro 58: void Pumul(),Pumul_ff(),Pusquare(),Pusquare_ff(),Putmul(),Putmul_ff();
59: void Pkmul(),Pksquare(),Pktmul();
1.22 noro 60: void Pord(), Premove_vars(), Pcoef0(), Pcoef(), Pdeg(), Pmindeg(), Psetmod();
1.1 noro 61: void Pcoef_gf2n();
62: void getcoef(), getdeglist(), mergedeglist(), change_mvar(), restore_mvar();
63:
1.2 noro 64: void Pp_mag(),Pmaxblen();
1.1 noro 65: void Pmergelist(), Pch_mv(), Pre_mv(), Pdeglist();
66: void Pptomp(),Pmptop();
67: void Pptolmp(),Plmptop();
1.12 noro 68: void Pptosfp(),Psfptop(),Psf_galois_action(),Psf_embed(),Psf_find_root();
1.18 noro 69: void Psf_minipoly(),Psf_log(),Psfptopsfp();
1.1 noro 70: void Pptogf2n(),Pgf2ntop(),Pgf2ntovect();
71: void Pptogfpn(),Pgfpntop();
72: void Pfind_root_gf2n();
1.2 noro 73: void Pumul_specialmod(),Pusquare_specialmod(),Putmul_specialmod();
1.1 noro 74:
75: void Pureverse(),Putrunc(),Pudecomp(),Purembymul(),Purembymul_precomp();
76: void Puinvmod(),Purevinvmod();
77: void Ppwrmod_ff(),Ppwrtab_ff(),Pgeneric_pwrmod_ff();
78: void Pkpwrmod_lm(),Pkpwrtab_lm(),Pkgeneric_pwrmod_lm();
79:
80: void Pkmulum();
81: void Pksquareum();
82:
83: void Pfmultest();
84: void Phfmul_lm();
85: void Plazy_lm();
86:
87: void Psetmod_ff();
88: void Psimp_ff();
89: void Pextdeg_ff();
90: void Pcharacteristic_ff();
91: void Pfield_type_ff();
92: void Pfield_order_ff();
93: void Prandom_ff();
94:
95: void Ptracemod_gf2n();
96: void Psparsemod_gf2n();
97: void Pmultest_gf2n();
98: void Psquaretest_gf2n();
99: void Pinvtest_gf2n();
100: void Pbininv_gf2n();
101: void Prinvtest_gf2n();
102: void Pis_irred_gf2();
103: void Pis_irred_ddd_gf2();
1.2 noro 104: void Pget_next_fft_prime();
1.3 noro 105: void Puadj_coef();
1.9 noro 106: void Preorder();
107: void Phomogeneous_part();
108: void Phomogeneous_deg();
1.1 noro 109: void simp_ff(Obj,Obj *);
110: void ranp(int,UP *);
111: void field_order_ff(N *);
112:
113: int current_ff;
114:
115: struct ftab poly_tab[] = {
1.20 noro 116: {"headsgn",Pheadsgn,1},
1.21 noro 117: {"quo_trunc",Pquo_trunc,2},
1.19 noro 118: {"mul_trunc",Pmul_trunc,3},
1.9 noro 119: {"homogeneous_deg",Phomogeneous_deg,-2},
120: {"homogeneous_part",Phomogeneous_part,-3},
121: {"reorder",Preorder,3},
1.3 noro 122: {"uadj_coef",Puadj_coef,3},
1.1 noro 123: {"ranp",Pranp,2},
124: {"p_mag",Pp_mag,1},
1.2 noro 125: {"maxblen",Pmaxblen,1},
1.1 noro 126: {"ord",Pord,-1},
1.22 noro 127: {"remove_vars",Premove_vars,1},
1.25 ! noro 128: {"delete_vars",Premove_vars,1},
1.1 noro 129: {"coef0",Pcoef0,-3},
130: {"coef",Pcoef,-3},
131: {"coef_gf2n",Pcoef_gf2n,2},
132: {"deg",Pdeg,2},
133: {"mindeg",Pmindeg,2},
134: {"setmod",Psetmod,-1},
135:
136: {"sparsemod_gf2n",Psparsemod_gf2n,-1},
137:
1.15 noro 138: {"setmod_ff",Psetmod_ff,-3},
1.1 noro 139: {"simp_ff",Psimp_ff,1},
140: {"extdeg_ff",Pextdeg_ff,0},
141: {"characteristic_ff",Pcharacteristic_ff,0},
142: {"field_type_ff",Pfield_type_ff,0},
143: {"field_order_ff",Pfield_order_ff,0},
144: {"random_ff",Prandom_ff,0},
145:
146: {"deglist",Pdeglist,2},
147: {"mergelist",Pmergelist,2},
148: {"ch_mv",Pch_mv,2},
149: {"re_mv",Pre_mv,2},
150:
151: {"ptomp",Pptomp,2},
152: {"mptop",Pmptop,1},
153:
154: {"ptolmp",Pptolmp,1},
155: {"lmptop",Plmptop,1},
156:
1.11 noro 157: {"sf_galois_action",Psf_galois_action,2},
1.12 noro 158: {"sf_find_root",Psf_find_root,1},
159: {"sf_minipoly",Psf_minipoly,2},
160: {"sf_embed",Psf_embed,3},
1.13 noro 161: {"sf_log",Psf_log,1},
162:
1.11 noro 163: {"ptosfp",Pptosfp,1},
1.6 noro 164: {"sfptop",Psfptop,1},
1.18 noro 165: {"sfptopsfp",Psfptopsfp,2},
1.1 noro 166: {"ptogf2n",Pptogf2n,1},
167: {"gf2ntop",Pgf2ntop,-2},
168: {"gf2ntovect",Pgf2ntovect,1},
169:
170: {"ptogfpn",Pptogfpn,1},
171: {"gfpntop",Pgfpntop,-2},
172:
173: {"kmul",Pkmul,2},
174: {"ksquare",Pksquare,1},
175: {"ktmul",Pktmul,3},
176:
177: {"umul",Pumul,2},
178: {"usquare",Pusquare,1},
179: {"ureverse_inv_as_power_series",Purevinvmod,2},
180: {"uinv_as_power_series",Puinvmod,2},
181:
1.2 noro 182: {"umul_specialmod",Pumul_specialmod,3},
183: {"usquare_specialmod",Pusquare_specialmod,2},
184: {"utmul_specialmod",Putmul_specialmod,4},
185:
1.1 noro 186: {"utmul",Putmul,3},
187: {"umul_ff",Pumul_ff,2},
188: {"usquare_ff",Pusquare_ff,1},
189: {"utmul_ff",Putmul_ff,3},
190:
191: /* for historical reason */
192: {"trunc",Putrunc,2},
193: {"decomp",Pudecomp,2},
194:
195: {"utrunc",Putrunc,2},
196: {"udecomp",Pudecomp,2},
1.3 noro 197: {"ureverse",Pureverse,-2},
1.1 noro 198: {"urembymul",Purembymul,2},
199: {"urembymul_precomp",Purembymul_precomp,3},
200:
201: {"lazy_lm",Plazy_lm,1},
202: {"lazy_ff",Plazy_lm,1},
203:
204: {"pwrmod_ff",Ppwrmod_ff,1},
205: {"generic_pwrmod_ff",Pgeneric_pwrmod_ff,3},
206: {"pwrtab_ff",Ppwrtab_ff,2},
207:
208: {"tracemod_gf2n",Ptracemod_gf2n,3},
209: {"b_find_root_gf2n",Pfind_root_gf2n,1},
210:
211: {"is_irred_gf2",Pis_irred_gf2,1},
212: {"is_irred_ddd_gf2",Pis_irred_ddd_gf2,1},
213:
214: {"kpwrmod_lm",Pkpwrmod_lm,1},
215: {"kgeneric_pwrmod_lm",Pkgeneric_pwrmod_lm,3},
216: {"kpwrtab_lm",Pkpwrtab_lm,2},
217:
218: {"kmulum",Pkmulum,3},
219: {"ksquareum",Pksquareum,2},
220:
221: {"fmultest",Pfmultest,3},
222: {"hfmul_lm",Phfmul_lm,2},
223:
224: {"multest_gf2n",Pmultest_gf2n,2},
225: {"squaretest_gf2n",Psquaretest_gf2n,1},
226: {"bininv_gf2n",Pbininv_gf2n,2},
227: {"invtest_gf2n",Pinvtest_gf2n,1},
228: {"rinvtest_gf2n",Prinvtest_gf2n,0},
1.2 noro 229: {"get_next_fft_prime",Pget_next_fft_prime,2},
1.1 noro 230: {0,0,0},
231: };
1.20 noro 232:
233: void Pheadsgn(NODE arg,Q *rp)
234: {
235: int s;
236:
237: s = headsgn((P)ARG0(arg));
238: STOQ(s,*rp);
239: }
1.19 noro 240:
241: void Pmul_trunc(NODE arg,P *rp)
242: {
243: P p1,p2,p,h;
244: VL vl0,vl1,vl2,tvl,vl;
245: VN vn;
246: int i,n;
247:
248: p1 = (P)ARG0(arg);
249: p2 = (P)ARG1(arg);
250: get_vars((Obj)p1,&vl1); get_vars((Obj)p2,&vl2); mergev(CO,vl1,vl2,&tvl);
251: p = (P)ARG2(arg);
252: get_vars((Obj)p,&vl0); mergev(CO,tvl,vl0,&vl);
253: for ( tvl = vl, n = 0; tvl; tvl = NEXT(tvl), n++ );
254: vn = (VN) ALLOCA((n+1)*sizeof(struct oVN));
255: for ( i = 0, tvl = vl; i < n; tvl = NEXT(tvl), i++ ) {
256: vn[i].v = tvl->v;
257: vn[i].n = 0;
258: }
259: vn[i].v = 0;
260: vn[i].n = 0;
261: for ( h = p, i = 0; OID(h) == O_P; h = COEF(DC(h)) ) {
262: for ( ; vn[i].v != VR(h); i++ );
263: vn[i].n = QTOS(DEG(DC(h)));
264: }
265: mulp_trunc(vl,p1,p2,vn,rp);
1.21 noro 266: }
267:
268: void Pquo_trunc(NODE arg,P *rp)
269: {
270: P p1,p2,p,h;
271: VL vl0,vl1,vl2,tvl,vl;
272: VN vn;
273: int i,n;
274:
275: p1 = (P)ARG0(arg);
276: p2 = (P)ARG1(arg);
277: if ( !p1 )
278: *rp = 0;
279: else if ( NUM(p2) )
280: divsp(CO,p1,p2,rp);
281: else {
282: get_vars((Obj)p1,&vl1); get_vars((Obj)p2,&vl2); mergev(CO,vl1,vl2,&vl);
283: for ( tvl = vl, n = 0; tvl; tvl = NEXT(tvl), n++ );
284: vn = (VN) ALLOCA((n+1)*sizeof(struct oVN));
285: for ( i = 0, tvl = vl; i < n; tvl = NEXT(tvl), i++ ) {
286: vn[i].v = tvl->v;
287: vn[i].n = 0;
288: }
289: vn[i].v = 0;
290: vn[i].n = 0;
291: for ( h = p2, i = 0; OID(h) == O_P; h = COEF(DC(h)) ) {
292: for ( ; vn[i].v != VR(h); i++ );
293: vn[i].n = QTOS(DEG(DC(h)));
294: }
295: quop_trunc(vl,p1,p2,vn,rp);
296: }
1.19 noro 297: }
1.1 noro 298:
1.16 noro 299: void Phomogeneous_part(NODE arg,P *rp)
1.9 noro 300: {
301: if ( argc(arg) == 2 )
302: exthp(CO,(P)ARG0(arg),QTOS((Q)ARG1(arg)),rp);
303: else
304: exthpc_generic(CO,(P)ARG0(arg),QTOS((Q)ARG2(arg)),
305: VR((P)ARG1(arg)),rp);
306: }
307:
1.16 noro 308: void Phomogeneous_deg(NODE arg,Q *rp)
1.9 noro 309: {
310: int d;
311:
312: if ( argc(arg) == 1 )
313: d = homdeg((P)ARG0(arg));
314: else
315: d = getchomdeg(VR((P)ARG1(arg)),(P)ARG0(arg));
316: STOQ(d,*rp);
317: }
318:
319: /*
320: p1 = reorder(p,ovl,nvl) => p1 is 'sorted accoding to nvl.
321: */
322:
1.16 noro 323: void Preorder(NODE arg,P *rp)
1.9 noro 324: {
325: VL ovl,nvl,tvl;
326: NODE n;
327:
328: for ( ovl = 0, n = BDY((LIST)ARG1(arg)); n; n = NEXT(n) ) {
329: if ( !ovl ) {
330: NEWVL(ovl); tvl = ovl;
331: } else {
332: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
333: }
334: VR(tvl) = VR((P)BDY(n));
335: }
336: for ( nvl = 0, n = BDY((LIST)ARG2(arg)); n; n = NEXT(n) ) {
337: if ( !nvl ) {
338: NEWVL(nvl); tvl = nvl;
339: } else {
340: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
341: }
342: VR(tvl) = VR((P)BDY(n));
343: }
344: reorderp(nvl,ovl,(P)ARG0(arg),rp);
345: }
1.3 noro 346:
347: /*
348: uadj_coef(F,M,M2)
349: if ( F is a non-negative integer )
350: return F > M2 ? F-M : M2;
351: else
352: F = CN*V^N+...+C0
353: return uadj_coef(CN,M,M2)*V^N+...+uadj_coef(C0,M,M2);
354: */
355:
1.16 noro 356: void Puadj_coef(NODE arg,P *rp)
1.3 noro 357: {
358: UP f,r;
359: N m,m2;
360:
361: ptoup((P)ARG0(arg),&f);
362: m = NM((Q)ARG1(arg));
363: m2 = NM((Q)ARG2(arg));
364: adj_coefup(f,m,m2,&r);
365: uptop(r,rp);
366: }
367:
1.2 noro 368: /*
369: get_next_fft_prime(StartIndex,Bits)
370: tries to find smallest Index >= StartIndex s.t.
371: 2^(Bits-1)|FFTprime[Index]-1
372: return [Index,Mod] or 0 (not exist)
373: */
374:
1.16 noro 375: void Pget_next_fft_prime(NODE arg,LIST *rp)
1.2 noro 376: {
377: unsigned int mod,d;
378: int start,bits,i;
379: NODE n;
380: Q q,ind;
381:
382: start = QTOS((Q)ARG0(arg));
383: bits = QTOS((Q)ARG1(arg));
384: for ( i = start; ; i++ ) {
385: get_fft_prime(i,&mod,&d);
386: if ( !mod ) {
387: *rp = 0; return;
388: }
1.16 noro 389: if ( bits <= (int)d ) {
1.2 noro 390: UTOQ(mod,q);
391: UTOQ(i,ind);
392: n = mknode(2,ind,q);
393: MKLIST(*rp,n);
394: return;
395: }
396: }
397: }
1.1 noro 398:
1.16 noro 399: void Pranp(NODE arg,P *rp)
1.1 noro 400: {
401: int n;
402: UP c;
403:
404: n = QTOS((Q)ARG0(arg));
405: ranp(n,&c);
406: if ( c ) {
407: up_var = VR((P)ARG1(arg));
408: uptop(c,rp);
409: } else
410: *rp = 0;
411: }
412:
1.16 noro 413: void ranp(int n,UP *nr)
1.1 noro 414: {
415: int i;
416: unsigned int r;
417: Q q;
418: UP c;
419:
420: *nr = c = UPALLOC(n);
421: for ( i = 0; i <= n; i++ ) {
422: r = random();
423: UTOQ(r,q);
424: c->c[i] = (Num)q;
425: }
426: for ( i = n; i >= 0 && !c->c[i]; i-- );
427: if ( i >= 0 )
428: c->d = i;
429: else
430: *nr = 0;
431: }
432:
1.16 noro 433: void Pmaxblen(NODE arg,Q *rp)
1.2 noro 434: {
435: int l;
436: l = maxblenp(ARG0(arg));
437: STOQ(l,*rp);
438: }
439:
1.16 noro 440: void Pp_mag(NODE arg,Q *rp)
1.1 noro 441: {
442: int l;
443: l = p_mag(ARG0(arg));
444: STOQ(l,*rp);
445: }
446:
1.16 noro 447: void Pord(NODE arg,LIST *listp)
1.1 noro 448: {
1.23 noro 449: NODE n,tn,p,opt;
450: char *key;
451: Obj value;
452: int overwrite=0;
1.1 noro 453: LIST l;
454: VL vl,tvl,svl;
455: P t;
456: int i,j;
457: V *va;
458: V v;
459:
1.23 noro 460: if ( current_option ) {
461: for ( opt = current_option; opt; opt = NEXT(opt) ) {
462: p = BDY((LIST)BDY(opt));
463: key = BDY((STRING)BDY(p));
464: value = (Obj)BDY(NEXT(p));
465: if ( !strcmp(key,"overwrite") && value ) {
466: overwrite = value ? 1 : 0;
467: break;
468: }
469: }
470: }
471:
1.1 noro 472: if ( argc(arg) ) {
473: asir_assert(ARG0(arg),O_LIST,"ord");
474: for ( vl = 0, i = 0, n = BDY((LIST)ARG0(arg));
475: n; n = NEXT(n), i++ ) {
476: if ( !vl ) {
477: NEWVL(vl); tvl = vl;
478: } else {
479: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
480: }
481: if ( !(t = (P)BDY(n)) || (OID(t) != O_P) )
482: error("ord : invalid argument");
483: VR(tvl) = VR(t);
484: }
1.23 noro 485: if ( !overwrite ) {
486: va = (V *)ALLOCA(i*sizeof(V));
487: for ( j = 0, svl = vl; j < i; j++, svl = NEXT(svl) )
488: va[j] = VR(svl);
489: for ( svl = CO; svl; svl = NEXT(svl) ) {
490: v = VR(svl);
491: for ( j = 0; j < i; j++ )
492: if ( v == va[j] )
493: break;
494: if ( j == i ) {
495: if ( !vl ) {
496: NEWVL(vl); tvl = vl;
497: } else {
498: NEWVL(NEXT(tvl)); tvl = NEXT(tvl);
499: }
500: VR(tvl) = v;
1.1 noro 501: }
502: }
1.24 noro 503: } else {
504: for ( svl = vl; svl; svl = NEXT(svl) ) {
505: if ( svl->v->attr == (pointer)V_PF )
506: ((PFINS)svl->v->priv)->pf->ins = 0;
507: }
1.1 noro 508: }
509: if ( vl )
510: NEXT(tvl) = 0;
511: CO = vl;
512: }
513: for ( n = 0, vl = CO; vl; vl = NEXT(vl) ) {
514: NEXTNODE(n,tn); MKV(VR(vl),t); BDY(tn) = (pointer)t;
515: }
516: NEXT(tn) = 0; MKLIST(l,n); *listp = l;
517: }
518:
1.22 noro 519: void Premove_vars(NODE arg,LIST *listp)
520: {
521: NODE l,nd,tnd;
522: V *v,*va;
523: int n,na,i,j;
524: VL vl,vl1;
525: P t;
526: LIST list;
527:
528: asir_assert(ARG0(arg),O_LIST,"remove_vars");
529: l = BDY((LIST)ARG0(arg)); n = length(l);
530: v = (V *)ALLOCA(n*sizeof(V));
531: for ( i = 0; i < n; i++, l = NEXT(l) )
532: if ( !(t = (P)BDY(l)) || (OID(t) != O_P) )
533: error("ord : invalid argument");
534: else v[i] = VR(t);
535:
536: for ( na = 0, vl = CO; vl; vl = NEXT(vl), na++ );
537: va = (V *)ALLOCA(na*sizeof(V));
538: for ( i = 0, vl = CO; i < na; i++, vl = NEXT(vl) ) va[i] = VR(vl);
539: for ( i = 0; i < na; i++ )
540: for ( j = 0; j < n; j++ ) if ( va[i] == v[j] ) va[i] = 0;
541: for ( vl = 0, i = na-1; i >= 0; i-- )
542: if ( va[i] ) {
543: NEWVL(vl1); VR(vl1) = va[i]; NEXT(vl1) = vl; vl = vl1;
544: }
545: CO = vl;
546: for ( nd = 0, vl = CO; vl; vl = NEXT(vl) ) {
547: NEXTNODE(nd,tnd); MKV(VR(vl),t); BDY(tnd) = (pointer)t;
548: }
549: if ( nd ) NEXT(tnd) = 0;
550: MKLIST(list,nd); *listp = list;
551: }
552:
1.16 noro 553: void Pcoef0(NODE arg,Obj *rp)
1.1 noro 554: {
555: Obj t,n;
556: P s;
557: DCP dc;
558: int id;
559: V v;
560: VL vl;
561:
562: if ( !(t = (Obj)ARG0(arg)) || ((id = OID(ARG0(arg))) > O_P) )
563: *rp = 0;
564: else if ( (n = (Obj)ARG1(arg)) && (OID(n) > O_N) )
565: *rp = 0;
566: else if ( id == O_N )
567: if ( !n )
568: *rp = t;
569: else
570: *rp = 0;
571: else {
572: if ( argc(arg) == 3 ) {
573: if ( (v = VR((P)ARG2(arg))) != VR((P)t) ) {
574: reordvar(CO,v,&vl); reorderp(vl,CO,(P)t,&s);
575: } else
576: s = (P)t;
577: if ( VR(s) != v ) {
578: if ( n )
579: *rp = 0;
580: else
581: *rp = t;
582: return;
583: }
584: } else
585: s = (P)t;
586: for ( dc = DC(s); dc && cmpq(DEG(dc),(Q)n); dc = NEXT(dc) );
587: if ( dc )
588: *rp = (Obj)COEF(dc);
589: else
590: *rp = 0;
591: }
592: }
593:
1.16 noro 594: void Pcoef(NODE arg,Obj *rp)
1.1 noro 595: {
596: Obj t,n;
597: P s;
598: DCP dc;
599: int id;
600: V v;
601:
602: if ( !(t = (Obj)ARG0(arg)) || ((id = OID(ARG0(arg))) > O_P) )
603: *rp = 0;
604: else if ( (n = (Obj)ARG1(arg)) && (OID(n) > O_N) )
605: *rp = 0;
606: else if ( id == O_N ) {
607: if ( !n )
608: *rp = t;
609: else
610: *rp = 0;
611: } else {
612: if ( argc(arg) == 3 ) {
613: if ( (v = VR((P)ARG2(arg))) != VR((P)t) ) {
614: getcoef(CO,(P)t,v,(Q)n,(P *)rp); return;
615: } else
616: s = (P)t;
617: if ( VR(s) != v ) {
618: if ( n )
619: *rp = 0;
620: else
621: *rp = t;
622: return;
623: }
624: } else
625: s = (P)t;
626: for ( dc = DC(s); dc && cmpq(DEG(dc),(Q)n); dc = NEXT(dc) );
627: if ( dc )
628: *rp = (Obj)COEF(dc);
629: else
630: *rp = 0;
631: }
632: }
633:
1.16 noro 634: void Pcoef_gf2n(NODE arg,Obj *rp)
1.1 noro 635: {
636: Obj t,n;
637: int id,d;
638: UP2 up2;
639:
640: if ( !(t = (Obj)ARG0(arg)) || ((id = OID(ARG0(arg))) > O_P) )
641: *rp = 0;
642: else if ( (n = (Obj)ARG1(arg)) && (OID(n) > O_N) )
643: *rp = 0;
644: else if ( id == O_N && NID((Num)t) == N_GF2N ) {
645: d = QTOS((Q)n);
646: up2 = ((GF2N)t)->body;
647: if ( d > degup2(up2) )
648: *rp = 0;
649: else
650: *rp = (Obj)(up2->b[d/BSH]&(((unsigned long)1)<<(d%BSH))?ONE:0);
651: } else
652: *rp = 0;
653: }
654:
1.16 noro 655: void Pdeg(NODE arg,Q *rp)
1.1 noro 656: {
657: Obj t,v;
658: int d;
659:
660: #if 0
661: if ( !(t = (Obj)ARG0(arg)) || (OID(t) != O_P) )
662: *rp = 0;
663: else if ( !(v = (Obj)ARG1(arg)) || (VR((P)v) != VR((P)t)) )
664: *rp = 0;
665: else
666: *rp = (Obj)DEG(DC((P)t));
667: #endif
668: if ( !(t = (Obj)ARG0(arg)) )
669: STOQ(-1,*rp);
670: else if ( OID(t) != O_P ) {
671: if ( OID(t) == O_N && NID(t) == N_GF2N
672: && (v=(Obj)ARG1(arg)) && OID(v)== O_N && NID(v) == N_GF2N ) {
673: d = degup2(((GF2N)t)->body);
674: STOQ(d,*rp);
675: } else
676: *rp = 0;
677: } else
678: degp(VR((P)ARG1(arg)),(P)ARG0(arg),rp);
679: }
680:
1.16 noro 681: void Pmindeg(NODE arg,Q *rp)
1.1 noro 682: {
683: Obj t;
684:
685: if ( !(t = (Obj)ARG0(arg)) || (OID(t) != O_P) )
686: *rp = 0;
687: else
688: getmindeg(VR((P)ARG1(arg)),(P)ARG0(arg),rp);
689: }
690:
1.16 noro 691: void Psetmod(NODE arg,Q *rp)
1.1 noro 692: {
693: if ( arg ) {
694: asir_assert(ARG0(arg),O_N,"setmod");
695: current_mod = QTOS((Q)ARG0(arg));
696: }
697: STOQ(current_mod,*rp);
698: }
699:
1.16 noro 700: void Psparsemod_gf2n(NODE arg,Q *rp)
1.1 noro 701: {
702: int id;
703:
704: if ( arg && current_mod_gf2n )
705: current_mod_gf2n->id = ARG0(arg)?1:0;
706: if ( !current_mod_gf2n )
707: id = -1;
708: else
709: id = current_mod_gf2n->id;
710: STOQ(id,*rp);
711: }
712:
1.16 noro 713: void Pmultest_gf2n(NODE arg,GF2N *rp)
1.1 noro 714: {
715: GF2N a,b,c;
716: int i;
717:
718: a = (GF2N)ARG0(arg); b = (GF2N)ARG0(arg);
719: for ( i = 0; i < 10000; i++ )
720: mulgf2n(a,b,&c);
721: *rp = c;
722: }
723:
1.16 noro 724: void Psquaretest_gf2n(NODE arg,GF2N *rp)
1.1 noro 725: {
726: GF2N a,c;
727: int i;
728:
729: a = (GF2N)ARG0(arg);
730: for ( i = 0; i < 10000; i++ )
731: squaregf2n(a,&c);
732: *rp = c;
733: }
734:
1.16 noro 735: void Pinvtest_gf2n(NODE arg,GF2N *rp)
1.1 noro 736: {
737: GF2N a,c;
738: int i;
739:
740: a = (GF2N)ARG0(arg);
741: for ( i = 0; i < 10000; i++ )
742: invgf2n(a,&c);
743: *rp = c;
744: }
745:
1.16 noro 746: void Pbininv_gf2n(NODE arg,GF2N *rp)
1.1 noro 747: {
748: UP2 a,inv;
749: int n;
750:
751: a = ((GF2N)ARG0(arg))->body;
752: n = QTOS((Q)ARG1(arg));
753: type1_bin_invup2(a,n,&inv);
754: MKGF2N(inv,*rp);
755: }
756:
1.16 noro 757: void Prinvtest_gf2n(Real *rp)
1.1 noro 758: {
759: GF2N *a;
760: GF2N c;
761: double t0,t1,r;
762: int i;
763: double get_clock();
764:
765: a = (GF2N *)ALLOCA(1000*sizeof(GF2N));
766: for ( i = 0; i < 1000; i++ ) {
767: randomgf2n(&a[i]);
768: }
769: t0 = get_clock();
770: for ( i = 0; i < 1000; i++ )
771: invgf2n(a[i],&c);
772: t1 = get_clock();
773: r = (t1-t0)/1000;
774: MKReal(r,*rp);
775: }
776:
1.16 noro 777: void Pfind_root_gf2n(NODE arg,GF2N *rp)
1.1 noro 778: {
779:
780: #if 0
781: UP p;
782:
783: ptoup((P)ARG0(arg),&p);
784: find_root_gf2n(p,rp);
785: #else
786: UP2 p;
787:
788: ptoup2((P)ARG0(arg),&p);
789: find_root_up2(p,rp);
790: #endif
791: }
792:
1.16 noro 793: void Pis_irred_gf2(NODE arg,Q *rp)
1.1 noro 794: {
795: UP2 t;
796:
797: ptoup2(ARG0(arg),&t);
798: *rp = irredcheckup2(t) ? ONE : 0;
799: }
800:
1.16 noro 801: void Pis_irred_ddd_gf2(NODE arg,Q *rp)
1.1 noro 802: {
803: UP2 t;
804: int ret;
805:
806: ptoup2(ARG0(arg),&t);
807: ret = irredcheck_dddup2(t);
808: STOQ(ret,*rp);
809: }
810:
1.16 noro 811: void Psetmod_ff(NODE arg,Obj *rp)
1.1 noro 812: {
813: int ac;
1.7 noro 814: int d;
1.1 noro 815: Obj mod,defpoly;
816: N n;
817: UP up;
818: UP2 up2;
1.14 noro 819: UM dp;
1.6 noro 820: Q q,r;
1.15 noro 821: P p,p1,y;
1.1 noro 822: NODE n0,n1;
823: LIST list;
824:
825: ac = argc(arg);
826: if ( ac == 1 ) {
827: mod = (Obj)ARG0(arg);
828: if ( !mod )
829: error("setmod_ff : invalid argument");
830: switch ( OID(mod) ) {
831: case O_N:
1.7 noro 832: current_ff = FF_GFP;
833: setmod_lm(NM((Q)mod));
1.6 noro 834: break;
1.1 noro 835: case O_P:
836: current_ff = FF_GF2N;
837: setmod_gf2n((P)mod); break;
838: default:
839: error("setmod_ff : invalid argument");
840: }
841: } else if ( ac == 2 ) {
1.7 noro 842: if ( OID(ARG0(arg)) == O_N ) {
843: /* small finite field; primitive root representation */
844: current_ff = FF_GFS;
845: setmod_sf(QTOS((Q)ARG0(arg)),QTOS((Q)ARG1(arg)));
1.6 noro 846: } else {
1.7 noro 847: mod = (Obj)ARG1(arg);
1.6 noro 848: current_ff = FF_GFPN;
849: defpoly = (Obj)ARG0(arg);
850: if ( !mod || !defpoly )
851: error("setmod_ff : invalid argument");
852: setmod_lm(NM((Q)mod));
853: setmod_gfpn((P)defpoly);
854: }
1.14 noro 855: } else if ( ac == 3 ) {
856: /* finite extension of a small finite field */
857: current_ff = FF_GFS;
858: setmod_sf(QTOS((Q)ARG0(arg)),QTOS((Q)ARG1(arg)));
859: d = QTOS((Q)ARG2(arg));
860: generate_defpoly_sfum(d,&dp);
1.15 noro 861: setmod_gfsn(dp);
862: current_ff = FF_GFSN;
1.1 noro 863: }
864: switch ( current_ff ) {
865: case FF_GFP:
866: getmod_lm(&n); NTOQ(n,1,q); *rp = (Obj)q; break;
867: case FF_GF2N:
868: getmod_gf2n(&up2); up2top(up2,&p); *rp = (Obj)p; break;
869: case FF_GFPN:
870: getmod_lm(&n); NTOQ(n,1,q);
871: getmod_gfpn(&up); uptop(up,&p);
872: MKNODE(n1,q,0); MKNODE(n0,p,n1);
873: MKLIST(list,n0);
874: *rp = (Obj)list; break;
1.6 noro 875: case FF_GFS:
1.15 noro 876: case FF_GFSN:
1.7 noro 877: STOQ(current_gfs_p,q);
1.15 noro 878: if ( current_gfs_ext )
1.7 noro 879: enc_to_p(current_gfs_p,current_gfs_iton[1],
880: VR(current_gfs_ext),&p);
1.15 noro 881: else {
1.11 noro 882: if ( current_gfs_p == 2 )
883: r = ONE;
1.17 noro 884: else if ( !current_gfs_ntoi )
885: r = 0;
1.11 noro 886: else
887: STOQ(current_gfs_iton[1],r);
1.15 noro 888: p = (P)r;
889: }
890: switch ( current_ff ) {
891: case FF_GFS:
892: n0 = mknode(3,q,current_gfs_ext,p);
893: break;
894: case FF_GFSN:
895: getmod_gfsn(&dp);
896: makevar("y",&y);
897: sfumtop(VR(y),dp,&p1);
898: n0 = mknode(4,q,current_gfs_ext,p,p1);
899: break;
1.7 noro 900: }
1.6 noro 901: MKLIST(list,n0);
902: *rp = (Obj)list; break;
1.1 noro 903: default:
904: *rp = 0; break;
905: }
906: }
907:
1.16 noro 908: void Pextdeg_ff(Q *rp)
1.1 noro 909: {
910: int d;
911: UP2 up2;
912: UP up;
1.15 noro 913: UM dp;
1.1 noro 914:
915: switch ( current_ff ) {
916: case FF_GFP:
917: *rp = ONE; break;
918: case FF_GF2N:
919: getmod_gf2n(&up2); d = degup2(up2); STOQ(d,*rp); break;
920: case FF_GFPN:
921: getmod_gfpn(&up); STOQ(up->d,*rp); break;
1.10 noro 922: case FF_GFS:
923: if ( !current_gfs_ext )
924: *rp = ONE;
925: else
926: *rp = DEG(DC(current_gfs_ext));
927: break;
1.15 noro 928: case FF_GFSN:
929: getmod_gfsn(&dp);
930: STOQ(DEG(dp),*rp);
931: break;
1.1 noro 932: default:
933: error("extdeg_ff : current_ff is not set");
934: }
935: }
936:
1.16 noro 937: void Pcharacteristic_ff(Q *rp)
1.1 noro 938: {
939: N lm;
940:
941: switch ( current_ff ) {
942: case FF_GFP:
943: case FF_GFPN:
944: getmod_lm(&lm); NTOQ(lm,1,*rp); break;
945: case FF_GF2N:
946: STOQ(2,*rp); break;
1.10 noro 947: case FF_GFS:
1.15 noro 948: case FF_GFSN:
1.10 noro 949: STOQ(current_gfs_p,*rp); break;
1.1 noro 950: default:
951: error("characteristic_ff : current_ff is not set");
952: }
953: }
954:
1.16 noro 955: void Pfield_type_ff(Q *rp)
1.1 noro 956: {
957: STOQ(current_ff,*rp);
958: }
959:
1.16 noro 960: void Pfield_order_ff(Q *rp)
1.1 noro 961: {
962: N n;
963:
964: field_order_ff(&n);
965: NTOQ(n,1,*rp);
966: }
967:
1.16 noro 968: void Prandom_ff(Obj *rp)
1.1 noro 969: {
970: LM l;
971: GF2N g;
972: GFPN p;
1.7 noro 973: GFS s;
1.15 noro 974: GFSN spn;
1.1 noro 975:
976: switch ( current_ff ) {
977: case FF_GFP:
978: random_lm(&l); *rp = (Obj)l; break;
979: case FF_GF2N:
980: randomgf2n(&g); *rp = (Obj)g; break;
981: case FF_GFPN:
982: randomgfpn(&p); *rp = (Obj)p; break;
1.7 noro 983: case FF_GFS:
984: randomgfs(&s); *rp = (Obj)s; break;
1.15 noro 985: case FF_GFSN:
986: randomgfsn(&spn); *rp = (Obj)spn; break;
1.1 noro 987: default:
988: error("random_ff : current_ff is not set");
989: }
990: }
991:
1.16 noro 992: void Psimp_ff(NODE arg,Obj *rp)
993: {
1.1 noro 994: simp_ff((Obj)ARG0(arg),rp);
995: }
996:
1.16 noro 997: void getcoef(VL vl,P p,V v,Q d,P *r)
1.1 noro 998: {
999: P s,t,u,a,b,x;
1000: DCP dc;
1001: V w;
1002:
1003: if ( !p )
1004: *r = 0;
1005: else if ( NUM(p) )
1006: *r = d ? 0 : p;
1007: else if ( (w=VR(p)) == v ) {
1008: for ( dc = DC(p); dc && cmpq(DEG(dc),d); dc = NEXT(dc) );
1009: *r = dc ? COEF(dc) : 0;
1010: } else {
1011: MKV(w,x);
1012: for ( dc = DC(p), s = 0; dc; dc = NEXT(dc) ) {
1013: getcoef(vl,COEF(dc),v,d,&t);
1014: if ( t ) {
1015: pwrp(vl,x,DEG(dc),&u); mulp(vl,t,u,&a);
1016: addp(vl,s,a,&b); s = b;
1017: }
1018: }
1019: *r = s;
1020: }
1021: }
1022:
1.16 noro 1023: void Pdeglist(NODE arg,LIST *rp)
1.1 noro 1024: {
1025: NODE d;
1026:
1027: getdeglist((P)ARG0(arg),VR((P)ARG1(arg)),&d);
1028: MKLIST(*rp,d);
1029: }
1030:
1.16 noro 1031: void Pch_mv(NODE arg,P *rp)
1.1 noro 1032: {
1033: change_mvar(CO,(P)ARG0(arg),VR((P)ARG1(arg)),rp);
1034: }
1035:
1.16 noro 1036: void Pre_mv(NODE arg,P *rp)
1.1 noro 1037: {
1038: restore_mvar(CO,(P)ARG0(arg),VR((P)ARG1(arg)),rp);
1039: }
1040:
1.16 noro 1041: void change_mvar(VL vl,P p,V v,P *r)
1.1 noro 1042: {
1043: Q d;
1044: DCP dc,dc0;
1045: NODE dl;
1046:
1047: if ( !p || NUM(p) || (VR(p) == v) )
1048: *r = p;
1049: else {
1050: getdeglist(p,v,&dl);
1051: for ( dc0 = 0; dl; dl = NEXT(dl) ) {
1052: NEXTDC(dc0,dc); DEG(dc) = d = (Q)BDY(dl);
1053: getcoef(vl,p,v,d,&COEF(dc));
1054: }
1055: NEXT(dc) = 0; MKP(v,dc0,*r);
1056: }
1057: }
1058:
1.16 noro 1059: void restore_mvar(VL vl,P p,V v,P *r)
1.1 noro 1060: {
1061: P s,u,a,b,x;
1062: DCP dc;
1063:
1064: if ( !p || NUM(p) || (VR(p) != v) )
1065: *r = p;
1066: else {
1067: MKV(v,x);
1068: for ( dc = DC(p), s = 0; dc; dc = NEXT(dc) ) {
1069: pwrp(vl,x,DEG(dc),&u); mulp(vl,COEF(dc),u,&a);
1070: addp(vl,s,a,&b); s = b;
1071: }
1072: *r = s;
1073: }
1074: }
1075:
1.16 noro 1076: void getdeglist(P p,V v,NODE *d)
1.1 noro 1077: {
1078: NODE n,n0,d0,d1,d2;
1079: DCP dc;
1080:
1081: if ( !p || NUM(p) ) {
1082: MKNODE(n,0,0); *d = n;
1083: } else if ( VR(p) == v ) {
1084: for ( n0 = 0, dc = DC(p); dc; dc = NEXT(dc) ) {
1085: NEXTNODE(n0,n); BDY(n) = (pointer)DEG(dc);
1086: }
1087: NEXT(n) = 0; *d = n0;
1088: } else {
1089: for ( dc = DC(p), d0 = 0; dc; dc = NEXT(dc) ) {
1090: getdeglist(COEF(dc),v,&d1); mergedeglist(d0,d1,&d2); d0 = d2;
1091: }
1092: *d = d0;
1093: }
1094: }
1.16 noro 1095:
1096: void Pmergelist(NODE arg,LIST *rp)
1.1 noro 1097: {
1098: NODE n;
1099:
1100: asir_assert(ARG0(arg),O_LIST,"mergelist");
1101: asir_assert(ARG1(arg),O_LIST,"mergelist");
1102: mergedeglist(BDY((LIST)ARG0(arg)),BDY((LIST)ARG1(arg)),&n);
1103: MKLIST(*rp,n);
1104: }
1105:
1.16 noro 1106: void mergedeglist(NODE d0,NODE d1,NODE *dr)
1.1 noro 1107: {
1108: NODE t0,t,dt;
1109: Q d;
1110: int c;
1111:
1112: if ( !d0 )
1113: *dr = d1;
1114: else {
1115: while ( d1 ) {
1116: dt = d1; d1 = NEXT(d1); d = (Q)BDY(dt);
1117: for ( t0 = 0, t = d0; t; t0 = t, t = NEXT(t) ) {
1118: c = cmpq(d,(Q)BDY(t));
1119: if ( !c )
1120: break;
1121: else if ( c > 0 ) {
1122: if ( !t0 ) {
1123: NEXT(dt) = d0; d0 = dt;
1124: } else {
1125: NEXT(t0) = dt; NEXT(dt) = t;
1126: }
1127: break;
1128: }
1129: }
1130: if ( !t ) {
1131: NEXT(t0) = dt; *dr = d0; return;
1132: }
1133: }
1134: *dr = d0;
1135: }
1136: }
1137:
1.16 noro 1138: void Pptomp(NODE arg,P *rp)
1.1 noro 1139: {
1140: ptomp(QTOS((Q)ARG1(arg)),(P)ARG0(arg),rp);
1141: }
1142:
1.16 noro 1143: void Pmptop(NODE arg,P *rp)
1.1 noro 1144: {
1145: mptop((P)ARG0(arg),rp);
1146: }
1147:
1.16 noro 1148: void Pptolmp(NODE arg,P *rp)
1.1 noro 1149: {
1150: ptolmp((P)ARG0(arg),rp);
1151: }
1152:
1.16 noro 1153: void Plmptop(NODE arg,P *rp)
1.1 noro 1154: {
1155: lmptop((P)ARG0(arg),rp);
1.11 noro 1156: }
1157:
1.16 noro 1158: void Psf_galois_action(NODE arg,P *rp)
1.11 noro 1159: {
1160: sf_galois_action(ARG0(arg),ARG1(arg),rp);
1.12 noro 1161: }
1162:
1163: /*
1164: sf_embed(F,B,PM)
1165: F : an element of GF(pn)
1166: B : the image of the primitive root of GF(pn)
1167: PM : order of GF(pm)
1168: */
1169:
1.16 noro 1170: void Psf_embed(NODE arg,P *rp)
1.12 noro 1171: {
1172: int k,pm;
1173:
1174: /* GF(pn)={0,1,a,a^2,...}->GF(pm)={0,1,b,b^2,...}; a->b^k */
1175: k = CONT((GFS)ARG1(arg));
1176: pm = QTOS((Q)ARG2(arg));
1177: sf_embed((P)ARG0(arg),k,pm,rp);
1.13 noro 1178: }
1179:
1.16 noro 1180: void Psf_log(NODE arg,Q *rp)
1.13 noro 1181: {
1182: int k;
1183:
1184: if ( !ARG0(arg) )
1185: error("sf_log : invalid armument");
1186: k = CONT((GFS)ARG0(arg));
1187: STOQ(k,*rp);
1.12 noro 1188: }
1189:
1.16 noro 1190: void Psf_find_root(NODE arg,GFS *rp)
1.12 noro 1191: {
1192: P p;
1193: Obj t;
1194: int d;
1195: UM u;
1196: int *root;
1197:
1198: p = (P)ARG0(arg);
1199: simp_ff((Obj)p,&t); p = (P)t;
1200: d = getdeg(VR(p),p);
1201: u = W_UMALLOC(d);
1202: ptosfum(p,u);
1203: root = (int *)ALLOCA(d*sizeof(int));
1204: find_rootsf(u,root);
1205: MKGFS(IFTOF(root[0]),*rp);
1206: }
1207:
1.16 noro 1208: void Psf_minipoly(NODE arg,P *rp)
1.12 noro 1209: {
1210: Obj t;
1211: P p1,p2;
1212: int d1,d2;
1213: UM up1,up2,m;
1214:
1215: p1 = (P)ARG0(arg); simp_ff((Obj)p1,&t); p1 = (P)t;
1216: p2 = (P)ARG1(arg); simp_ff((Obj)p2,&t); p2 = (P)t;
1217: d1 = getdeg(VR(p1),p1); up1 = W_UMALLOC(d1); ptosfum(p1,up1);
1218: d2 = getdeg(VR(p2),p2); up2 = W_UMALLOC(d2); ptosfum(p2,up2);
1219: m = W_UMALLOC(d2);
1220: minipolysf(up1,up2,m);
1221: sfumtop(VR(p2),m,&p1);
1222: sfptop(p1,rp);
1.11 noro 1223: }
1224:
1.16 noro 1225: void Pptosfp(NODE arg,P *rp)
1.11 noro 1226: {
1227: ptosfp(ARG0(arg),rp);
1.6 noro 1228: }
1229:
1.16 noro 1230: void Psfptop(NODE arg,P *rp)
1.6 noro 1231: {
1232: sfptop((P)ARG0(arg),rp);
1.18 noro 1233: }
1234:
1235: void Psfptopsfp(NODE arg,P *rp)
1236: {
1237: sfptopsfp((P)ARG0(arg),VR((P)ARG1(arg)),rp);
1.1 noro 1238: }
1239:
1.16 noro 1240: void Pptogf2n(NODE arg,GF2N *rp)
1.1 noro 1241: {
1242: ptogf2n((Obj)ARG0(arg),rp);
1243: }
1244:
1.16 noro 1245: void Pgf2ntop(NODE arg,P *rp)
1.1 noro 1246: {
1247: if ( argc(arg) == 2 )
1248: up2_var = VR((P)ARG1(arg));
1249: gf2ntop((GF2N)ARG0(arg),rp);
1250: }
1251:
1.16 noro 1252: void Pgf2ntovect(NODE arg,VECT *rp)
1.1 noro 1253: {
1254: gf2ntovect((GF2N)ARG0(arg),rp);
1255: }
1256:
1.16 noro 1257: void Pptogfpn(NODE arg,GFPN *rp)
1.1 noro 1258: {
1259: ptogfpn((Obj)ARG0(arg),rp);
1260: }
1261:
1.16 noro 1262: void Pgfpntop(NODE arg,P *rp)
1.1 noro 1263: {
1264: if ( argc(arg) == 2 )
1265: up_var = VR((P)ARG1(arg));
1266: gfpntop((GFPN)ARG0(arg),rp);
1267: }
1268:
1.16 noro 1269: void Pureverse(NODE arg,P *rp)
1.1 noro 1270: {
1271: UP p,r;
1272:
1273: ptoup((P)ARG0(arg),&p);
1.3 noro 1274: if ( argc(arg) == 1 )
1275: reverseup(p,p->d,&r);
1276: else
1277: reverseup(p,QTOS((Q)ARG1(arg)),&r);
1.1 noro 1278: uptop(r,rp);
1279: }
1280:
1.16 noro 1281: void Putrunc(NODE arg,P *rp)
1.1 noro 1282: {
1283: UP p,r;
1284:
1285: ptoup((P)ARG0(arg),&p);
1286: truncup(p,QTOS((Q)ARG1(arg))+1,&r);
1287: uptop(r,rp);
1288: }
1289:
1.16 noro 1290: void Pudecomp(NODE arg,LIST *rp)
1.1 noro 1291: {
1292: P u,l;
1293: UP p,up,low;
1294: NODE n0,n1;
1295:
1296: ptoup((P)ARG0(arg),&p);
1297: decompup(p,QTOS((Q)ARG1(arg))+1,&low,&up);
1298: uptop(low,&l);
1299: uptop(up,&u);
1300: MKNODE(n1,u,0); MKNODE(n0,l,n1);
1301: MKLIST(*rp,n0);
1302: }
1303:
1.16 noro 1304: void Purembymul(NODE arg,P *rp)
1.1 noro 1305: {
1306: UP p1,p2,r;
1307:
1308: if ( !ARG0(arg) || !ARG1(arg) )
1309: *rp = 0;
1310: else {
1311: ptoup((P)ARG0(arg),&p1);
1312: ptoup((P)ARG1(arg),&p2);
1313: rembymulup(p1,p2,&r);
1314: uptop(r,rp);
1315: }
1316: }
1317:
1318: /*
1319: * d1 = deg(p1), d2 = deg(p2)
1320: * d1 <= 2*d2-1
1321: * p2*inv = 1 mod x^d2
1322: */
1323:
1.16 noro 1324: void Purembymul_precomp(NODE arg,P *rp)
1.1 noro 1325: {
1326: UP p1,p2,inv,r;
1327:
1328: if ( !ARG0(arg) || !ARG1(arg) )
1329: *rp = 0;
1330: else {
1331: ptoup((P)ARG0(arg),&p1);
1332: ptoup((P)ARG1(arg),&p2);
1333: ptoup((P)ARG2(arg),&inv);
1334: if ( p1->d >= 2*p2->d ) {
1335: error("urembymul_precomp : degree of 1st arg is too large");
1336: /* fprintf(stderr,"urembymul_precomp : degree of 1st arg is too large"); */
1337: remup(p1,p2,&r);
1338: } else
1339: hybrid_rembymulup_special(current_ff,p1,p2,inv,&r);
1340: uptop(r,rp);
1341: }
1342: }
1343:
1.16 noro 1344: void Puinvmod(NODE arg,P *rp)
1.1 noro 1345: {
1346: UP p,r;
1347:
1348: ptoup((P)ARG0(arg),&p);
1349: invmodup(p,QTOS((Q)ARG1(arg)),&r);
1350: uptop(r,rp);
1351: }
1352:
1.16 noro 1353: void Purevinvmod(NODE arg,P *rp)
1.1 noro 1354: {
1355: UP p,pr,r;
1356:
1357: ptoup((P)ARG0(arg),&p);
1358: reverseup(p,p->d,&pr);
1359: invmodup(pr,QTOS((Q)ARG1(arg)),&r);
1360: uptop(r,rp);
1361: }
1362:
1.16 noro 1363: void Ppwrmod_ff(NODE arg,P *rp)
1.1 noro 1364: {
1365: UP p1,p2;
1366:
1367: ptoup((P)ARG0(arg),&p1);
1368: switch ( current_ff ) {
1369: case FF_GFP:
1370: hybrid_powermodup(p1,&p2); break;
1371: case FF_GF2N:
1372: powermodup_gf2n(p1,&p2); break;
1373: case FF_GFPN:
1.10 noro 1374: case FF_GFS:
1.15 noro 1375: case FF_GFSN:
1.1 noro 1376: powermodup(p1,&p2); break;
1377: default:
1378: error("pwrmod_ff : current_ff is not set");
1379: }
1380: uptop(p2,rp);
1381: }
1382:
1.16 noro 1383: void Pgeneric_pwrmod_ff(NODE arg,P *rp)
1.1 noro 1384: {
1385: UP g,f,r;
1386:
1387: ptoup((P)ARG0(arg),&g);
1388: ptoup((P)ARG1(arg),&f);
1389: switch ( current_ff ) {
1390: case FF_GFP:
1391: hybrid_generic_powermodup(g,f,(Q)ARG2(arg),&r); break;
1392: case FF_GF2N:
1393: generic_powermodup_gf2n(g,f,(Q)ARG2(arg),&r); break;
1394: case FF_GFPN:
1.10 noro 1395: case FF_GFS:
1.15 noro 1396: case FF_GFSN:
1.1 noro 1397: generic_powermodup(g,f,(Q)ARG2(arg),&r); break;
1398: default:
1399: error("generic_pwrmod_ff : current_ff is not set");
1400: }
1401: uptop(r,rp);
1402: }
1403:
1.16 noro 1404: void Ppwrtab_ff(NODE arg,VECT *rp)
1.1 noro 1405: {
1406: UP f,xp;
1407: UP *tab;
1408: VECT r;
1409: int i,d;
1410:
1411: ptoup((P)ARG0(arg),&f);
1412: ptoup((P)ARG1(arg),&xp);
1413: d = f->d;
1414:
1415: tab = (UP *)ALLOCA(d*sizeof(UP));
1416: switch ( current_ff ) {
1417: case FF_GFP:
1418: hybrid_powertabup(f,xp,tab); break;
1419: case FF_GF2N:
1420: powertabup_gf2n(f,xp,tab); break;
1421: case FF_GFPN:
1.10 noro 1422: case FF_GFS:
1.15 noro 1423: case FF_GFSN:
1.1 noro 1424: powertabup(f,xp,tab); break;
1425: default:
1426: error("pwrtab_ff : current_ff is not set");
1427: }
1428: MKVECT(r,d); *rp = r;
1429: for ( i = 0; i < d; i++ )
1430: uptop(tab[i],(P *)&BDY(r)[i]);
1431: }
1432:
1.16 noro 1433: void Pkpwrmod_lm(NODE arg,P *rp)
1.1 noro 1434: {
1435: UP p1,p2;
1436:
1437: ptoup((P)ARG0(arg),&p1);
1438: powermodup(p1,&p2);
1439: uptop(p2,rp);
1440: }
1441:
1.16 noro 1442: void Pkgeneric_pwrmod_lm(NODE arg,P *rp)
1.1 noro 1443: {
1444: UP g,f,r;
1445:
1446: ptoup((P)ARG0(arg),&g);
1447: ptoup((P)ARG1(arg),&f);
1448: generic_powermodup(g,f,(Q)ARG2(arg),&r);
1449: uptop(r,rp);
1450: }
1451:
1.16 noro 1452: void Pkpwrtab_lm(NODE arg,VECT *rp)
1.1 noro 1453: {
1454: UP f,xp;
1455: UP *tab;
1456: VECT r;
1457: int i,d;
1458:
1459: ptoup((P)ARG0(arg),&f);
1460: ptoup((P)ARG1(arg),&xp);
1461: d = f->d;
1462:
1463: tab = (UP *)ALLOCA(d*sizeof(UP));
1464: powertabup(f,xp,tab);
1465: MKVECT(r,d); *rp = r;
1466: for ( i = 0; i < d; i++ )
1467: uptop(tab[i],(P *)&BDY(r)[i]);
1468: }
1469:
1.16 noro 1470: void Plazy_lm(NODE arg,Q *rp)
1.1 noro 1471: {
1472: lm_lazy = QTOS((Q)ARG0(arg));
1473: *rp = 0;
1474: }
1475:
1.16 noro 1476: void Pkmul(NODE arg,P *rp)
1.1 noro 1477: {
1478: P n1,n2;
1479:
1480: n1 = (P)ARG0(arg); n2 = (P)ARG1(arg);
1481: asir_assert(n1,O_P,"kmul");
1482: asir_assert(n2,O_P,"kmul");
1483: kmulp(CO,n1,n2,rp);
1484: }
1485:
1.16 noro 1486: void Pksquare(NODE arg,P *rp)
1.1 noro 1487: {
1488: P n1;
1489:
1490: n1 = (P)ARG0(arg);
1491: asir_assert(n1,O_P,"ksquare");
1492: ksquarep(CO,n1,rp);
1493: }
1494:
1.16 noro 1495: void Pktmul(NODE arg,P *rp)
1.1 noro 1496: {
1497: UP p1,p2,r;
1498:
1499: ptoup((P)ARG0(arg),&p1);
1500: ptoup((P)ARG1(arg),&p2);
1501: tkmulup(p1,p2,QTOS((Q)ARG2(arg))+1,&r);
1502: uptop(r,rp);
1503: }
1504:
1.16 noro 1505: void Pumul(NODE arg,P *rp)
1.1 noro 1506: {
1507: P a1,a2;
1508: UP p1,p2,r;
1509:
1510: a1 = (P)ARG0(arg); a2 = (P)ARG1(arg);
1511: if ( !a1 || !a2 || NUM(a1) || NUM(a2) )
1512: mulp(CO,a1,a2,rp);
1513: else {
1.16 noro 1514: if ( !uzpcheck((Obj)a1) || !uzpcheck((Obj)a2) || VR(a1) != VR(a2) )
1.1 noro 1515: error("umul : invalid argument");
1516: ptoup(a1,&p1);
1517: ptoup(a2,&p2);
1518: hybrid_mulup(0,p1,p2,&r);
1519: uptop(r,rp);
1520: }
1521: }
1522:
1.16 noro 1523: void Pusquare(NODE arg,P *rp)
1.1 noro 1524: {
1.16 noro 1525: UP p1,r;
1.1 noro 1526:
1527: ptoup((P)ARG0(arg),&p1);
1528: hybrid_squareup(0,p1,&r);
1529: uptop(r,rp);
1530: }
1531:
1.16 noro 1532: void Putmul(NODE arg,P *rp)
1.1 noro 1533: {
1534: UP p1,p2,r;
1535:
1536: ptoup((P)ARG0(arg),&p1);
1537: ptoup((P)ARG1(arg),&p2);
1538: hybrid_tmulup(0,p1,p2,QTOS((Q)ARG2(arg))+1,&r);
1539: uptop(r,rp);
1540: }
1541:
1.16 noro 1542: void Pumul_ff(NODE arg,Obj *rp)
1.1 noro 1543: {
1544: P a1,a2;
1545: UP p1,p2,r;
1546: P p;
1547:
1548: a1 = (P)ARG0(arg); a2 = (P)ARG1(arg);
1549: ptoup(a1,&p1);
1550: ptoup(a2,&p2);
1551: hybrid_mulup(current_ff,p1,p2,&r);
1552: uptop(r,&p);
1553: simp_ff((Obj)p,rp);
1554: }
1555:
1.16 noro 1556: void Pusquare_ff(NODE arg,Obj *rp)
1.1 noro 1557: {
1.16 noro 1558: UP p1,r;
1.1 noro 1559: P p;
1560:
1561: ptoup((P)ARG0(arg),&p1);
1562: hybrid_squareup(current_ff,p1,&r);
1563: uptop(r,&p);
1564: simp_ff((Obj)p,rp);
1565: }
1566:
1.16 noro 1567: void Putmul_ff(NODE arg,Obj *rp)
1.1 noro 1568: {
1569: UP p1,p2,r;
1570: P p;
1571:
1572: ptoup((P)ARG0(arg),&p1);
1573: ptoup((P)ARG1(arg),&p2);
1574: hybrid_tmulup(current_ff,p1,p2,QTOS((Q)ARG2(arg))+1,&r);
1575: uptop(r,&p);
1576: simp_ff((Obj)p,rp);
1577: }
1578:
1.16 noro 1579: void Phfmul_lm(NODE arg,P *rp)
1.1 noro 1580: {
1581: UP p1,p2,r;
1582: UP hi,lo,mid,t,s,p10,p11,p20,p21;
1583: unsigned int m,d;
1584: int i;
1585:
1586: ptoup((P)ARG0(arg),&p1);
1587: ptoup((P)ARG1(arg),&p2);
1588: d = MAX(p1->d,p2->d);
1589: for ( m = 1; m < d; m <<= 1 );
1590: if ( m > d )
1591: m >>= 1;
1592: if ( d-m < 10000 ) {
1593: decompup(p1,m,&p10,&p11); /* p1 = p11*x^m+p10 */
1594: decompup(p2,m,&p20,&p21); /* p2 = p21*x^m+p20 */
1595: fft_mulup_lm(p10,p20,&lo);
1596: kmulup(p11,p21,&hi);
1597: kmulup(p11,p20,&t); kmulup(p10,p21,&s); addup(t,s,&mid);
1598: r = UPALLOC(2*d);
1599: bzero((char *)COEF(r),(2*d+1)*sizeof(Num));
1600: if ( lo )
1601: bcopy((char *)COEF(lo),(char *)COEF(r),(DEG(lo)+1)*sizeof(Num));
1602: if ( hi )
1603: bcopy((char *)COEF(hi),(char *)(COEF(r)+2*m),(DEG(hi)+1)*sizeof(Num));
1604: for ( i = 2*d; i >= 0 && !COEF(r)[i]; i-- );
1605: if ( i < 0 )
1606: r = 0;
1607: else {
1608: DEG(r) = i;
1609: t = UPALLOC(DEG(mid)+m); DEG(t) = DEG(mid)+m;
1610: bzero((char *)COEF(t),(DEG(mid)+m+1)*sizeof(Num));
1611: bcopy((char *)COEF(mid),(char *)(COEF(t)+m),(DEG(mid)+1)*sizeof(Num));
1612: addup(t,r,&s);
1613: r = s;
1614: }
1615: } else
1616: fft_mulup_lm(p1,p2,&r);
1617: uptop(r,rp);
1618: }
1619:
1.16 noro 1620: void Pfmultest(NODE arg,LIST *rp)
1.1 noro 1621: {
1622: P p1,p2,r;
1623: int d1,d2;
1624: UM w1,w2,wr;
1625: unsigned int *f1,*f2,*fr,*w;
1626: int index,mod,root,d,maxint,i;
1627: int cond;
1628: Q prime;
1629: NODE n0,n1;
1630:
1631: p1 = (P)ARG0(arg); p2 = (P)ARG1(arg); index = QTOS((Q)ARG2(arg));
1632: FFT_primes(index,&mod,&root,&d);
1633: maxint = 1<<d;
1634: d1 = UDEG(p1); d2 = UDEG(p2);
1635: if ( maxint < d1+d2+1 )
1636: *rp = 0;
1637: else {
1638: w1 = W_UMALLOC(d1); w2 = W_UMALLOC(d2);
1639: wr = W_UMALLOC(d1+d2);
1640: ptoum(mod,p1,w1); ptoum(mod,p2,w2);
1641: f1 = (unsigned int *)ALLOCA(maxint*sizeof(unsigned int));
1642: f2 = (unsigned int *)ALLOCA(maxint*sizeof(unsigned int));
1643: fr = (unsigned int *)ALLOCA(maxint*sizeof(unsigned int));
1644: w = (unsigned int *)ALLOCA(12*maxint*sizeof(unsigned int));
1645:
1646: for ( i = 0; i <= d1; i++ )
1647: f1[i] = (unsigned int)w1->c[i];
1648: for ( i = 0; i <= d2; i++ )
1649: f2[i] = (unsigned int)w2->c[i];
1650:
1651: cond = FFT_pol_product(d1,f1,d2,f2,fr,index,w);
1652: if ( cond )
1653: error("fmultest : ???");
1654: wr->d = d1+d2;
1655: for ( i = 0; i <= d1+d2; i++ )
1656: wr->c[i] = (unsigned int)fr[i];
1657: umtop(VR(p1),wr,&r);
1658: STOQ(mod,prime);
1659: MKNODE(n1,prime,0);
1660: MKNODE(n0,r,n1);
1661: MKLIST(*rp,n0);
1662: }
1663: }
1664:
1.16 noro 1665: void Pkmulum(NODE arg,P *rp)
1.1 noro 1666: {
1667: P p1,p2;
1668: int d1,d2,mod;
1669: UM w1,w2,wr;
1670:
1671: p1 = (P)ARG0(arg); p2 = (P)ARG1(arg); mod = QTOS((Q)ARG2(arg));
1672: d1 = UDEG(p1); d2 = UDEG(p2);
1673: w1 = W_UMALLOC(d1); w2 = W_UMALLOC(d2);
1674: wr = W_UMALLOC(d1+d2);
1675: ptoum(mod,p1,w1); ptoum(mod,p2,w2);
1676: kmulum(mod,w1,w2,wr);
1677: umtop(VR(p1),wr,rp);
1678: }
1679:
1.16 noro 1680: void Pksquareum(NODE arg,P *rp)
1.1 noro 1681: {
1682: P p1;
1683: int d1,mod;
1684: UM w1,wr;
1685:
1686: p1 = (P)ARG0(arg); mod = QTOS((Q)ARG1(arg));
1687: d1 = UDEG(p1);
1688: w1 = W_UMALLOC(d1);
1689: wr = W_UMALLOC(2*d1);
1690: ptoum(mod,p1,w1);
1691: kmulum(mod,w1,w1,wr);
1692: umtop(VR(p1),wr,rp);
1693: }
1694:
1.16 noro 1695: void Ptracemod_gf2n(NODE arg,P *rp)
1.1 noro 1696: {
1697: UP g,f,r;
1698:
1699: ptoup((P)ARG0(arg),&g);
1700: ptoup((P)ARG1(arg),&f);
1701: tracemodup_gf2n(g,f,(Q)ARG2(arg),&r);
1702: uptop(r,rp);
1.2 noro 1703: }
1704:
1.16 noro 1705: void Pumul_specialmod(NODE arg,P *rp)
1.2 noro 1706: {
1707: P a1,a2;
1708: UP p1,p2,r;
1709: int i,nmod;
1710: int *modind;
1711: NODE t,n;
1712:
1713: a1 = (P)ARG0(arg); a2 = (P)ARG1(arg);
1714: if ( !a1 || !a2 || NUM(a1) || NUM(a2) )
1715: mulp(CO,a1,a2,rp);
1716: else {
1.16 noro 1717: if ( !uzpcheck((Obj)a1) || !uzpcheck((Obj)a2) || VR(a1) != VR(a2) )
1.2 noro 1718: error("umul_specialmod : invalid argument");
1719: ptoup(a1,&p1);
1720: ptoup(a2,&p2);
1721: n = BDY((LIST)ARG2(arg));
1722: nmod = length(n);
1723: modind = (int *)MALLOC_ATOMIC(nmod*sizeof(int));
1724: for ( i = 0, t = n; i < nmod; i++, t = NEXT(t) )
1725: modind[i] = QTOS((Q)BDY(t));
1726: fft_mulup_specialmod_main(p1,p2,0,modind,nmod,&r);
1727: uptop(r,rp);
1728: }
1729: }
1730:
1.16 noro 1731: void Pusquare_specialmod(NODE arg,P *rp)
1.2 noro 1732: {
1733: P a1;
1734: UP p1,r;
1735: int i,nmod;
1736: int *modind;
1737: NODE t,n;
1738:
1739: a1 = (P)ARG0(arg);
1740: if ( !a1 || NUM(a1) )
1741: mulp(CO,a1,a1,rp);
1742: else {
1.16 noro 1743: if ( !uzpcheck((Obj)a1) )
1.2 noro 1744: error("usquare_specialmod : invalid argument");
1745: ptoup(a1,&p1);
1746: n = BDY((LIST)ARG1(arg));
1747: nmod = length(n);
1748: modind = (int *)MALLOC_ATOMIC(nmod*sizeof(int));
1749: for ( i = 0, t = n; i < nmod; i++, t = NEXT(t) )
1750: modind[i] = QTOS((Q)BDY(t));
1751: fft_mulup_specialmod_main(p1,p1,0,modind,nmod,&r);
1752: uptop(r,rp);
1753: }
1754: }
1755:
1.16 noro 1756: void Putmul_specialmod(NODE arg,P *rp)
1.2 noro 1757: {
1758: P a1,a2;
1759: UP p1,p2,r;
1760: int i,nmod;
1761: int *modind;
1762: NODE t,n;
1763:
1764: a1 = (P)ARG0(arg); a2 = (P)ARG1(arg);
1765: if ( !a1 || !a2 || NUM(a1) || NUM(a2) )
1766: mulp(CO,a1,a2,rp);
1767: else {
1.16 noro 1768: if ( !uzpcheck((Obj)a1) || !uzpcheck((Obj)a2) || VR(a1) != VR(a2) )
1.2 noro 1769: error("utmul_specialmod : invalid argument");
1770: ptoup(a1,&p1);
1771: ptoup(a2,&p2);
1772: n = BDY((LIST)ARG3(arg));
1773: nmod = length(n);
1774: modind = (int *)MALLOC_ATOMIC(nmod*sizeof(int));
1775: for ( i = 0, t = n; i < nmod; i++, t = NEXT(t) )
1776: modind[i] = QTOS((Q)BDY(t));
1777: fft_mulup_specialmod_main(p1,p2,QTOS((Q)ARG2(arg))+1,modind,nmod,&r);
1778: uptop(r,rp);
1779: }
1.1 noro 1780: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>