Annotation of OpenXM_contrib2/asir2000/io/pexpr.c, Revision 1.9
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
1.4 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.3 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.
1.9 ! saito 47: * $OpenXM: OpenXM_contrib2/asir2000/io/pexpr.c,v 1.8 2000/12/16 06:16:10 noro Exp $
1.3 noro 48: */
1.1 noro 49: #include "ca.h"
50: #include "al.h"
51: #include "parse.h"
52: #include "comp.h"
53: #include "base.h"
54:
55: #ifndef FPRINT
56: #define FPRINT
57: #endif
58:
1.2 noro 59: #define PRINTHAT (fortran_output?PUTS("**"):PUTS("^"))
1.1 noro 60:
61: #ifdef FPRINT
62: FILE *asir_out;
63: #define OUT asir_out
64: char DFORMAT[BUFSIZ];
1.2 noro 65: int hex_output;
66: int fortran_output;
1.6 noro 67: int double_output;
1.1 noro 68:
69: #define TAIL
70: #define PUTS(s) fputs(s,OUT)
71: #define PRINTF fprintf
72: #define PRINTN printn
73: #define PRINTBF printbf
74: #define PRINTCPLX printcplx
75: #define PRINTLM printlm
76: #define PRINTUP2 printup2
77: #define PRINTV printv
78: #define PRINTEXPR printexpr
79: #define PRINTNUM printnum
80: #define PRINTP printp
81: #define PRINTR printr
82: #define PRINTLIST printlist
83: #define PRINTVECT printvect
84: #define PRINTMAT printmat
85: #define PRINTSTR printstr
86: #define PRINTCOMP printcomp
87: #define PRINTDP printdp
88: #define PRINTUI printui
89: #define PRINTGF2MAT printgf2mat
90: #define PRINTGFMMAT printgfmmat
1.5 noro 91: #define PRINTBYTEARRAY printbytearray
1.1 noro 92: #define PRINTERR printerr
93: #define PRINTLF printlf
94: #define PRINTLOP printlop
95: #define PRINTFOP printfop
96: #define PRINTEOP printeop
97: #define PRINTQOP printqop
98: #define PRINTUP printup
99: #endif
100:
101: #ifdef SPRINT
102: static char *buf;
103: #define OUT buf
104: extern char DFORMAT[BUFSIZ];
1.2 noro 105: extern int hex_output;
106: extern int fortran_output;
1.1 noro 107:
108: #define TAIL while ( *OUT ) OUT++;
109: #define PUTS(s) strcat(OUT,s)
110: #define PRINTF sprintf
111: #define PRINTN sprintn
112: #define PRINTBF sprintbf
113: #define PRINTCPLX sprintcplx
114: #define PRINTLM sprintlm
115: #define PRINTUP2 sprintup2
116: #define PRINTV sprintv
117: #define PRINTEXPR sprintexpr
118: #define PRINTNUM sprintnum
119: #define PRINTP sprintp
120: #define PRINTR sprintr
121: #define PRINTLIST sprintlist
122: #define PRINTVECT sprintvect
123: #define PRINTMAT sprintmat
124: #define PRINTSTR sprintstr
125: #define PRINTCOMP sprintcomp
126: #define PRINTDP sprintdp
127: #define PRINTUI sprintui
128: #define PRINTGF2MAT sprintgf2mat
129: #define PRINTGFMMAT sprintgfmmat
1.5 noro 130: #define PRINTBYTEARRAY sprintbytearray
1.1 noro 131: #define PRINTERR sprinterr
132: #define PRINTLF sprintlf
133: #define PRINTLOP sprintlop
134: #define PRINTFOP sprintfop
135: #define PRINTEOP sprinteop
136: #define PRINTQOP sprintqop
1.2 noro 137: #define PRINTUP sprintup
1.1 noro 138: #endif
139:
140: void PRINTEXPR();
141: void PRINTNUM();
142: void PRINTN();
143: void PRINTV();
144: void PRINTP();
145: void PRINTR();
146: void PRINTLIST();
147: void PRINTVECT();
148: void PRINTMAT();
149: void PRINTSTR();
150: void PRINTCOMP();
151: void PRINTDP();
152: void PRINTUI();
153: void PRINTGF2MAT();
154: void PRINTGFMMAT();
1.5 noro 155: void PRINTBYTEARRAY();
1.1 noro 156: void PRINTERR();
157: void PRINTCPLX();
158: void PRINTLM();
159: void PRINTLF();
1.2 noro 160: void PRINTUP2();
1.1 noro 161:
162: #ifdef FPRINT
163: void output_init() {
164: OUT = stdout;
165: sprintf(DFORMAT,"%%0%dd",DLENGTH);
166: }
167:
168: int mmono(p)
169: P p;
170: {
171: if ( NUM(p) )
1.9 ! saito 172: #if defined(INTERVAL)
! 173: if ( NID(p) != N_IP && NID(p) != N_ID && NID(p) != N_IT && NID(p) != N_IF
! 174: && compnum(CO,(Num)p,0) < 0 )
! 175: #else
1.1 noro 176: if ( compnum(CO,(Num)p,0) < 0 )
1.9 ! saito 177: #endif
1.1 noro 178: return ( 1 );
179: else
180: return ( 0 );
181: else if ( NEXT(DC(p)) )
182: return ( 0 );
183: else
184: return (mmono(COEF(DC(p))));
185: }
186:
187: #if PARI
188: void printbf(a)
189: BF a;
190: {
1.8 noro 191: sor(a->body,double_output ? 'f' : 'g',-1,0);
1.1 noro 192: }
193: #endif
194: #endif
195:
196: #ifdef SPRINT
197: void soutput_init(s)
198: char *s;
199: {
200: s[0] = 0; buf = s;
201: }
202:
203: #if PARI
1.8 noro 204: #include "genpari.h"
205:
206: void myoutbrute(g)
207: GEN g;
208: {
209: bruteall(g,'f',-1,1);
210: }
211:
1.1 noro 212: void sprintbf(a)
213: BF a;
214: {
1.2 noro 215: char *str;
216: char *GENtostr();
1.8 noro 217: char *GENtostr0();
1.2 noro 218:
1.8 noro 219: if ( double_output ) {
220: str = GENtostr0(a->body,myoutbrute);
221: } else {
222: str = GENtostr(a->body);
223: }
1.2 noro 224: TAIL PRINTF(OUT,"%s",str);
225: free(str);
1.1 noro 226: }
227: #endif
228: #endif
229:
230: void PRINTEXPR(vl,p)
231: VL vl;
232: Obj p;
233: {
234: if ( !p ) {
235: PRINTR(vl,(R)p);
236: return;
237: }
238:
239: switch ( OID(p) ) {
240: case O_N:
241: PRINTNUM((Num)p); break;
242: case O_P:
243: PRINTP(vl,(P)p); break;
244: case O_R:
245: PRINTR(vl,(R)p); break;
246: case O_LIST:
247: PRINTLIST(vl,(LIST)p); break;
248: case O_VECT:
249: PRINTVECT(vl,(VECT)p); break;
250: case O_MAT:
251: PRINTMAT(vl,(MAT)p); break;
252: case O_STR:
253: PRINTSTR((STRING)p); break;
254: case O_COMP:
255: PRINTCOMP(vl,(COMP)p); break;
256: case O_DP:
257: PRINTDP(vl,(DP)p); break;
258: case O_USINT:
259: PRINTUI(vl,(USINT)p); break;
260: case O_GF2MAT:
261: PRINTGF2MAT(vl,(GF2MAT)p); break;
262: case O_ERR:
263: PRINTERR(vl,(ERR)p); break;
264: case O_MATHCAP:
265: PRINTLIST(vl,((MATHCAP)p)->body); break;
266: case O_F:
267: PRINTLF(vl,(F)p); break;
268: case O_GFMMAT:
269: PRINTGFMMAT(vl,(GFMMAT)p); break;
1.5 noro 270: case O_BYTEARRAY:
271: PRINTBYTEARRAY(vl,(BYTEARRAY)p); break;
1.1 noro 272: default:
273: break;
274: }
275: }
276:
277: void PRINTN(n)
278: N n;
279: {
280: register int i,*ptr;
281: N tn;
282:
283: if ( !n ) {
284: PUTS("0");
285: return;
286: }
287: if ( hex_output ) {
288: ptr = BD(n);
289: TAIL PRINTF(OUT,"0x%x",ptr[PL(n)-1]);
290: if ( hex_output < 0 )
291: for ( i = PL(n) - 2; i >= 0; i-- ) {
292: TAIL PRINTF(OUT,"|%08x",ptr[i]);
293: }
294: else
295: for ( i = PL(n) - 2; i >= 0; i-- ) {
296: TAIL PRINTF(OUT,"%08x",ptr[i]);
297: }
298: } else {
299: ntobn(DBASE,n,&tn);
300: ptr = BD(tn);
301: TAIL PRINTF(OUT,"%d",ptr[PL(tn) - 1]);
302: for ( i = PL(tn) - 2; i >= 0; i-- ) {
303: TAIL PRINTF(OUT,DFORMAT,ptr[i]);
304: }
305: }
306: }
307:
1.9 ! saito 308: #if defined(ITVDEBUG)
! 309: void printbin(double z)
! 310: {
! 311: int i, j, mask;
! 312: union {
! 313: double x;
! 314: char c[8];
! 315: } a;
! 316:
! 317: a.x = z;
! 318: for(i=7;i>=0;i--) {
! 319: mask = 0x80;
! 320: for(j=0;j<8;j++) {
! 321: if (a.c[i] & mask) fprintf(stderr,"1");
! 322: else fprintf(stderr,"0");
! 323: mask >>= 1;
! 324: }
! 325: }
! 326: fprintf(stderr,"\n");
! 327: }
! 328: #endif
! 329:
! 330: #if 0
! 331: int printmode = PRINTF_E;
! 332: #else
! 333: int printmode = PRINTF_G;
! 334: #endif
! 335:
1.1 noro 336: void PRINTNUM(q)
337: Num q;
338: {
339: if ( !q ) {
340: PUTS("0");
341: return;
342: }
343: switch ( NID(q) ) {
344: case N_Q:
345: if ( SGN((Q)q) == -1 )
346: PUTS("-");
347: PRINTN(NM((Q)q));
348: if ( !INT((Q)q) ) {
349: PUTS("/"); PRINTN(DN((Q)q));
350: }
351: break;
352: case N_R:
1.9 ! saito 353: switch (printmode) {
! 354: case PRINTF_E:
! 355: #if defined(INTERVAL)
! 356: case MID_PRINTF_E:
! 357: #endif
! 358: TAIL PRINTF(OUT,"%.16e",BDY((Real)q));
! 359: break;
! 360: case PRINTF_G:
! 361: #if defined(INTERVAL)
! 362: case MID_PRINTF_G:
! 363: #endif
! 364: default:
! 365: TAIL PRINTF(OUT,"%g",BDY((Real)q));
! 366: break;
! 367: }
1.1 noro 368: break;
369: case N_A:
370: PUTS("("); PRINTR(ALG,(R)BDY((Alg)q)); PUTS(")");
371: break;
372: #if PARI
373: case N_B:
374: PRINTBF((BF)q); break;
375: #endif
1.9 ! saito 376: #if defined(INTERVAL)
! 377: case N_IP:
! 378: case N_IF:
! 379: PUTS("[");
! 380: PRINTNUM(INF((Itv)q));
! 381: PUTS(",");
! 382: PRINTNUM(SUP((Itv)q));
! 383: PUTS("]");
! 384: break;
! 385: case N_ID:
! 386: switch (printmode) {
! 387: case PRINTF_E:
! 388: TAIL PRINTF(OUT, "[%.16e,%.16e]",INF((ItvD)q),SUP((ItvD)q));
! 389: #if defined(ITVDEBUG)
! 390: printbin(INF((ItvD)q));
! 391: printbin(SUP((ItvD)q));
! 392: #endif
! 393: break;
! 394: case MID_PRINTF_G:
! 395: TAIL PRINTF(OUT, "<%g,%g>", (SUP((ItvD)q)+INF((ItvD)q))*0.5,(SUP((ItvD)q)-INF((ItvD)q))*0.5);
! 396: break;
! 397: case MID_PRINTF_E:
! 398: TAIL PRINTF(OUT, "<%.16e,%.16e>", (SUP((ItvD)q)+INF((ItvD)q))*0.5,(SUP((ItvD)q)-INF((ItvD)q))*0.5);
! 399: break;
! 400: case PRINTF_G:
! 401: default:
! 402: TAIL PRINTF(OUT, "[%g,%g]",INF((ItvD)q),SUP((ItvD)q));
! 403: break;
! 404: }
! 405: break;
! 406: #endif
1.1 noro 407: case N_C:
408: PRINTCPLX((C)q); break;
409: case N_M:
410: TAIL PRINTF(OUT,"%d",CONT((MQ)q)); break;
411: case N_LM:
412: PRINTN(((LM)q)->body); break;
413: case N_GF2N:
414: if ( hex_output )
415: PRINTN((N)(((GF2N)q)->body));
416: else
417: PRINTUP2(((GF2N)q)->body);
418: break;
419: case N_GFPN:
420: PRINTUP((UP)(((GFPN)q)->body));
421: break;
422: }
423: }
424:
425: void PRINTCPLX(a)
426: C a;
427: {
428: PUTS("(");
429: if ( a->r )
430: PRINTNUM(a->r);
431: if ( a->i ) {
1.9 ! saito 432: #if defined(INTERVAL)
! 433: if ( a->r && ((compnum(0,a->i,0) > 0)
! 434: || NID(a->i) == N_IP || NID(a->i) == N_ID
! 435: || NID(a->i) == N_IT || NID(a->i) == N_IF) )
! 436: #else
1.1 noro 437: if ( a->r && (compnum(0,a->i,0) > 0) )
1.9 ! saito 438: #endif
1.1 noro 439: PUTS("+");
440: PRINTNUM(a->i); PUTS("*@i");
441: }
442: PUTS(")");
443: }
444:
445: void PRINTP(vl,p)
446: VL vl;
447: P p;
448: {
449: V v;
450: DCP dc;
451:
452: if ( !p )
453: PUTS("0");
454: else if ( NUM(p) )
455: PRINTNUM((Num)p);
456: else
457: for ( dc = DC(p), v = VR(p); dc; dc = NEXT(dc) ) {
458: if ( !DEG(dc) )
459: PRINTP(vl,COEF(dc));
460: else {
461: if ( NUM(COEF(dc)) && UNIQ((Q)COEF(dc)) ) {
462: ;
463: } else if ( NUM(COEF(dc)) && MUNIQ((Q)COEF(dc)) )
464: PUTS("-");
465: else if ( NUM(COEF(dc)) || !NEXT(DC(COEF(dc)))) {
466: PRINTP(vl,COEF(dc)); PUTS("*");
467: } else {
468: PUTS("("); PRINTP(vl,COEF(dc)); PUTS(")*");
469: }
470: PRINTV(vl,v);
471: if ( cmpq(DEG(dc),ONE) ) {
1.2 noro 472: PRINTHAT;
1.1 noro 473: if ( INT(DEG(dc)) && SGN(DEG(dc))>0 )
474: PRINTNUM((Num)DEG(dc));
475: else {
476: PUTS("("); PRINTNUM((Num)DEG(dc)); PUTS(")");
477: }
478: }
479: }
480: if ( NEXT(dc) ) {
481: P t;
482:
483: t = COEF(NEXT(dc));
484: if (!DEG(NEXT(dc))) {
485: if ( NUM(t) ) {
486: if ( !mmono(t) )
487: PUTS("+");
488: } else {
489: if (!mmono(COEF(DC(t))))
490: PUTS("+");
491: }
492: } else {
493: if ( !mmono(t) )
494: PUTS("+");
495: }
496: }
497: }
498: }
499:
500: int hideargs;
501:
502: void PRINTV(vl,v)
503: VL vl;
504: V v;
505: {
506: PF pf;
507: PFAD ad;
508: int i;
509:
510: if ( NAME(v) )
511: PUTS(NAME(v));
512: else if ( (vid)v->attr == V_PF ) {
513: pf = ((PFINS)v->priv)->pf; ad = ((PFINS)v->priv)->ad;
514: if ( !strcmp(NAME(pf),"pow") ) {
1.2 noro 515: PUTS("("); PRINTR(vl,(R)ad[0].arg); PUTS(")"); PRINTHAT; PUTS("(");
1.1 noro 516: PRINTR(vl,(R)ad[1].arg); PUTS(")");
517: } else if ( !pf->argc ) {
518: TAIL PRINTF(OUT,"%s",NAME(pf));
519: } else {
520: if ( hideargs ) {
521: for ( i = 0; i < pf->argc; i++ )
522: if ( ad[i].d )
523: break;
524: if ( i < pf->argc ) {
525: TAIL PRINTF(OUT,"%s{%d",NAME(pf),ad[0].d);
526: for ( i = 1; i < pf->argc; i++ ) {
527: TAIL PRINTF(OUT,",%d",ad[i].d);
528: }
529: PUTS("}");
530: } else {
531: TAIL PRINTF(OUT,"%s",NAME(pf));
532: }
533: } else {
534: for ( i = 0; i < pf->argc; i++ )
535: if ( ad[i].d )
536: break;
537: if ( i < pf->argc ) {
538: TAIL PRINTF(OUT,"%s{%d",NAME(pf),ad[0].d);
539: for ( i = 1; i < pf->argc; i++ ) {
540: TAIL PRINTF(OUT,",%d",ad[i].d);
541: }
542: PUTS("}(");
543: } else {
544: TAIL PRINTF(OUT,"%s(",NAME(pf));
545: }
546: PRINTR(vl,(R)ad[0].arg);
547: for ( i = 1; i < pf->argc; i++ ) {
548: PUTS(","); PRINTR(vl,(R)ad[i].arg);
549: }
550: PUTS(")");
551: }
552: }
553: }
554: }
555:
556: void PRINTR(vl,a)
557: VL vl;
558: R a;
559: {
560: if ( !a )
561: PUTS("0");
562: else
563: switch (OID(a)) {
564: case O_N: case O_P:
565: PRINTP(vl,(P)a); break;
566: default:
567: PUTS("("); PRINTP(vl,NM((R)a)); PUTS(")/("); PRINTP(vl,DN((R)a)); PUTS(")");
568: break;
569: }
570: }
571:
572: void PRINTVECT(vl,vect)
573: VL vl;
574: VECT vect;
575: {
576: int i;
577: pointer *ptr;
578:
579: PUTS("[ ");
580: for ( i = 0, ptr = BDY(vect); i < vect->len; i++ ) {
581: PRINTEXPR(vl,ptr[i]); PUTS(" ");
582: }
583: PUTS("]");
584: }
585:
586: void PRINTMAT(vl,mat)
587: VL vl;
588: MAT mat;
589: {
590: int i,j,r,c;
591: pointer *ptr;
592:
593: for ( i = 0, r = mat->row, c = mat->col; i < r; i++ ) {
594: PUTS("[ ");
595: for ( j = 0, ptr = BDY(mat)[i]; j < c; j++ ) {
596: PRINTEXPR(vl,ptr[j]); PUTS(" ");
597: }
598: PUTS("]");
599: if ( i < r - 1 )
600: PUTS("\n");
601: }
602: }
603:
604: void PRINTLIST(vl,list)
605: VL vl;
606: LIST list;
607: {
608: NODE tnode;
609:
610: PUTS("[");
611: for ( tnode = (NODE)list->body; tnode; tnode = NEXT(tnode) ) {
612: PRINTEXPR(vl,tnode->body);
613: if ( NEXT(tnode) )
614: PUTS(",");
615: }
616: PUTS("]");
617: }
618:
619: void PRINTSTR(str)
620: STRING str;
621: {
622: char *p;
623:
624: for ( p = BDY(str); *p; p++ )
625: if ( *p == '"' )
626: PUTS("\"");
627: else {
628: TAIL PRINTF(OUT,"%c",*p);
629: }
630: }
631:
632: void PRINTCOMP(vl,c)
633: VL vl;
634: COMP c;
635: {
636: int n,i;
637:
638: n = getcompsize((int)c->type);
639: PUTS("{");
640: for ( i = 0; i < n; i++ ) {
641: PRINTEXPR(vl,(pointer)c->member[i]);
642: if ( i < n-1 )
643: PUTS(",");
644: }
645: PUTS("}");
646: }
647:
648: void PRINTDP(vl,d)
649: VL vl;
650: DP d;
651: {
652: int n,i;
653: MP m;
654: DL dl;
655:
656: for ( n = d->nv, m = BDY(d); m; m = NEXT(m) ) {
657: PUTS("("); PRINTEXPR(vl,(pointer)m->c); PUTS(")*<<");
658: for ( i = 0, dl = m->dl; i < n-1; i++ ) {
659: TAIL PRINTF(OUT,"%d,",dl->d[i]);
660: }
661: TAIL PRINTF(OUT,"%d",dl->d[i]);
662: PUTS(">>");
663: if ( NEXT(m) )
664: PUTS("+");
665: }
666: }
667:
668: void PRINTUI(vl,u)
669: VL vl;
670: USINT u;
671: {
672: TAIL PRINTF(OUT,"%u",BDY(u));
673: }
674:
675: void PRINTGF2MAT(vl,mat)
676: VL vl;
677: GF2MAT mat;
678: {
679: int row,col,w,i,j,k,m;
680: unsigned int t;
681: unsigned int **b;
682:
683: row = mat->row;
684: col = mat->col;
685: w = (col+BSH-1)/BSH;
686: b = mat->body;
687: for ( i = 0; i < row; i++ ) {
688: for ( j = 0, m = 0; j < w; j++ ) {
689: t = b[i][j];
690: for ( k = 0; m < col && k < BSH; k++, m++ )
691: if ( t & (1<<k) )
692: PUTS("1");
693: else
694: PUTS("0");
695: }
696: PUTS("\n");
697: }
698: }
699:
700: void PRINTGFMMAT(vl,mat)
701: VL vl;
702: GFMMAT mat;
703: {
704: int row,col,i,j;
705: unsigned int t;
706: unsigned int **b;
707:
708: row = mat->row;
709: col = mat->col;
710: b = mat->body;
711: for ( i = 0; i < row; i++ ) {
712: PUTS("[");
713: for ( j = 0; j < col; j++ ) {
714: TAIL PRINTF(OUT,"%8d",b[i][j]);
715: }
716: PUTS("]\n");
717: }
1.5 noro 718: }
719:
720: void PRINTBYTEARRAY(vl,array)
721: VL vl;
722: BYTEARRAY array;
723: {
724: int len,i;
725: unsigned int t;
726: unsigned char *b;
727:
728: len = array->len;
729: b = array->body;
730: PUTS("|");
731: for ( i = 0; i < len-1; i++ ) {
732: TAIL PRINTF(OUT,"%02x ",(unsigned int)b[i]);
733: }
734: TAIL PRINTF(OUT,"%02x",(unsigned int)b[i]);
735: PUTS("|");
1.1 noro 736: }
737:
738: void PRINTERR(vl,e)
739: VL vl;
740: ERR e;
741: {
742: PUTS("error("); PRINTEXPR(vl,e->body); PUTS(")");
743: }
744:
745: void PRINTUP2(p)
746: UP2 p;
747: {
748: int d,i;
749:
1.2 noro 750: if ( !p ) {
751: TAIL PRINTF(OUT,"0");
752: } else {
1.1 noro 753: d = degup2(p);
1.2 noro 754: TAIL PRINTF(OUT,"(");
755: if ( !d ) {
756: TAIL PRINTF(OUT,"1");
757: } else if ( d == 1 ) {
758: TAIL PRINTF(OUT,"@");
759: } else {
760: PUTS("@"); PRINTHAT; TAIL PRINTF(OUT,"%d",d);
761: }
1.1 noro 762: for ( i = d-1; i >= 0; i-- ) {
763: if ( p->b[i/BSH] & (1<<(i%BSH)) )
1.2 noro 764: if ( !i ) {
765: TAIL PRINTF(OUT,"+1");
766: } else if ( i == 1 ) {
767: TAIL PRINTF(OUT,"+@");
768: } else {
769: PUTS("+@"); PRINTHAT; TAIL PRINTF(OUT,"%d",i);
770: }
1.1 noro 771: }
1.2 noro 772: TAIL PRINTF(OUT,")");
1.1 noro 773: }
774: }
775:
776: void PRINTLF(vl,f)
777: VL vl;
778: F f;
779: {
780: switch ( FOP(f) ) {
781: case AL_TRUE:
782: TAIL PRINTF(OUT,"@true");
783: break;
784: case AL_FALSE:
785: TAIL PRINTF(OUT,"@false");
786: break;
787:
788: case AL_OR: case AL_AND:
789: PRINTFOP(vl,f); break;
790: case AL_NOT: case AL_IMPL: case AL_REPL: case AL_EQUIV:
791: PRINTEOP(vl,f); break;
792:
793: case AL_EQUAL: case AL_NEQ: case AL_LESSP:
794: case AL_GREATERP: case AL_LEQ: case AL_GEQ:
795: PRINTLOP(vl,f); break;
796:
797: case AL_EX: case AL_ALL:
798: PRINTQOP(vl,f); break;
799: default:
800: break;
801: }
802: }
803:
804: PRINTFOP(vl,f)
805: VL vl;
806: F f;
807: {
808: char *op;
809: NODE n;
810:
811: op = FOP(f)==AL_OR?" @|| ":" @&& ";
812: n = FJARG(f);
813: PUTS("("); PRINTEXPR(vl,BDY(n)); PUTS(")");
814: for ( n = NEXT(n); n; n = NEXT(n) ) {
815: PUTS(op); PUTS("("); PRINTEXPR(vl,BDY(n)); PUTS(")");
816: }
817: }
818:
819: PRINTEOP(vl,f)
820: VL vl;
821: F f;
822: {
823: oFOP op;
824: char *sop;
825:
826: if ( (op = FOP(f)) == AL_NOT ) {
827: PUTS("(@! "); PRINTEXPR(vl,(Obj)FARG(f)); PUTS(")"); return;
828: }
829: switch ( op ) {
830: case AL_IMPL:
831: sop = " @impl "; break;
832: case AL_REPL:
833: sop = " @repl "; break;
834: case AL_EQUIV:
835: sop = " @equiv "; break;
836: default:
837: break;
838: }
839: PUTS("(");
840: PRINTEXPR(vl,(Obj)FLHS(f));
841: PUTS(sop);
842: PRINTEXPR(vl,(Obj)FRHS(f));
843: PUTS(")");
844: }
845:
846: PRINTLOP(vl,f)
847: VL vl;
848: F f;
849: {
850: char *op;
851:
852: switch ( FOP(f) ) {
853: case AL_EQUAL:
854: op = " @== "; break;
855: case AL_NEQ:
856: op = " @!= "; break;
857: case AL_LESSP:
858: op = " @< "; break;
859: case AL_GREATERP:
860: op = " @> "; break;
861: case AL_LEQ:
862: op = " @<= "; break;
863: case AL_GEQ:
864: op = " @>= "; break;
865: default:
866: error("PRINTLOP : invalid operator");
867: break;
868: }
869: PRINTEXPR(vl,(Obj)FPL(f)); PUTS(op); PUTS("0");
870: }
871:
872: PRINTQOP(vl,f)
873: VL vl;
874: F f;
875: {
876: char *op;
877:
878: op = FOP(f)==AL_EX?"ex":"all";
879: TAIL PRINTF(OUT,"%s(%s,",op,NAME(FQVR(f)));
880: PRINTEXPR(vl,(Obj)FQMAT(f)); PUTS(")");
881: }
882:
883: PRINTUP(n)
884: UP n;
885: {
886: int i,d;
887:
888: if ( !n )
889: PUTS("0");
890: else if ( !n->d )
891: PRINTNUM(n->c[0]);
892: else {
893: d = n->d;
894: PUTS("(");
895: if ( !d ) {
896: PRINTNUM(n->c[d]);
897: } else if ( d == 1 ) {
898: PRINTNUM(n->c[d]);
899: PUTS("*@p");
900: } else {
901: PRINTNUM(n->c[d]);
1.2 noro 902: PUTS("*@p"); PRINTHAT; TAIL PRINTF(OUT,"%d",d);
1.1 noro 903: }
904: for ( i = d-1; i >= 0; i-- ) {
905: if ( n->c[i] ) {
906: PUTS("+("); PRINTNUM(n->c[i]); PUTS(")");
907: if ( i >= 2 ) {
1.2 noro 908: PUTS("*@p"); PRINTHAT; TAIL PRINTF(OUT,"%d",i);
1.1 noro 909: } else if ( i == 1 )
910: PUTS("*@p");
911: }
912: }
913: PUTS(")");
914: }
915: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>