version 1.1, 1999/12/03 07:39:11 |
version 1.26, 2006/08/27 22:17:28 |
|
|
/* $OpenXM: OpenXM/src/asir99/io/cpexpr.c,v 1.1.1.1 1999/11/10 08:12:30 noro Exp $ */ |
/* |
|
* Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED |
|
* All rights reserved. |
|
* |
|
* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited, |
|
* non-exclusive and royalty-free license to use, copy, modify and |
|
* redistribute, solely for non-commercial and non-profit purposes, the |
|
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and |
|
* conditions of this Agreement. For the avoidance of doubt, you acquire |
|
* only a limited right to use the SOFTWARE hereunder, and FLL or any |
|
* third party developer retains all rights, including but not limited to |
|
* copyrights, in and to the SOFTWARE. |
|
* |
|
* (1) FLL does not grant you a license in any way for commercial |
|
* purposes. You may use the SOFTWARE only for non-commercial and |
|
* non-profit purposes only, such as academic, research and internal |
|
* business use. |
|
* (2) The SOFTWARE is protected by the Copyright Law of Japan and |
|
* international copyright treaties. If you make copies of the SOFTWARE, |
|
* with or without modification, as permitted hereunder, you shall affix |
|
* to all such copies of the SOFTWARE the above copyright notice. |
|
* (3) An explicit reference to this SOFTWARE and its copyright owner |
|
* shall be made on your publication or presentation in any form of the |
|
* results obtained by use of the SOFTWARE. |
|
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
|
* e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification |
|
* for such modification or the source code of the modified part of the |
|
* SOFTWARE. |
|
* |
|
* THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL |
|
* MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND |
|
* EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS |
|
* FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES' |
|
* RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY |
|
* MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY. |
|
* UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT, |
|
* OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY |
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL |
|
* DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES |
|
* ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES |
|
* FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY |
|
* DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF |
|
* SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART |
|
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
|
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
|
* $OpenXM: OpenXM_contrib2/asir2000/io/cpexpr.c,v 1.25 2005/11/16 23:42:54 noro Exp $ |
|
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
|
#include "al.h" |
#include "base.h" |
#include "base.h" |
|
#if PARI |
|
#include "genpari.h" |
|
#endif |
|
|
|
#ifndef CPRINT |
|
#define CPRINT |
|
#endif |
|
|
|
extern int hex_output,fortran_output,double_output,real_digit; |
|
extern int hideargs,outputstyle; |
|
static int total_length; |
|
|
#define TAIL |
#define TAIL |
#define PUTS(s) (total_length+=strlen(s)) |
#define PUTS(s) (total_length+=strlen(s)) |
#define PRINTN length_n |
#define PRINTN length_n |
/* #define PRINTBF length_bf */ |
#define PRINTBF length_bf |
#define PRINTBF |
|
#define PRINTCPLX length_cplx |
#define PRINTCPLX length_cplx |
|
#define PRINTLM length_lm |
|
#define PRINTUP2 length_up2 |
#define PRINTV length_v |
#define PRINTV length_v |
#define PRINTEXPR length_expr |
#define PRINTEXPR length_expr |
#define PRINTNUM length_num |
#define PRINTNUM length_num |
|
|
#define PRINTSTR length_str |
#define PRINTSTR length_str |
#define PRINTCOMP length_comp |
#define PRINTCOMP length_comp |
#define PRINTDP length_dp |
#define PRINTDP length_dp |
|
#define PRINTUI length_ui |
|
#define PRINTGF2MAT length_gf2mat |
|
#define PRINTGFMMAT length_gfmmat |
|
#define PRINTBYTEARRAY length_bytearray |
|
#define PRINTQUOTE length_QUOTE |
|
#define PRINTQUOTEARG length_QUOTEARG |
|
#define PRINTSYMBOL length_SYMBOL |
|
#define PRINTRANGE length_RANGE |
|
#define PRINTTB length_TB |
|
#define PRINTDPV length_DPV |
|
#define PRINTNBP length_nbp |
|
#define PRINTERR length_err |
|
#define PRINTLF length_lf |
|
#define PRINTLOP length_lop |
|
#define PRINTFOP length_fop |
|
#define PRINTEOP length_eop |
|
#define PRINTQOP length_qop |
|
#define PRINTUP length_up |
|
#define PRINTUM length_um |
|
#define PRINTSF length_sf |
|
#define PRINTFARGS length_fargs |
|
#define PRINTFNODENODE length_fnodenode |
|
#define PRINTFNODE length_fnode |
|
|
#if defined(THINK_C) |
#include "pexpr_body.c" |
void PRINTEXPR(VL,pointer); |
|
void PRINTNUM(Num); |
|
void PRINTV(VL,V); |
|
void PRINTN(N); |
|
void PRINTP(VL,P); |
|
void PRINTR(VL,R); |
|
void PRINTLIST(VL,LIST); |
|
void PRINTVECT(VL,VECT); |
|
void PRINTMAT(VL,MAT); |
|
void PRINTSTR(STRING); |
|
void PRINTCOMP(VL,COMP); |
|
void PRINTDP(VL,DP); |
|
void PRINTCPLX(C); |
|
#else |
|
void PRINTEXPR(); |
|
void PRINTNUM(); |
|
void PRINTV(); |
|
void PRINTN(); |
|
void PRINTP(); |
|
void PRINTR(); |
|
void PRINTLIST(); |
|
void PRINTVECT(); |
|
void PRINTMAT(); |
|
void PRINTSTR(); |
|
void PRINTCOMP(); |
|
void PRINTDP(); |
|
void PRINTCPLX(); |
|
#endif |
|
|
|
|
/* special functions for estimating length */ |
|
|
static int total_length; |
static int total_length; |
|
|
int estimate_length(vl,p) |
int estimate_length(VL vl,pointer p) |
VL vl; |
|
pointer p; |
|
{ |
{ |
total_length = 0; |
total_length = 0; |
PRINTEXPR(vl,p); |
PRINTEXPR(vl,p); |
return total_length; |
return total_length; |
} |
} |
|
|
void PRINTEXPR(vl,p) |
#if defined(PARI) |
VL vl; |
void PRINTBF(BF a) |
pointer p; |
|
{ |
{ |
if ( !p ) { |
char *str; |
total_length++; |
char *GENtostr0(); |
return; |
void myoutbrute(); |
} |
|
|
|
switch ( OID(p) ) { |
if ( double_output ) { |
case O_N: |
str = GENtostr0(a->body,myoutbrute); |
PRINTNUM((Num)p); break; |
} else { |
case O_P: |
str = GENtostr(a->body); |
PRINTP(vl,(P)p); break; |
|
case O_R: |
|
PRINTR(vl,(R)p); break; |
|
case O_LIST: |
|
PRINTLIST(vl,(LIST)p); break; |
|
case O_VECT: |
|
PRINTVECT(vl,(VECT)p); break; |
|
case O_MAT: |
|
PRINTMAT(vl,(MAT)p); break; |
|
case O_STR: |
|
PRINTSTR((STRING)p); break; |
|
case O_COMP: |
|
PRINTCOMP(vl,(COMP)p); break; |
|
case O_DP: |
|
PRINTDP(vl,(DP)p); break; |
|
default: |
|
break; |
|
} |
} |
|
total_length += strlen(str); |
|
free(str); |
} |
} |
|
#endif |
|
|
void PRINTN(n) |
void PRINTNUM(Num q) |
N n; |
|
{ |
{ |
double ceil(); |
DAlg d; |
|
DP nm; |
|
Q dn; |
|
|
if ( !n ) |
|
PUTS("0"); |
|
else |
|
total_length += (int)(ceil(0.31*((double)(BSH*PL(n))))+1); |
|
} |
|
|
|
void PRINTNUM(q) |
|
Num q; |
|
{ |
|
if ( !q ) { |
if ( !q ) { |
PUTS("0"); |
PUTS("0"); |
return; |
return; |
|
|
} |
} |
break; |
break; |
case N_R: |
case N_R: |
total_length += 20; /* XXX */ |
if ( double_output ) |
|
total_length += 400+real_digit; /* XXX */ |
|
else |
|
total_length += 20+real_digit; /* XXX */ |
break; |
break; |
case N_A: |
case N_A: |
PUTS("("); PRINTR(ALG,(R)BDY((Alg)q)); PUTS(")"); |
PUTS("("); PRINTR(ALG,(R)BDY((Alg)q)); PUTS(")"); |
break; |
break; |
#if PARI |
#if defined(PARI) |
case N_B: |
case N_B: |
PRINTBF((BF)q); break; |
PRINTBF((BF)q); break; |
#endif |
#endif |
case N_C: |
case N_C: |
PRINTCPLX((C)q); break; |
PRINTCPLX((C)q); break; |
case N_M: |
case N_M: |
total_length += 10; /* XXX */ |
total_length += 11; /* XXX */ |
break; |
break; |
|
case N_LM: |
|
PRINTN(((LM)q)->body); break; |
|
case N_GF2N: |
|
if ( hex_output ) |
|
PRINTN((N)(((GF2N)q)->body)); |
|
else |
|
PRINTUP2(((GF2N)q)->body); |
|
break; |
|
case N_GFPN: |
|
PRINTUP((UP)(((GFPN)q)->body)); |
|
break; |
|
case N_GFS: |
|
total_length += 13; /* XXX */ |
|
break; |
|
case N_GFSN: |
|
PRINTUM(BDY((GFSN)q)); |
|
break; |
|
case N_DA: |
|
d = (DAlg)q; |
|
nm = d->nm; |
|
dn = d->dn; |
|
if ( SGN((Q)dn) == -1 ) PUTS("-"); |
|
PUTS("("); |
|
PRINTDP(CO,((DAlg)q)->nm); |
|
PUTS(")"); |
|
if ( !UNIN(NM(dn)) ) { |
|
PUTS("/"); |
|
PRINTN(NM(dn)); |
|
} |
|
break; |
|
default: |
|
break; |
} |
} |
} |
} |
|
|
void PRINTCPLX(a) |
void PRINTV(VL vl,V v) |
C a; |
|
{ |
{ |
PUTS("("); |
|
if ( a->r ) |
|
PRINTNUM(a->r); |
|
if ( a->i ) { |
|
if ( a->r && (compnum(0,a->i,0) > 0) ) |
|
PUTS("+"); |
|
PRINTNUM(a->i); PUTS("*@i"); |
|
} |
|
PUTS(")"); |
|
} |
|
|
|
void PRINTP(vl,p) |
|
VL vl; |
|
P p; |
|
{ |
|
V v; |
|
DCP dc; |
|
int t; |
|
|
|
if ( !p ) |
|
PUTS("0"); |
|
else if ( NUM(p) ) |
|
PRINTNUM((Num)p); |
|
else |
|
for ( dc = DC(p), v = VR(p); dc; dc = NEXT(dc) ) { |
|
if ( !DEG(dc) ) |
|
PRINTP(vl,COEF(dc)); |
|
else { |
|
if ( NUM(COEF(dc)) && UNIQ((Q)COEF(dc)) ) { |
|
; |
|
} else if ( NUM(COEF(dc)) && MUNIQ((Q)COEF(dc)) ) |
|
PUTS("-"); |
|
else if ( NUM(COEF(dc)) || !NEXT(DC(COEF(dc)))) { |
|
PRINTP(vl,COEF(dc)); PUTS("*"); |
|
} else { |
|
PUTS("("); PRINTP(vl,COEF(dc)); PUTS(")*"); |
|
} |
|
PRINTV(vl,v); |
|
if ( cmpq(DEG(dc),ONE) ) { |
|
PUTS("^"); |
|
if ( INT(DEG(dc)) && SGN(DEG(dc))>0 ) |
|
PRINTNUM((Num)DEG(dc)); |
|
else { |
|
PUTS("("); PRINTNUM((Num)DEG(dc)); PUTS(")"); |
|
} |
|
} |
|
} |
|
if ( NEXT(dc) ) { |
|
P t; |
|
|
|
t = COEF(NEXT(dc)); |
|
if (!DEG(NEXT(dc))) { |
|
if ( NUM(t) ) { |
|
if ( !mmono(t) ) |
|
PUTS("+"); |
|
} else { |
|
if (!mmono(COEF(DC(t)))) |
|
PUTS("+"); |
|
} |
|
} else { |
|
if ( !mmono(t) ) |
|
PUTS("+"); |
|
} |
|
} |
|
} |
|
} |
|
|
|
void PRINTV(vl,v) |
|
VL vl; |
|
V v; |
|
{ |
|
PF pf; |
PF pf; |
PFAD ad; |
PFAD ad; |
int i; |
int i; |
|
|
else if ( (vid)v->attr == V_PF ) { |
else if ( (vid)v->attr == V_PF ) { |
pf = ((PFINS)v->priv)->pf; ad = ((PFINS)v->priv)->ad; |
pf = ((PFINS)v->priv)->pf; ad = ((PFINS)v->priv)->ad; |
if ( !strcmp(NAME(pf),"pow") ) { |
if ( !strcmp(NAME(pf),"pow") ) { |
PUTS("("); PRINTR(vl,(R)ad[0].arg); PUTS(")^("); |
PUTS("(("); PRINTR(vl,(R)ad[0].arg); PUTS(")"); PRINTHAT; PUTS("("); |
PRINTR(vl,(R)ad[1].arg); PUTS(")"); |
PRINTR(vl,(R)ad[1].arg); PUTS("))"); |
} else if ( !pf->argc ) |
} else if ( !pf->argc ) |
PUTS(NAME(pf)); |
PUTS(NAME(pf)); |
else { |
else { |
for ( i = 0; i < pf->argc; i++ ) |
if ( hideargs ) { |
if ( ad[i].d ) |
for ( i = 0; i < pf->argc; i++ ) |
break; |
if ( ad[i].d ) |
if ( i < pf->argc ) { |
break; |
PUTS(NAME(pf)); |
if ( i < pf->argc ) { |
total_length += 11; /* XXX */ |
PUTS(NAME(pf)); |
for ( i = 1; i < pf->argc; i++ ) { |
|
total_length += 11; /* XXX */ |
total_length += 11; /* XXX */ |
|
for ( i = 1; i < pf->argc; i++ ) { |
|
total_length += 11; /* XXX */ |
|
} |
|
PUTS("}"); |
|
} else { |
|
PUTS(NAME(pf)); |
|
total_length += 1; /* XXX */ |
} |
} |
PUTS(")("); |
|
} else { |
} else { |
PUTS(NAME(pf)); |
for ( i = 0; i < pf->argc; i++ ) |
total_length += 1; /* XXX */ |
if ( ad[i].d ) |
|
break; |
|
if ( i < pf->argc ) { |
|
PUTS(NAME(pf)); |
|
total_length += 11; /* XXX */ |
|
for ( i = 1; i < pf->argc; i++ ) { |
|
total_length += 11; /* XXX */ |
|
} |
|
PUTS(")("); |
|
} else { |
|
PUTS(NAME(pf)); |
|
total_length += 1; /* XXX */ |
|
} |
|
PRINTR(vl,(R)ad[0].arg); |
|
for ( i = 1; i < pf->argc; i++ ) { |
|
PUTS(","); PRINTR(vl,(R)ad[i].arg); |
|
} |
|
PUTS(")"); |
} |
} |
PRINTR(vl,(R)ad[0].arg); |
|
for ( i = 1; i < pf->argc; i++ ) { |
|
PUTS(","); PRINTR(vl,(R)ad[i].arg); |
|
} |
|
PUTS(")"); |
|
} |
} |
} |
} |
} |
} |
|
|
void PRINTR(vl,a) |
void PRINTN(N n) |
VL vl; |
|
R a; |
|
{ |
{ |
if ( !a ) |
double ceil(); |
|
|
|
if ( !n ) |
PUTS("0"); |
PUTS("0"); |
|
else if ( hex_output ) |
|
total_length += 2+(int)(PL(n)*8); |
else |
else |
switch (OID(a)) { |
total_length += (int)(ceil(0.31*((double)(BSH*PL(n))))+1); |
case O_N: case O_P: |
} |
PRINTP(vl,(P)a); break; |
|
default: |
void PRINTSTR(STRING str) |
PUTS("("); PRINTP(vl,NM((R)a)); PUTS(")/("); PRINTP(vl,DN((R)a)); PUTS(")"); |
{ |
break; |
char *p; |
|
|
|
for ( p = BDY(str); *p; p++ ) |
|
if ( *p == '"' ) |
|
PUTS("\""); |
|
else { |
|
total_length += 1; |
} |
} |
} |
} |
|
|
void PRINTVECT(vl,vect) |
void PRINTDP(VL vl,DP d) |
VL vl; |
|
VECT vect; |
|
{ |
{ |
int i; |
int n,i; |
pointer *ptr; |
MP m; |
|
DL dl; |
|
|
PUTS("[ "); |
for ( n = d->nv, m = BDY(d); m; m = NEXT(m) ) { |
for ( i = 0, ptr = BDY(vect); i < vect->len; i++ ) { |
PUTS("("); PRINTEXPR(vl,(pointer)m->c); PUTS(")*<<"); |
PRINTEXPR(vl,ptr[i]); PUTS(" "); |
for ( i = 0, dl = m->dl; i < n-1; i++ ) { |
|
total_length += 11; |
|
} |
|
total_length += 10; |
|
PUTS(">>"); |
|
if ( NEXT(m) ) |
|
PUTS("+"); |
} |
} |
PUTS("]"); |
|
} |
} |
|
|
void PRINTMAT(vl,mat) |
void PRINTUI(VL vl,USINT u) |
VL vl; |
|
MAT mat; |
|
{ |
{ |
int i,j,r,c; |
total_length += 10; |
pointer *ptr; |
} |
|
|
for ( i = 0, r = mat->row, c = mat->col; i < r; i++ ) { |
void PRINTGFMMAT(VL vl,GFMMAT mat) |
PUTS("[ "); |
{ |
for ( j = 0, ptr = BDY(mat)[i]; j < c; j++ ) { |
int row,col,i,j; |
PRINTEXPR(vl,ptr[j]); PUTS(" "); |
unsigned int **b; |
|
|
|
row = mat->row; |
|
col = mat->col; |
|
b = mat->body; |
|
for ( i = 0; i < row; i++ ) { |
|
PUTS("["); |
|
for ( j = 0; j < col; j++ ) { |
|
total_length += 10; /* XXX */ |
} |
} |
PUTS("]"); |
PUTS("]\n"); |
if ( i < r - 1 ) |
|
PUTS("\n"); |
|
} |
} |
} |
} |
|
|
void PRINTLIST(vl,list) |
void PRINTBYTEARRAY(VL vl,BYTEARRAY array) |
VL vl; |
|
LIST list; |
|
{ |
{ |
NODE tnode; |
/* |xx xx ... xx| */ |
|
total_length += 1+3*array->len; |
|
} |
|
|
PUTS("["); |
extern int print_quote; |
for ( tnode = (NODE)list->body; tnode; tnode = NEXT(tnode) ) { |
|
PRINTEXPR(vl,tnode->body); |
void PRINTQUOTE(VL vl,QUOTE quote) |
if ( NEXT(tnode) ) |
{ |
PUTS(","); |
LIST list; |
|
|
|
if ( print_quote == 2 ) { |
|
PRINTFNODE(BDY(quote),0); |
|
} else if ( print_quote == 1 ) { |
|
/* XXX */ |
|
fnodetotree(BDY(quote),&list); |
|
PRINTEXPR(vl,(Obj)list); |
|
} else { |
|
/* <...quoted...> */ |
|
total_length += 20; |
} |
} |
PUTS("]"); |
|
} |
} |
|
|
void PRINTSTR(str) |
void PRINTQUOTEARG(VL vl,QUOTEARG quote) |
STRING str; |
|
{ |
{ |
char *p; |
/* XXX */ |
|
/* <...quoted...> */ |
|
total_length += 20; |
|
} |
|
|
for ( p = BDY(str); *p; p++ ) |
void PRINTSYMBOL(SYMBOL sym) |
if ( *p == '"' ) |
{ |
PUTS("\""); |
total_length += strlen(sym->name); |
else { |
|
total_length += 1; |
|
} |
|
} |
} |
|
|
void PRINTCOMP(vl,c) |
void PRINTTB(VL vl,TB p) |
VL vl; |
|
COMP c; |
|
{ |
{ |
int n,i; |
int i; |
|
|
n = getcompsize((int)c->type); |
for ( i = 0; i < p->next; i++ ) { |
PUTS("{"); |
total_length += strlen(p->body[i]); |
for ( i = 0; i < n; i++ ) { |
|
PRINTEXPR(vl,(pointer)c->member[i]); |
|
if ( i < n-1 ) |
|
PUTS(","); |
|
} |
} |
PUTS("}"); |
|
} |
} |
|
|
void PRINTDP(vl,d) |
void PRINTUP2(UP2 p) |
VL vl; |
|
DP d; |
|
{ |
{ |
int n,i; |
int d,i; |
MP m; |
|
DL dl; |
|
|
|
for ( n = d->nv, m = BDY(d); m; m = NEXT(m) ) { |
if ( !p ) { |
PUTS("("); PRINTEXPR(vl,(pointer)m->c); PUTS(")*<<"); |
PUTS("0"); |
for ( i = 0, dl = m->dl; i < n-1; i++ ) { |
} else { |
|
d = degup2(p); |
|
PUTS("("); |
|
if ( !d ) { |
|
PUTS("1"); |
|
} else if ( d == 1 ) { |
|
PUTS("@"); |
|
} else { |
|
PRINTHAT; |
total_length += 11; |
total_length += 11; |
} |
} |
total_length += 10; |
for ( i = d-1; i >= 0; i-- ) { |
PUTS(">>"); |
if ( p->b[i/BSH] & (1<<(i%BSH)) ) |
if ( NEXT(m) ) |
if ( !i ) { |
PUTS("+"); |
PUTS("+1"); |
|
} else if ( i == 1 ) { |
|
PUTS("+@"); |
|
} else { |
|
PRINTHAT; |
|
total_length += 12; |
|
} |
|
} |
|
PUTS(")"); |
} |
} |
|
} |
|
|
|
void PRINTQOP(VL vl,F f) |
|
{ |
|
char *op; |
|
|
|
op = FOP(f)==AL_EX?"ex":"all"; |
|
PUTS(op); PUTS(NAME(FQVR(f))); |
|
total_length += 2; |
|
PRINTEXPR(vl,(Obj)FQMAT(f)); PUTS(")"); |
|
} |
|
|
|
void PRINTUP(UP n) |
|
{ |
|
int i,d; |
|
|
|
if ( !n ) |
|
PUTS("0"); |
|
else if ( !n->d ) |
|
PRINTNUM(n->c[0]); |
|
else { |
|
d = n->d; |
|
PUTS("("); |
|
if ( !d ) { |
|
PRINTNUM(n->c[d]); |
|
} else if ( d == 1 ) { |
|
PRINTNUM(n->c[d]); |
|
PUTS("*@p"); |
|
} else { |
|
PRINTNUM(n->c[d]); |
|
PRINTHAT; |
|
total_length += 13; |
|
} |
|
for ( i = d-1; i >= 0; i-- ) { |
|
if ( n->c[i] ) { |
|
PUTS("+("); PRINTNUM(n->c[i]); PUTS(")"); |
|
if ( i >= 2 ) { |
|
PRINTHAT; |
|
total_length += 13; |
|
} else if ( i == 1 ) |
|
PUTS("*@p"); |
|
} |
|
} |
|
PUTS(")"); |
|
} |
|
} |
|
|
|
void PRINTUM(UM n) |
|
{ |
|
int i,d; |
|
|
|
if ( !n ) |
|
PUTS("0"); |
|
else if ( !n->d ) |
|
PRINTSF(n->c[0]); |
|
else { |
|
d = n->d; |
|
PUTS("("); |
|
if ( !d ) { |
|
PRINTSF(n->c[d]); |
|
} else if ( d == 1 ) { |
|
PRINTSF(n->c[d]); |
|
PUTS("*@s"); |
|
} else { |
|
PRINTSF(n->c[d]); |
|
PUTS("*@s"); PRINTHAT; total_length += 13; |
|
} |
|
for ( i = d-1; i >= 0; i-- ) { |
|
if ( n->c[i] ) { |
|
PUTS("+("); PRINTSF(n->c[i]); PUTS(")"); |
|
if ( i >= 2 ) { |
|
PUTS("*@s"); PRINTHAT; total_length += 13; |
|
} else if ( i == 1 ) |
|
PUTS("*@s"); |
|
} |
|
} |
|
PUTS(")"); |
|
} |
|
} |
|
|
|
void PRINTNBP(VL vl,NBP p) |
|
{ |
|
NODE t; |
|
NBM m; |
|
int d,i; |
|
unsigned int *b; |
|
if ( !p ) PUTS("0"); |
|
else { |
|
for ( t = BDY(p); t; t = NEXT(t) ) { |
|
m = (NBM)BDY(t); |
|
PRINTEXPR(vl,(Obj)m->c); |
|
d = m->d; |
|
b = m->b; |
|
if ( d ) |
|
for ( i = 0; i < d; i++ ) { |
|
if ( NBM_GET(b,i) ) PUTS("x"); |
|
else PUTS("y"); |
|
} |
|
else PUTS("1"); |
|
if ( NEXT(t) ) PUTS("+"); |
|
} |
|
} |
|
} |
|
|
|
void PRINTSF(unsigned int i) |
|
{ |
|
if ( !i ) { |
|
PUTS("0"); |
|
} else |
|
total_length += 15; |
|
|
|
#ifndef CPRINT |
|
#define CPRINT |
|
#endif |
} |
} |