![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to C.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / engine|
Return to C.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / engine |
1.2 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.3 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.2 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.7 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/engine/C.c,v 1.6 2001/03/14 06:04:53 noro Exp $
1.2 noro 49: */
1.1 noro 50: #include "ca.h"
51: #include "inline.h"
52: #include "base.h"
53:
54: V up_var;
55:
56: /* binary has at least 32 leading 0 chars. */
57: void binaryton(binary,np)
58: char *binary;
59: N *np;
60: {
61: int i,w,len;
62: N n;
63: char buf[33];
64:
65: binary += strlen(binary)%32;
66: len = strlen(binary);
67: w = len/32; /* sufficient for holding binary */
68: n = NALLOC(w);
69: for ( i = 0; i < w; i++ ) {
70: strncpy(buf,binary+len-32*(i+1),32); buf[32] = 0;
71: n->b[i] = strtoul(buf,0,2);
72: }
73: for ( i = w-1; i >= 0 && !n->b[i]; i-- );
74: if ( i < 0 )
75: *np = 0;
76: else {
77: n->p = i+1;
78: *np = n;
79: }
80: }
81:
82: /* hex has at least 8 leading 0 chars. */
83: void hexton(hex,np)
84: char *hex;
85: N *np;
86: {
87: int i,w,len;
88: N n;
89: char buf[9];
90:
91: hex += strlen(hex)%8;
92: len = strlen(hex);
93: w = len/8; /* sufficient for holding hex */
94: n = NALLOC(w);
95: for ( i = 0; i < w; i++ ) {
96: strncpy(buf,hex+len-8*(i+1),8); buf[8] = 0;
97: n->b[i] = strtoul(buf,0,16);
98: }
99: for ( i = w-1; i >= 0 && !n->b[i]; i-- );
100: if ( i < 0 )
101: *np = 0;
102: else {
103: n->p = i+1;
104: *np = n;
105: }
106: }
107:
108: void ntobn(base,n,nrp)
109: int base;
110: N n,*nrp;
111: {
112: int i,d,plc;
113: unsigned int *c,*x,*w;
114: unsigned int r;
115: L m;
116: N nr;
117:
118: if ( !n ) {
119: *nrp = NULL;
120: return;
121: }
122:
123: d = PL(n);
124: w = BD(n);
125:
126: for ( i = 1, m = 1; m <= LBASE/(L)base; m *= base, i++ );
127:
128: c = (unsigned int *)W_ALLOC(d*i+1);
129: x = (unsigned int *)W_ALLOC(d+1);
130: for ( i = 0; i < d; i++ )
131: x[i] = w[i];
132: for ( plc = 0; d >= 1; plc++ ) {
133: for ( i = d - 1, r = 0; i >= 0; i-- ) {
134: DSAB((unsigned int)base,r,x[i],x[i],r)
135: }
136: c[plc] = r;
137: if ( !x[d-1] ) d--;
138: }
139:
140: *nrp = nr = NALLOC(plc); INITRC(nr);
141: PL(nr) = plc;
142: for ( i = 0; i < plc; i++ )
143: BD(nr)[i] = c[i];
144: }
145:
146: void bnton(base,n,nrp)
147: int base;
148: N n,*nrp;
149: {
150: unsigned int carry;
151: unsigned int *x,*w;
152: int i,j,d,plc;
153: N nr;
154:
155: if ( !n ) {
156: *nrp = 0;
157: return;
158: }
159:
160: d = PL(n);
161: w = BD(n);
162: x = (unsigned int *)W_ALLOC(d + 1);
163:
164: for ( plc = 0, i = d - 1; i >= 0; i-- ) {
165: for ( carry = w[i],j = 0; j < plc; j++ ) {
166: DMA(x[j],(unsigned int)base,carry,carry,x[j])
167: }
168: if ( carry ) x[plc++] = carry;
169: }
170: *nrp = nr = NALLOC(plc); INITRC(nr);
171: PL(nr) = plc;
172: for ( i = 0; i < plc; i++ )
173: BD(nr)[i] = x[i];
174: }
175:
176: void ptomp(m,p,pr)
177: int m;
178: P p;
179: P *pr;
180: {
181: DCP dc,dcr,dcr0;
182: Q q;
183: unsigned int a,b;
184: P t;
185: MQ s;
186:
187: if ( !p )
188: *pr = 0;
189: else if ( NUM(p) ) {
190: q = (Q)p;
191: a = rem(NM(q),m);
192: if ( a && (SGN(q) < 0) )
193: a = m-a;
194: b = !DN(q)?1:rem(DN(q),m);
195: if ( !b )
196: error("ptomp : denominator = 0");
197: a = dmar(a,invm(b,m),0,m); STOMQ(a,s); *pr = (P)s;
198: } else {
199: for ( dc = DC(p), dcr0 = 0; dc; dc = NEXT(dc) ) {
200: ptomp(m,COEF(dc),&t);
201: if ( t ) {
202: NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc); COEF(dcr) = t;
203: }
204: }
205: if ( !dcr0 )
206: *pr = 0;
207: else {
208: NEXT(dcr) = 0; MKP(VR(p),dcr0,*pr);
209: }
210: }
211: }
212:
213: void mptop(f,gp)
214: P f;
215: P *gp;
216: {
217: DCP dc,dcr,dcr0;
218: Q q;
219:
220: if ( !f )
221: *gp = 0;
222: else if ( NUM(f) )
223: STOQ(CONT((MQ)f),q),*gp = (P)q;
224: else {
225: for ( dc = DC(f), dcr0 = 0; dc; dc = NEXT(dc) ) {
226: NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc); mptop(COEF(dc),&COEF(dcr));
1.4 noro 227: }
228: NEXT(dcr) = 0; MKP(VR(f),dcr0,*gp);
229: }
230: }
231:
1.7 ! noro 232: void ptosfp(p,pr)
! 233: P p;
! 234: P *pr;
! 235: {
! 236: DCP dc,dcr,dcr0;
! 237: GFS a;
! 238: P t;
! 239:
! 240: if ( !p )
! 241: *pr = 0;
! 242: else if ( NUM(p) ) {
! 243: qtogfs((Q)p,&a); *pr = (P)a;
! 244: } else {
! 245: for ( dc = DC(p), dcr0 = 0; dc; dc = NEXT(dc) ) {
! 246: ptosfp(COEF(dc),&t);
! 247: if ( t ) {
! 248: NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc); COEF(dcr) = t;
! 249: }
! 250: }
! 251: if ( !dcr0 )
! 252: *pr = 0;
! 253: else {
! 254: NEXT(dcr) = 0; MKP(VR(p),dcr0,*pr);
! 255: }
! 256: }
! 257: }
! 258:
1.4 noro 259: void sfptop(f,gp)
260: P f;
261: P *gp;
262: {
263: DCP dc,dcr,dcr0;
264: Q q;
1.5 noro 265: MQ fq;
1.4 noro 266:
267: if ( !f )
268: *gp = 0;
269: else if ( NUM(f) ) {
1.5 noro 270: gfstomq((GFS)f,&fq);
271: STOQ(CONT(fq),q);
272: *gp = (P)q;
1.4 noro 273: } else {
274: for ( dc = DC(f), dcr0 = 0; dc; dc = NEXT(dc) ) {
275: NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc); sfptop(COEF(dc),&COEF(dcr));
1.1 noro 276: }
277: NEXT(dcr) = 0; MKP(VR(f),dcr0,*gp);
1.7 ! noro 278: }
! 279: }
! 280:
! 281: void sf_galois_action(p,e,pr)
! 282: P p;
! 283: Q e;
! 284: P *pr;
! 285: {
! 286: DCP dc,dcr,dcr0;
! 287: GFS a;
! 288: P t;
! 289:
! 290: if ( !p )
! 291: *pr = 0;
! 292: else if ( NUM(p) ) {
! 293: gfs_galois_action(p,e,&a); *pr = (P)a;
! 294: } else {
! 295: for ( dc = DC(p), dcr0 = 0; dc; dc = NEXT(dc) ) {
! 296: sf_galois_action(COEF(dc),e,&t);
! 297: if ( t ) {
! 298: NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc); COEF(dcr) = t;
! 299: }
! 300: }
! 301: if ( !dcr0 )
! 302: *pr = 0;
! 303: else {
! 304: NEXT(dcr) = 0; MKP(VR(p),dcr0,*pr);
! 305: }
1.1 noro 306: }
307: }
308:
309: void ptolmp(p,pr)
310: P p;
311: P *pr;
312: {
313: DCP dc,dcr,dcr0;
314: LM a;
315: P t;
316:
317: if ( !p )
318: *pr = 0;
319: else if ( NUM(p) ) {
320: qtolm((Q)p,&a); *pr = (P)a;
321: } else {
322: for ( dc = DC(p), dcr0 = 0; dc; dc = NEXT(dc) ) {
323: ptolmp(COEF(dc),&t);
324: if ( t ) {
325: NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc); COEF(dcr) = t;
326: }
327: }
328: if ( !dcr0 )
329: *pr = 0;
330: else {
331: NEXT(dcr) = 0; MKP(VR(p),dcr0,*pr);
332: }
333: }
334: }
335:
336: void lmptop(f,gp)
337: P f;
338: P *gp;
339: {
340: DCP dc,dcr,dcr0;
341: Q q;
342:
343: if ( !f )
344: *gp = 0;
345: else if ( NUM(f) ) {
346: NTOQ(((LM)f)->body,1,q); *gp = (P)q;
347: } else {
348: for ( dc = DC(f), dcr0 = 0; dc; dc = NEXT(dc) ) {
349: NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc); lmptop(COEF(dc),&COEF(dcr));
350: }
351: NEXT(dcr) = 0; MKP(VR(f),dcr0,*gp);
352: }
353: }
354:
355: void ptoum(m,f,wf)
356: int m;
357: P f;
358: UM wf;
359: {
360: unsigned int r;
361: int i;
362: DCP dc;
363:
364: for ( i = UDEG(f); i >= 0; i-- )
365: COEF(wf)[i] = 0;
366:
367: for ( dc = DC(f); dc; dc = NEXT(dc) ) {
368: r = rem(NM((Q)COEF(dc)),m);
369: if ( r && (SGN((Q)COEF(dc)) < 0) )
370: r = m-r;
371: COEF(wf)[QTOS(DEG(dc))] = r;
372: }
373: degum(wf,UDEG(f));
374: }
375:
376: void umtop(v,w,f)
377: V v;
378: UM w;
379: P *f;
380: {
381: int *c;
382: DCP dc,dc0;
383: int i;
384: Q q;
385:
386: if ( DEG(w) < 0 )
387: *f = 0;
388: else if ( DEG(w) == 0 )
389: STOQ(COEF(w)[0],q), *f = (P)q;
390: else {
391: for ( i = DEG(w), c = COEF(w), dc0 = 0; i >= 0; i-- )
392: if ( c[i] ) {
393: NEXTDC(dc0,dc);
394: STOQ(i,DEG(dc));
395: STOQ(c[i],q), COEF(dc) = (P)q;
396: }
397: NEXT(dc) = 0;
398: MKP(v,dc0,*f);
399: }
400: }
401:
402: void ptoup(n,nr)
403: P n;
404: UP *nr;
405: {
406: DCP dc;
407: UP r;
408: int d;
409:
410: if ( !n )
411: *nr = 0;
412: else if ( OID(n) == O_N ) {
413: *nr = r = UPALLOC(0);
414: DEG(r) = 0; COEF(r)[0] = (Num)n;
415: } else {
416: d = UDEG(n);
417: up_var = VR(n);
418: *nr = r = UPALLOC(d); DEG(r) = d;
419: for ( dc = DC(n); dc; dc = NEXT(dc) ) {
420: COEF(r)[QTOS(DEG(dc))] = (Num)COEF(dc);
421: }
422: }
423: }
424:
425: void uptop(n,nr)
426: UP n;
427: P *nr;
428: {
429: int i;
430: DCP dc0,dc;
431:
432: if ( !n )
433: *nr = 0;
434: else if ( !DEG(n) )
435: *nr = (P)COEF(n)[0];
436: else {
437: for ( i = DEG(n), dc0 = 0; i >= 0; i-- )
438: if ( COEF(n)[i] ) {
439: NEXTDC(dc0,dc); STOQ(i,DEG(dc)); COEF(dc) = (P)COEF(n)[i];
440: }
441: if ( !up_var )
442: up_var = CO->v;
443: MKP(up_var,dc0,*nr);
444: }
445: }
446:
447: void ulmptoum(m,f,wf)
448: int m;
449: UP f;
450: UM wf;
451: {
452: int i,d;
453: LM *c;
454:
455: if ( !f )
456: wf->d = -1;
457: else {
458: wf->d = d = f->d;
459: c = (LM *)f->c;
460: for ( i = 0, d = f->d; i <= d; i++ )
461: COEF(wf)[i] = rem(c[i]->body,m);
462: }
463: }
464:
465: void objtobobj(base,p,rp)
466: int base;
467: Obj p;
468: Obj *rp;
469: {
470: if ( !p )
471: *rp = 0;
472: else
473: switch ( OID(p) ) {
474: case O_N:
475: numtobnum(base,(Num)p,(Num *)rp); break;
476: case O_P:
477: ptobp(base,(P)p,(P *)rp); break;
478: case O_LIST:
479: listtoblist(base,(LIST)p,(LIST *)rp); break;
480: case O_VECT:
481: vecttobvect(base,(VECT)p,(VECT *)rp); break;
482: case O_MAT:
483: mattobmat(base,(MAT)p,(MAT *)rp); break;
484: case O_STR:
485: *rp = p; break;
486: case O_COMP: default:
487: error("objtobobj : not implemented"); break;
488: }
489: }
490:
491: void bobjtoobj(base,p,rp)
492: int base;
493: Obj p;
494: Obj *rp;
495: {
496: if ( !p )
497: *rp = 0;
498: else
499: switch ( OID(p) ) {
500: case O_N:
501: bnumtonum(base,(Num)p,(Num *)rp); break;
502: case O_P:
503: bptop(base,(P)p,(P *)rp); break;
504: case O_LIST:
505: blisttolist(base,(LIST)p,(LIST *)rp); break;
506: case O_VECT:
507: bvecttovect(base,(VECT)p,(VECT *)rp); break;
508: case O_MAT:
509: bmattomat(base,(MAT)p,(MAT *)rp); break;
510: case O_STR:
511: *rp = p; break;
512: case O_COMP: default:
513: error("bobjtoobj : not implemented"); break;
514: }
515: }
516:
517: void numtobnum(base,p,rp)
518: int base;
519: Num p;
520: Num *rp;
521: {
522: N nm,dn,body;
523: Q q;
524: LM l;
525:
526: if ( !p )
527: *rp = 0;
528: else
529: switch ( NID(p) ) {
530: case N_Q:
531: ntobn(base,NM((Q)p),&nm);
532: if ( DN((Q)p) ) {
533: ntobn(base,DN((Q)p),&dn);
534: NDTOQ(nm,dn,SGN((Q)p),q);
535: } else
536: NTOQ(nm,SGN((Q)p),q);
537: *rp = (Num)q;
538: break;
539: case N_R:
540: *rp = p; break;
541: case N_LM:
542: ntobn(base,((LM)p)->body,&body);
543: MKLM(body,l); *rp = (Num)l;
544: break;
545: default:
546: error("numtobnum : not implemented"); break;
547: }
548: }
549:
550: void bnumtonum(base,p,rp)
551: int base;
552: Num p;
553: Num *rp;
554: {
555: N nm,dn,body;
556: Q q;
557: LM l;
558:
559: if ( !p )
560: *rp = 0;
561: else
562: switch ( NID(p) ) {
563: case N_Q:
564: bnton(base,NM((Q)p),&nm);
565: if ( DN((Q)p) ) {
566: bnton(base,DN((Q)p),&dn);
567: NDTOQ(nm,dn,SGN((Q)p),q);
568: } else
569: NTOQ(nm,SGN((Q)p),q);
570: *rp = (Num)q;
571: break;
572: case N_R:
573: *rp = p; break;
574: case N_LM:
575: bnton(base,((LM)p)->body,&body);
576: MKLM(body,l); *rp = (Num)l;
577: break;
578: default:
579: error("bnumtonum : not implemented"); break;
580: }
581: }
582:
583: void ptobp(base,p,rp)
584: int base;
585: P p;
586: P *rp;
587: {
588: DCP dcr0,dcr,dc;
589:
590: if ( !p )
591: *rp = p;
592: else {
593: for ( dcr0 = 0, dc = DC(p); dc; dc = NEXT(dc) ) {
594: NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc);
595: objtobobj(base,(Obj)COEF(dc),(Obj *)&COEF(dcr));
596: }
597: NEXT(dcr) = 0;
598: MKP(VR(p),dcr0,*rp);
599: }
600: }
601:
602: void bptop(base,p,rp)
603: int base;
604: P p;
605: P *rp;
606: {
607: DCP dcr0,dcr,dc;
608:
609: if ( !p )
610: *rp = p;
611: else {
612: for ( dcr0 = 0, dc = DC(p); dc; dc = NEXT(dc) ) {
613: NEXTDC(dcr0,dcr); DEG(dcr) = DEG(dc);
614: bobjtoobj(base,(Obj)COEF(dc),(Obj *)&COEF(dcr));
615: }
616: NEXT(dcr) = 0;
617: MKP(VR(p),dcr0,*rp);
618: }
619: }
620:
621: void listtoblist(base,p,rp)
622: int base;
623: LIST p;
624: LIST *rp;
625: {
626: NODE nr0,nr,n;
627:
628: if ( !p )
629: *rp = p;
630: else {
631: for ( nr0 = 0, n = BDY(p); n; n = NEXT(n) ) {
632: NEXTNODE(nr0,nr);
633: objtobobj(base,BDY(n),(Obj *)&BDY(nr));
634: }
635: NEXT(nr) = 0;
636: MKLIST(*rp,nr0);
637: }
638: }
639:
640: void blisttolist(base,p,rp)
641: int base;
642: LIST p;
643: LIST *rp;
644: {
645: NODE nr0,nr,n;
646:
647: if ( !p )
648: *rp = p;
649: else {
650: for ( nr0 = 0, n = BDY(p); n; n = NEXT(n) ) {
651: NEXTNODE(nr0,nr);
652: bobjtoobj(base,BDY(n),(Obj *)&BDY(nr));
653: }
654: NEXT(nr) = 0;
655: MKLIST(*rp,nr0);
656: }
657: }
658:
659: void vecttobvect(base,p,rp)
660: int base;
661: VECT p;
662: VECT *rp;
663: {
664: int i,l;
665: VECT r;
666:
667: if ( !p )
668: *rp = p;
669: else {
670: l = p->len;
671: MKVECT(r,l); *rp = r;
672: for ( i = 0; i < l; i++ )
673: objtobobj(base,p->body[i],(Obj *)&r->body[i]);
674: }
675: }
676:
677: void bvecttovect(base,p,rp)
678: int base;
679: VECT p;
680: VECT *rp;
681: {
682: int i,l;
683: VECT r;
684:
685: if ( !p )
686: *rp = p;
687: else {
688: l = p->len;
689: MKVECT(r,l); *rp = r;
690: for ( i = 0; i < l; i++ )
691: bobjtoobj(base,p->body[i],(Obj *)&r->body[i]);
692: }
693: }
694:
695: void mattobmat(base,p,rp)
696: int base;
697: MAT p;
698: MAT *rp;
699: {
700: int row,col,i,j;
701: MAT r;
702:
703: if ( !p )
704: *rp = p;
705: else {
706: row = p->row; col = p->col;
707: MKMAT(r,row,col); *rp = r;
708: for ( i = 0; i < row; i++ )
709: for ( j = 0; i < col; j++ )
710: objtobobj(base,p->body[i][j],(Obj *)&r->body[i][j]);
711: }
712: }
713:
714: void bmattomat(base,p,rp)
715: int base;
716: MAT p;
717: MAT *rp;
718: {
719: int row,col,i,j;
720: MAT r;
721:
722: if ( !p )
723: *rp = p;
724: else {
725: row = p->row; col = p->col;
726: MKMAT(r,row,col); *rp = r;
727: for ( i = 0; i < row; i++ )
728: for ( j = 0; i < col; j++ )
729: bobjtoobj(base,p->body[i][j],(Obj *)&r->body[i][j]);
730: }
731: }
732:
733: void n32ton27(g,rp)
734: N g;
735: N *rp;
736: {
737: int i,j,k,l,r,bits,words;
738: unsigned int t;
739: unsigned int *a,*b;
740: N z;
741:
742: l = PL(g); a = BD(g);
743: for ( i = 31, t = a[l-1]; !(t&(1<<i)); i-- );
744: bits = (l-1)*32+i+1; words = (bits+26)/27;
745: *rp = z = NALLOC(words); PL(z) = words;
746: bzero((char *)BD(z),words*sizeof(unsigned int));
747: for ( j = 0, b = BD(z); j < words; j++ ) {
748: k = (27*j)/32; r = (27*j)%32;
749: if ( r > 5 )
750: b[j] = (a[k]>>r)|(k==(l-1)?0:((a[k+1]&((1<<(r-5))-1))<<(32-r)));
751: else
752: b[j] = (a[k]>>r)&((1<<27)-1);
753: }
754: if ( !(r = bits%27) )
755: r = 27;
756: b[words-1] &= ((1<<r)-1);
757: }
758:
759: void n27ton32(a,rp)
760: N a;
761: N *rp;
762: {
763: int i,j,k,l,r,bits,words;
764: unsigned int t;
765: unsigned int *b,*c;
766: N z;
767:
768: l = PL(a); b = BD(a);
769: for ( i = 26, t = b[l-1]; !(t&(1<<i)); i-- );
770: bits = (l-1)*27+i+1; words = (bits+31)/32;
771: *rp = z = NALLOC(words); PL(z) = words;
772: bzero((char *)BD(z),words*sizeof(unsigned int));
773: for ( j = 0, c = BD(z); j < l; j++ ) {
774: k = (27*j)/32; r = (27*j)%32;
775: if ( r > 5 ) {
776: c[k] |= (b[j]&((1<<(32-r))-1))<<r;
777: if ( k+1 < words )
778: c[k+1] = (b[j]>>(32-r));
779: } else
780: c[k] |= (b[j]<<r);
781: }
782: }
783:
784: void mptoum(p,pr)
785: P p;
786: UM pr;
787: {
788: DCP dc;
789:
790: if ( !p )
791: DEG(pr) = -1;
792: else if ( NUM(p) ) {
793: DEG(pr) = 0; COEF(pr)[0] = CONT((MQ)p);
794: } else {
795: bzero((char *)pr,(int)((UDEG(p)+2)*sizeof(int)));
796: for ( dc = DC(p); dc; dc = NEXT(dc) )
797: COEF(pr)[QTOS(DEG(dc))] = CONT((MQ)COEF(dc));
798: degum(pr,UDEG(p));
799: }
800: }
801:
802: void umtomp(v,p,pr)
803: V v;
804: UM p;
805: P *pr;
806: {
807: DCP dc,dc0;
808: int i;
809: MQ q;
810:
811: if ( !p || (DEG(p) < 0) )
812: *pr = 0;
813: else if ( !DEG(p) )
814: STOMQ(COEF(p)[0],q), *pr = (P)q;
815: else {
816: for ( dc0 = 0, i = DEG(p); i >= 0; i-- )
817: if ( COEF(p)[i] ) {
818: NEXTDC(dc0,dc); STOQ(i,DEG(dc));
819: STOMQ(COEF(p)[i],q), COEF(dc) = (P)q;
820: }
821: NEXT(dc) = 0; MKP(v,dc0,*pr);
822: }
1.6 noro 823: }
824:
825: /* f(p) -> f(x) */
826:
827: void enc_to_p(p,a,v,pr)
828: int p,a;
829: V v;
830: P *pr;
831: {
832: DCP dc,dct;
833: int i,c;
834: Q dq,cq;
835:
836: dc = 0;
837: for ( i = 0; a; i++, a /= p ) {
838: c = a%p;
839: if ( c ) {
840: STOQ(i,dq); STOQ(c,cq);
841: NEWDC(dct); DEG(dct) = dq; COEF(dct) = (P)cq;
842: NEXT(dct) = dc; dc = dct;
843: }
844: }
845: MKP(v,dc,*pr);
1.1 noro 846: }