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