ref: e7cdf11aa8b4f3bd6f0b6fbda975b38c93cc3d99
dir: /8/reduce.c/
#include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
#include <ctype.h>
#include <string.h>
#include <assert.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include "parse.h"
#include "opt.h"
#include "asm.h"
#include "platform.h" /* HACK. We need some platform specific code gen behavior. *sigh.* */
/* takes a list of nodes, and reduces it (and it's subnodes) to a list
* following these constraints:
* - All nodes are expression nodes
* - Nodes with side effects are root nodes
* - All nodes operate on machine-primitive types and tuples
*/
typedef struct Simp Simp;
struct Simp {
int isglobl;
Node **stmts;
size_t nstmts;
/* return handling */
Node *endlbl;
Node *retval;
/* pre/postinc handling */
Node **incqueue;
size_t nqueue;
/* location handling */
size_t stksz;
size_t argsz;
Htab *locs;
Node *ret;
};
static Node *simp(Simp *s, Node *n);
static Node *rval(Simp *s, Node *n);
static Node *lval(Simp *s, Node *n);
static void declarelocal(Simp *s, Node *n);
static void append(Simp *s, Node *n)
{
lappend(&s->stmts, &s->nstmts, n);
}
static int ispure(Node *n)
{
return ispureop[exprop(n)];
}
static int isconstfn(Sym *s)
{
return s->isconst && s->type->type == Tyfunc;
}
static char *asmname(Node *n)
{
size_t i;
char *s;
char *sep;
int len;
len = strlen(Fprefix);
for (i = 0; i < n->name.nparts; i++)
len += strlen(n->name.parts[i]) + 1;
s = xalloc(len);
s[0] = '\0';
sep = Fprefix;
for (i = 0; i < n->name.nparts; i++) {
sprintf(s, "%s%s", sep, n->name.parts[i]);
sep = "$";
}
return s;
}
static size_t tysize(Type *t)
{
size_t sz;
size_t i;
sz = 0;
switch (t->type) {
case Tyvoid:
return 1;
case Tybool: case Tychar: case Tyint8:
case Tybyte: case Tyuint8:
return 1;
case Tyint16: case Tyuint16:
return 2;
case Tyint: case Tyint32:
case Tyuint: case Tyuint32:
case Typtr: case Tyenum:
case Tyfunc:
return 4;
case Tyint64: case Tylong:
case Tyuint64: case Tyulong:
return 8;
/*end integer types*/
case Tyfloat32:
return 4;
case Tyfloat64:
return 8;
case Tyvalist:
return 4; /* ptr to first element of valist */
case Tyslice:
return 8; /* len; ptr */
case Tyarray:
assert(exprop(t->asize) == Olit);
return t->asize->expr.args[0]->lit.intval * tysize(t->sub[0]);
case Tytuple:
case Tystruct:
for (i = 0; i < t->nmemb; i++)
sz += size(t->sdecls[i]);
return sz;
break;
case Tyunion:
die("Sizes for composite types not implemented yet");
break;
case Tybad: case Tyvar: case Typaram: case Tyname: case Ntypes:
die("Type %s does not have size; why did it get down to here?", tystr(t));
break;
}
return -1;
}
size_t size(Node *n)
{
Type *t;
if (n->type == Nexpr)
t = n->expr.type;
else
t = n->decl.sym->type;
return tysize(t);
}
static Node *genlbl(void)
{
char buf[128];
static int nextlbl;
snprintf(buf, 128, ".L%d", nextlbl++);
return mklbl(-1, buf);
}
static Node *temp(Simp *simp, Node *e)
{
char buf[128];
static int nexttmp;
Node *t, *r, *n;
Sym *s;
assert(e->type == Nexpr);
snprintf(buf, 128, ".t%d", nexttmp++);
n = mkname(-1, buf);
s = mksym(-1, n, e->expr.type);
t = mkdecl(-1, s);
declarelocal(simp, t);
r = mkexpr(-1, Ovar, t, NULL);
r->expr.did = s->id;
return r;
}
static void jmp(Simp *s, Node *lbl)
{
append(s, mkexpr(-1, Ojmp, lbl, NULL));
}
static Node *store(Node *dst, Node *src)
{
return mkexpr(-1, Ostor, dst, src, NULL);
}
static void cjmp(Simp *s, Node *cond, Node *iftrue, Node *iffalse)
{
Node *jmp;
jmp = mkexpr(-1, Ocjmp, cond, iftrue, iffalse, NULL);
append(s, jmp);
}
/* if foo; bar; else baz;;
* => cjmp (foo) :bar :baz */
static void simpif(Simp *s, Node *n)
{
Node *l1, *l2;
Node *c;
l1 = genlbl();
l2 = genlbl();
c = rval(s, n->ifstmt.cond);
cjmp(s, c, l1, l2);
simp(s, l1);
simp(s, n->ifstmt.iftrue);
simp(s, l2);
simp(s, n->ifstmt.iffalse);
}
/* init; while cond; body;;
* => init
* jmp :cond
* :body
* ...body...
* :cond
* ...cond...
* cjmp (cond) :body :end
* :end
*/
static void simploop(Simp *s, Node *n)
{
Node *lbody;
Node *lend;
Node *lcond;
Node *t;
lbody = genlbl();
lcond = genlbl();
lend = genlbl();
simp(s, n->loopstmt.init); /* init */
jmp(s, lcond); /* goto test */
simp(s, lbody); /* body lbl */
simp(s, n->loopstmt.body); /* body */
simp(s, n->loopstmt.step); /* step */
simp(s, lcond); /* test lbl */
t = rval(s, n->loopstmt.cond); /* test */
cjmp(s, t, lbody, lend); /* repeat? */
simp(s, lend); /* exit */
}
static void simpblk(Simp *s, Node *n)
{
size_t i;
for (i = 0; i < n->block.nstmts; i++) {
simp(s, n->block.stmts[i]);
}
}
static size_t offsetof(Node *aggr, Node *memb)
{
Type *ty;
Node **nl;
size_t nn, i;
size_t off;
if (aggr->expr.type->type == Typtr)
aggr = aggr->expr.args[0];
ty = aggr->expr.type;
assert(ty->type == Tystruct);
nl = aggrmemb(ty, &nn);
off = 0;
for (i = 0; i < nn; i++) {
if (!strcmp(namestr(memb), declname(nl[i])))
return off;
off += size(nl[i]);
}
die("Could not find member %s in struct", namestr(memb));
return -1;
}
static Node *one;
static Node *membaddr(Simp *s, Node *n)
{
Node *t, *u, *r;
Node **args;
args = n->expr.args;
if (n->expr.type->type != Typtr)
t = mkexpr(-1, Oaddr, args[0], NULL);
else
t = args[0];
u = mkint(-1, offsetof(args[0], args[1]));
u = mkexpr(-1, Olit, u, NULL);
r = mkexpr(-1, Oadd, t, u, NULL);
return r;
}
static Node *idxaddr(Simp *s, Node *n)
{
Node *t, *u, *v; /* temps */
Node *r; /* result */
Node **args;
size_t sz;
assert(exprop(n) == Oidx);
args = n->expr.args;
if (args[0]->expr.type->type == Tyarray)
t = mkexpr(-1, Oaddr, args[0], NULL);
else if (args[0]->expr.type->type == Tyslice)
t = mkexpr(-1, Oslbase, args[0], NULL);
else
die("Can't index type %s\n", tystr(n->expr.type));
u = rval(s, args[1]);
sz = size(n);
v = mkexpr(-1, Omul, u, mkexpr(-1, Olit, mkint(-1, sz), NULL), NULL);
r = mkexpr(-1, Oadd, t, v, NULL);
return r;
}
static Node *slicebase(Simp *s, Node *n, Node *off)
{
Node *t, *u, *v;
int sz;
t = rval(s, n);
u = NULL;
switch (n->expr.type->type) {
case Typtr: u = n;
case Tyarray: u = mkexpr(-1, Oaddr, t, NULL); break;
case Tyslice: u = mkexpr(-1, Oslbase, t, NULL); break;
default: die("Unslicable type %s", tystr(n->expr.type));
}
/* safe: all types we allow here have a sub[0] that we want to grab */
sz = tysize(n->expr.type->sub[0]);
v = mkexpr(-1, Omul, u, mkexpr(-1, Olit, mkint(-1, sz), NULL), NULL);
return mkexpr(-1, Oadd, u, v, NULL);
}
Node *lval(Simp *s, Node *n)
{
Node *r;
if (!one)
one = mkexpr(-1, Olit, mkint(-1, 1), NULL);
switch (exprop(n)) {
case Ovar: r = n; break;
case Omemb: r = membaddr(s, n); break;
case Oidx: r = idxaddr(s, n); break;
default:
die("%s cannot be an lval", opstr(exprop(n)));
break;
}
return r;
}
static Node *simplazy(Simp *s, Node *n, Node *r)
{
Node *a, *b;
Node *next;
Node *end;
next = genlbl();
end = genlbl();
a = rval(s, n->expr.args[0]);
append(s, store(r, a));
if (exprop(n) == Oland)
cjmp(s, a, next, end);
else if (exprop(n) == Olor)
cjmp(s, a, end, next);
append(s, next);
b = rval(s, n->expr.args[1]);
append(s, store(r, b));
append(s, end);
return r;
}
static Node *lowerslice(Simp *s, Node *n)
{
Node *t;
Node *base;
Node *len;
Node *stbase;
Node *stlen;
t = temp(s, n);
/* base = (void*)base + off*sz */
base = slicebase(s, n->expr.args[0], n->expr.args[1]);
len = mkexpr(-1, Osub, n->expr.args[2], n->expr.args[1], NULL);
stbase = mkexpr(-1, Ostor, mkexpr(-1, Oaddr, mkexpr(-1, Oslbase, t, NULL), NULL), base, NULL);
stlen = mkexpr(-1, Ostor, mkexpr(-1, Oaddr, mkexpr(-1, Osllen, t, NULL), NULL), len, NULL);
append(s, stbase);
append(s, stlen);
return t;
}
static Node *rval(Simp *s, Node *n)
{
Node *r; /* expression result */
Node *t, *u, *v; /* temporary nodes */
size_t i;
Node **args;
const Op fusedmap[] = {
[Oaddeq] = Oadd,
[Osubeq] = Osub,
[Omuleq] = Omul,
[Odiveq] = Odiv,
[Omodeq] = Omod,
[Oboreq] = Obor,
[Obandeq] = Oband,
[Obxoreq] = Obxor,
[Obsleq] = Obsl,
};
if (!one)
one = mkexpr(-1, Olit, mkint(-1, 1), NULL);
r = NULL;
args = n->expr.args;
switch (exprop(n)) {
case Obad:
case Olor: case Oland:
r = temp(s, n);
simplazy(s, n, r);
break;
case Osize:
r = mkexpr(-1, Olit, mkint(-1, size(args[0])), NULL);
break;
case Oslice:
r = lowerslice(s, n);
break;
case Oidx:
t = idxaddr(s, n);
r = mkexpr(-1, Oload, t, NULL);
break;
case Omemb:
t = membaddr(s, n);
r = mkexpr(-1, Oload, t, NULL);
break;
/* fused ops:
* foo ?= blah
* =>
* foo = foo ? blah*/
case Oaddeq: case Osubeq: case Omuleq: case Odiveq: case Omodeq:
case Oboreq: case Obandeq: case Obxoreq: case Obsleq: case Obsreq:
assert(fusedmap[exprop(n)] != Obad);
u = rval(s, args[0]);
v = rval(s, args[1]);
v = mkexpr(-1, fusedmap[exprop(n)], u, v, NULL);
r = mkexpr(-1, Ostor, u, v, NULL);
break;
/* ++expr(x)
* => args[0] = args[0] + 1
* expr(x) */
case Opreinc:
t = lval(s, args[0]);
v = mkexpr(-1, Oadd, one, t, NULL);
r = mkexpr(-1, Ostor, t, v, NULL);
lappend(&s->incqueue, &s->nqueue, t);
break;
case Opredec:
t = lval(s, args[0]);
v = mkexpr(-1, Osub, one, t, NULL);
r = mkexpr(-1, Ostor, t, v, NULL);
lappend(&s->incqueue, &s->nqueue, t);
break;
/* expr(x++)
* =>
* expr
* x = x + 1
*/
case Opostinc:
r = lval(s, args[0]);
v = mkexpr(-1, Oadd, one, r, NULL);
t = mkexpr(-1, Ostor, r, v, NULL);
lappend(&s->incqueue, &s->nqueue, t);
break;
case Opostdec:
r = lval(s, args[0]);
v = mkexpr(-1, Osub, one, args[0], NULL);
t = mkexpr(-1, Ostor, r, v, NULL);
lappend(&s->incqueue, &s->nqueue, t);
break;
case Olit: case Ovar:
r = n;
break;
case Oret:
if (n->expr.args[0]) {
if (s->ret)
t = s->ret;
else
t = s->ret = temp(s, args[0]);
t = store(t, rval(s, args[0]));
append(s, t);
}
jmp(s, s->endlbl);
break;
case Oasn:
t = lval(s, args[0]);
u = rval(s, args[1]);
if (size(n) > 4) {
t = mkexpr(-1, Oaddr, t, NULL);
u = mkexpr(-1, Oaddr, u, NULL);
v = mkexpr(-1, Olit, mkint(-1, size(n)), NULL);
r = mkexpr(-1, Oblit, t, u, v, NULL);
} else {
r = mkexpr(-1, Ostor, t, u, NULL);
}
break;
default:
for (i = 0; i < n->expr.nargs; i++)
n->expr.args[i] = rval(s, n->expr.args[i]);
if (ispure(n)) {
r = n;
} else {
r = temp(s, n);
append(s, store(r, n));
}
}
return r;
}
static void declarelocal(Simp *s, Node *n)
{
assert(n->type == Ndecl);
s->stksz += size(n);
if (debug)
printf("DECLARE %s(%ld) at %zd\n", declname(n), n->decl.sym->id, s->stksz);
htput(s->locs, (void*)n->decl.sym->id, (void*)s->stksz);
}
static void declarearg(Simp *s, Node *n)
{
assert(n->type == Ndecl);
if (debug)
printf("DECLARE %s(%ld) at %zd\n", declname(n), n->decl.sym->id, -(s->argsz + 8));
htput(s->locs, (void*)n->decl.sym->id, (void*)-(s->argsz + 8));
s->argsz += size(n);
}
static Node *simp(Simp *s, Node *n)
{
Node *r;
size_t i;
if (!n)
return NULL;
r = NULL;
switch (n->type) {
case Nblock:
simpblk(s, n);
break;
case Nifstmt:
simpif(s, n);
break;
case Nloopstmt:
simploop(s, n);
break;
case Nexpr:
r = rval(s, n);
if (r)
append(s, r);
/* drain the increment queue for this expr */
for (i = 0; i < s->nqueue; i++)
append(s, s->incqueue[i]);
lfree(&s->incqueue, &s->nqueue);
break;
case Nlit:
r = n;
break;
case Ndecl:
declarelocal(s, n);
break;
case Nlbl:
append(s, n);
break;
default:
die("Bad node passsed to simp()");
break;
}
return r;
}
static void reduce(Simp *s, Node *f)
{
size_t i;
assert(f->type == Nfunc);
s->nstmts = 0;
s->stmts = NULL;
s->endlbl = genlbl();
s->retval = NULL;
if (f->type == Nfunc) {
for (i = 0; i < f->func.nargs; i++) {
declarearg(s, f->func.args[i]);
}
simp(s, f->func.body);
} else {
die("Got a non-func (%s) to reduce", nodestr(f->type));
}
append(s, s->endlbl);
}
static void lowerfn(char *name, Node *n, Htab *globls, FILE *fd)
{
size_t i;
Simp s = {0,};
Func fn;
Cfg *cfg;
if(debug)
printf("\n\nfunction %s\n", name);
/* set up the simp context */
s.locs = mkht(ptrhash, ptreq);
/* unwrap to the function body */
n = n->expr.args[0];
n = n->lit.fnval;
reduce(&s, n);
if (debug)
for (i = 0; i < s.nstmts; i++)
dump(s.stmts[i], stdout);
cfg = mkcfg(s.stmts, s.nstmts);
if (debug)
dumpcfg(cfg, stdout);
fn.name = name;
fn.isglobl = 1; /* FIXME: we should actually use the visibility of the sym... */
fn.stksz = s.stksz;
fn.locs = s.locs;
fn.ret = s.ret;
fn.cfg = cfg;
genasm(fd, &fn, globls);
}
void blobdump(Blob *b, FILE *fd)
{
size_t i;
char *p;
p = b->data;
for (i = 0; i < b->ndata; i++)
if (isprint(p[i]))
fprintf(fd, "%c", p[i]);
else
fprintf(fd, "\\%x", p[i]);
fprintf(fd, "\n");
}
void gen(Node *file, char *out)
{
FILE *fd;
Node **n;
int nn, i;
char *name;
Htab *globls;
Sym *s;
n = file->file.stmts;
nn = file->file.nstmts;
globls = mkht(ptrhash, ptreq);
/* We need to declare all variables before use */
for (i = 0; i < nn; i++)
if (n[i]->type == Ndecl)
htput(globls, (void*)n[i]->decl.sym->id, asmname(n[i]->decl.sym->name));
fd = fopen(out, "w");
if (!fd)
die("Couldn't open fd %s", out);
for (i = 0; i < nn; i++) {
switch (n[i]->type) {
case Nuse: /* nothing to do */
break;
case Ndecl:
s = n[i]->decl.sym;
name = asmname(s->name);
if (isconstfn(s)) {
lowerfn(name, n[i]->decl.init, globls, fd);
free(name);
} else {
die("We don't lower globls yet...");
}
break;
default:
die("Bad node %s in toplevel", nodestr(n[i]->type));
break;
}
}
if (fd)
fclose(fd);
}