void
adrput(FILE * io, NODE * p)
{
int64_t off;
if (p->n_op == FLD) {
printf("adrput a FLD\n");
p = p->n_left;
}
if (p->n_op == UMUL && p->n_right == 0)
p = p->n_left;
off = p->n_lval;
switch (p->n_op) {
case NAME:
if (p->n_name[0] != '\0')
fputs(p->n_name, io);
if (off > 0)
fprintf(io, "+");
if (off != 0)
fprintf(io, CONFMT, (long long int)off);
return;
case OREG:
fprintf(io, "%s", rnames[p->n_rval]);
if (p->n_rval == FP)
off += V9BIAS;
if (p->n_rval == SP)
off += V9BIAS + V9RESERVE;
if (off > 0)
fprintf(io, "+");
if (off)
fprintf(io, CONFMT, (CONSZ)off);
return;
case ICON:
/* addressable value of the constant */
conput(io, p);
return;
case REG:
fputs(rnames[p->n_rval], io);
return;
case FUNARG:
/* We do something odd and store the stack offset in n_rval. */
fprintf(io, "%d", V9BIAS + V9RESERVE + p->n_rval);
return;
default:
comperr("bad address, %s, node %p", copst(p->n_op), p);
return;
}
}
void
adrput(FILE * io, NODE * p)
{
int r;
/* output an address, with offsets, from p */
if (p->n_op == FLD)
p = p->n_left;
switch (p->n_op) {
case NAME:
if (p->n_name[0] != '\0')
fputs(p->n_name, io);
if (p->n_lval != 0)
fprintf(io, "+" CONFMT, p->n_lval);
return;
case OREG:
r = p->n_rval;
if (p->n_lval)
fprintf(io, "%d", (int) p->n_lval);
fprintf(io, "(%s)", rnames[p->n_rval]);
return;
case ICON:
/* addressable value of the constant */
conput(io, p);
return;
case REG:
if (GCLASS(p->n_rval) == CLASSB || GCLASS(p->n_rval) == CLASSC)
print_reg64name(io, p->n_rval, 0);
else
fputs(rnames[p->n_rval], io);
return;
default:
comperr("illegal address, op %d, node %p", p->n_op, p);
return;
}
}
/*
* generate code by interpreting table entry
*/
void
expand(NODE *p, int cookie, char *cp)
{
CONSZ val;
#if 0
printf("expand\n");
fwalk(p, e2print, 0);
#endif
for( ; *cp; ++cp ){
switch( *cp ){
default:
putchar(*cp);
continue; /* this is the usual case... */
case 'Z': /* special machine dependent operations */
zzzcode( p, *++cp );
continue;
case 'F': /* this line deleted if FOREFF is active */
if (cookie & FOREFF) {
while (*cp && *cp != '\n')
cp++;
if (*cp == 0)
return;
}
continue;
case 'S': /* field size */
if (fldexpand(p, cookie, &cp))
continue;
printf("%d", FLDSZ(p->n_rval));
continue;
case 'H': /* field shift */
if (fldexpand(p, cookie, &cp))
continue;
printf("%d", FLDSHF(p->n_rval));
continue;
case 'M': /* field mask */
case 'N': /* complement of field mask */
if (fldexpand(p, cookie, &cp))
continue;
val = 1;
val <<= FLDSZ(p->n_rval);
--val;
val <<= FLDSHF(p->n_rval);
adrcon( *cp=='M' ? val : ~val );
continue;
case 'L': /* output special label field */
if (*++cp == 'C')
printf(LABFMT, p->n_label);
else
printf(LABFMT, (int)getlval(getlr(p,*cp)));
continue;
case 'O': /* opcode string */
#ifdef FINDMOPS
if (p->n_op == ASSIGN)
hopcode(*++cp, p->n_right->n_op);
else
#endif
hopcode( *++cp, p->n_op );
continue;
case 'B': /* byte offset in word */
val = getlval(getlr(p,*++cp));
val = BYTEOFF(val);
printf( CONFMT, val );
continue;
case 'C': /* for constant value only */
conput(stdout, getlr( p, *++cp ) );
continue;
case 'I': /* in instruction */
insput( getlr( p, *++cp ) );
continue;
case 'A': /* address of */
adrput(stdout, getlr( p, *++cp ) );
continue;
case 'U': /* for upper half of address, only */
upput(getlr(p, *++cp), SZLONG);
continue;
}
}
}
