#include <lib9.h>#include <bio.h>#include <ctype.h>#include "mach.h"#define Extern extern#include "acid.h" static int fsize[] ={ 0,0,0,0,0,0,0,0, /* 0-7 */ 0,0,0,0,0,0,0,0, /* 8-15 */ 0,0,0,0,0,0,0,0, /* 16-23 */ 0,0,0,0,0,0,0,0, /* 24-31 */ 0,0,0,0,0,0,0,0, /* 32-39 */ 0,0,0,0,0,0,0,0, /* 40-47 */ 0,0,0,0,0,0,0,0, /* 48-55 */ 0,0,0,0,0,0,0,0, /* 56-63 */ 0, /* 64 */ 4, /* 65 ['A'] 4, */ 4, /* 66 ['B'] 4, */ 1, /* 67 ['C'] 1, */ 4, /* 68 ['D'] 4, */ 0, /* 69 */ 8, /* 70 ['F'] 8, */ 8, /* 71 ['G'] 8, */ 0,0,0,0,0,0,0, /* 72-78 */ 4, /* 79 ['O'] 4, */ 0, /* 80 */ 4, /* 81 ['Q'] 4, */ 4, /* 82 ['R'] 4, */ 4, /* 83 ['S'] 4, */ 0, /* 84 */ 4, /* 85 ['U'] 4, */ 8, /* 86 ['V'] 8, */ 0, /* 87 */ 4, /* 88 ['X'] 4, */ 8, /* 89 ['Y'] 8, */ 8, /* 90 ['Z'] 8, */ 0,0,0,0,0,0, /* 91-96 */ 4, /* 97 ['a'] 4, */ 1, /* 98 ['b'] 1, */ 1, /* 99 ['c'] 1, */ 2, /* 100 ['d'] 2, */ 0, /* 101 */ 4, /* 102 ['f'] 4, */ 4, /* 103 ['g'] 4, */ 0,0,0,0,0,0,0, /* 104-110 */ 2, /* 111 ['o'] 2, */ 0, /* 112 */ 2, /* 113 ['q'] 2, */ 2, /* 114 ['r'] 2, */ 4, /* 115 ['s'] 4, */ 0, /* 116 */ 2, /* 117 ['u'] 2, */ 0,0, /* 118-119 */ 2, /* 120 ['x'] 2, */}; intfmtsize(Value *v){ int ret; switch(v->vstore.fmt) { default: return fsize[v->vstore.fmt]; case 'i': case 'I': if(v->type != TINT || machdata == 0) error("no size for i fmt pointer ++/--"); ret = (*machdata->instsize)(cormap, v->vstore.u0.sival); if(ret < 0) { ret = (*machdata->instsize)(symmap, v->vstore.u0.sival); if(ret < 0) error("%r"); } return ret; }} voidchklval(Node *lp){ if(lp->op != ONAME) error("need l-value");} voidolist(Node *n, Node *res){ expr(n->left, res); expr(n->right, res);} voidoeval(Node *n, Node *res){ expr(n->left, res); if(res->type != TCODE) error("bad type for eval"); expr(res->nstore.u0.scc, res);} voidocast(Node *n, Node *res){ if(n->sym->lt == 0) error("%s is not a complex type", n->sym->name); expr(n->left, res); res->nstore.comt = n->sym->lt; res->nstore.fmt = 'a';} voidoindm(Node *n, Node *res){ Map *m; Node l; m = cormap; if(m == 0) m = symmap; expr(n->left, &l); if(l.type != TINT) error("bad type for *"); if(m == 0) error("no map for *"); indir(m, l.nstore.u0.sival, l.nstore.fmt, res); res->nstore.comt = l.nstore.comt;} voidoindc(Node *n, Node *res){ Map *m; Node l; m = symmap; if(m == 0) m = cormap; expr(n->left, &l); if(l.type != TINT) error("bad type for @"); if(m == 0) error("no map for @"); indir(m, l.nstore.u0.sival, l.nstore.fmt, res); res->nstore.comt = l.nstore.comt;} voidoframe(Node *n, Node *res){ char *p; Node *lp; uvlong ival; Frtype *f; p = n->sym->name; while(*p && *p == '$') p++; lp = n->left; if(localaddr(cormap, p, lp->sym->name, &ival, rget) < 0) error("colon: %r"); res->nstore.u0.sival = ival; res->op = OCONST; res->nstore.fmt = 'X'; res->type = TINT; /* Try and set comt */ for(f = n->sym->local; f; f = f->next) { if(f->var == lp->sym) { res->nstore.comt = f->type; res->nstore.fmt = 'a'; break; } }} voidoindex(Node *n, Node *res){ Node l, r; expr(n->left, &l); expr(n->right, &r); if(r.type != TINT) error("bad type for []"); switch(l.type) { default: error("lhs[] has bad type"); case TINT: indir(cormap, l.nstore.u0.sival+(r.nstore.u0.sival*fsize[l.nstore.fmt]), l.nstore.fmt, res); res->nstore.comt = l.nstore.comt; res->nstore.fmt = l.nstore.fmt; break; case TLIST: nthelem(l.nstore.u0.sl, r.nstore.u0.sival, res); break; case TSTRING: res->nstore.u0.sival = 0; if(r.nstore.u0.sival >= 0 && r.nstore.u0.sival < l.nstore.u0.sstring->len) { int xx8; /* to get around bug in vc */ xx8 = r.nstore.u0.sival; res->nstore.u0.sival = l.nstore.u0.sstring->string[xx8]; } res->op = OCONST; res->type = TINT; res->nstore.fmt = 'c'; break; }} voidoappend(Node *n, Node *res){ Node r, l; expr(n->left, &l); expr(n->right, &r); if(l.type != TLIST) error("must append to list"); append(res, &l, &r);} voidodelete(Node *n, Node *res){ Node l, r; expr(n->left, &l); expr(n->right, &r); if(l.type != TLIST) error("must delete from list"); if(r.type != TINT) error("delete index must be integer"); delete(l.nstore.u0.sl, r.nstore.u0.sival, res);} voidohead(Node *n, Node *res){ Node l; expr(n->left, &l); if(l.type != TLIST) error("head needs list"); res->op = OCONST; if(l.nstore.u0.sl) { res->type = l.nstore.u0.sl->type; res->nstore = l.nstore.u0.sl->lstore; } else { res->type = TLIST; res->nstore.u0.sl = 0; }} voidotail(Node *n, Node *res){ Node l; expr(n->left, &l); if(l.type != TLIST) error("tail needs list"); res->op = OCONST; res->type = TLIST; if(l.nstore.u0.sl) res->nstore.u0.sl = l.nstore.u0.sl->next; else res->nstore.u0.sl = 0;} voidoconst(Node *n, Node *res){ res->op = OCONST; res->type = n->type; res->nstore = n->nstore; res->nstore.comt = n->nstore.comt;} voidoname(Node *n, Node *res){ Value *v; v = n->sym->v; if(v->set == 0) error("%s used but not set", n->sym->name); res->op = OCONST; res->type = v->type; res->nstore = v->vstore; res->nstore.comt = v->vstore.comt;} voidoctruct(Node *n, Node *res){ res->op = OCONST; res->type = TLIST; res->nstore.u0.sl = construct(n->left);} voidoasgn(Node *n, Node *res){ Node *lp, r; Value *v; lp = n->left; switch(lp->op) { case OINDM: windir(cormap, lp->left, n->right, res); break; case OINDC: windir(symmap, lp->left, n->right, res); break; default: chklval(lp); v = lp->sym->v; expr(n->right, &r); v->set = 1; v->type = r.type; v->vstore = r.nstore; res->op = OCONST; res->type = v->type; res->nstore = v->vstore; res->nstore.comt = v->vstore.comt; }} voidoadd(Node *n, Node *res){ Node l, r; expr(n->left, &l); expr(n->right, &r); res->nstore.fmt = l.nstore.fmt; res->op = OCONST; res->type = TFLOAT; switch(l.type) { default: error("bad lhs type +"); case TINT: switch(r.type) { case TINT: res->type = TINT; res->nstore.u0.sival = l.nstore.u0.sival+r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sival+r.nstore.u0.sfval; break; default: error("bad rhs type +"); } break; case TFLOAT: switch(r.type) { case TINT: res->nstore.u0.sfval = l.nstore.u0.sfval+r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sfval+r.nstore.u0.sfval; break; default: error("bad rhs type +"); } break; case TSTRING: if(r.type == TSTRING) { res->type = TSTRING; res->nstore.fmt = 's'; res->nstore.u0.sstring = stradd(l.nstore.u0.sstring, r.nstore.u0.sstring); break; } error("bad rhs for +"); case TLIST: res->type = TLIST; switch(r.type) { case TLIST: res->nstore.u0.sl = addlist(l.nstore.u0.sl, r.nstore.u0.sl); break; default: r.left = 0; r.right = 0; res->nstore.u0.sl = addlist(l.nstore.u0.sl, construct(&r)); break; } }} voidosub(Node *n, Node *res){ Node l, r; expr(n->left, &l); expr(n->right, &r); res->nstore.fmt = l.nstore.fmt; res->op = OCONST; res->type = TFLOAT; switch(l.type) { default: error("bad lhs type -"); case TINT: switch(r.type) { case TINT: res->type = TINT; res->nstore.u0.sival = l.nstore.u0.sival-r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sival-r.nstore.u0.sfval; break; default: error("bad rhs type -"); } break; case TFLOAT: switch(r.type) { case TINT: res->nstore.u0.sfval = l.nstore.u0.sfval-r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sfval-r.nstore.u0.sfval; break; default: error("bad rhs type -"); } break; }} voidomul(Node *n, Node *res){ Node l, r; expr(n->left, &l); expr(n->right, &r); res->nstore.fmt = l.nstore.fmt; res->op = OCONST; res->type = TFLOAT; switch(l.type) { default: error("bad lhs type *"); case TINT: switch(r.type) { case TINT: res->type = TINT; res->nstore.u0.sival = l.nstore.u0.sival*r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sival*r.nstore.u0.sfval; break; default: error("bad rhs type *"); } break; case TFLOAT: switch(r.type) { case TINT: res->nstore.u0.sfval = l.nstore.u0.sfval*r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sfval*r.nstore.u0.sfval; break; default: error("bad rhs type *"); } break; }} voidodiv(Node *n, Node *res){ Node l, r; expr(n->left, &l); expr(n->right, &r); res->nstore.fmt = l.nstore.fmt; res->op = OCONST; res->type = TFLOAT; switch(l.type) { default: error("bad lhs type /"); case TINT: switch(r.type) { case TINT: res->type = TINT; if(r.nstore.u0.sival == 0) error("zero divide"); res->nstore.u0.sival = l.nstore.u0.sival/r.nstore.u0.sival;Lines 1–500 of 1032. Load more
#include <lib9.h> #include <bio.h> #include <ctype.h> #include "mach.h" #define Extern extern #include "acid.h" static int fsize[] = { 0,0,0,0,0,0,0,0, /* 0-7 */ 0,0,0,0,0,0,0,0, /* 8-15 */ 0,0,0,0,0,0,0,0, /* 16-23 */ 0,0,0,0,0,0,0,0, /* 24-31 */ 0,0,0,0,0,0,0,0, /* 32-39 */ 0,0,0,0,0,0,0,0, /* 40-47 */ 0,0,0,0,0,0,0,0, /* 48-55 */ 0,0,0,0,0,0,0,0, /* 56-63 */ 0, /* 64 */ 4, /* 65 ['A'] 4, */ 4, /* 66 ['B'] 4, */ 1, /* 67 ['C'] 1, */ 4, /* 68 ['D'] 4, */ 0, /* 69 */ 8, /* 70 ['F'] 8, */ 8, /* 71 ['G'] 8, */ 0,0,0,0,0,0,0, /* 72-78 */ 4, /* 79 ['O'] 4, */ 0, /* 80 */ 4, /* 81 ['Q'] 4, */ 4, /* 82 ['R'] 4, */ 4, /* 83 ['S'] 4, */ 0, /* 84 */ 4, /* 85 ['U'] 4, */ 8, /* 86 ['V'] 8, */ 0, /* 87 */ 4, /* 88 ['X'] 4, */ 8, /* 89 ['Y'] 8, */ 8, /* 90 ['Z'] 8, */ 0,0,0,0,0,0, /* 91-96 */ 4, /* 97 ['a'] 4, */ 1, /* 98 ['b'] 1, */ 1, /* 99 ['c'] 1, */ 2, /* 100 ['d'] 2, */ 0, /* 101 */ 4, /* 102 ['f'] 4, */ 4, /* 103 ['g'] 4, */ 0,0,0,0,0,0,0, /* 104-110 */ 2, /* 111 ['o'] 2, */ 0, /* 112 */ 2, /* 113 ['q'] 2, */ 2, /* 114 ['r'] 2, */ 4, /* 115 ['s'] 4, */ 0, /* 116 */ 2, /* 117 ['u'] 2, */ 0,0, /* 118-119 */ 2, /* 120 ['x'] 2, */ }; int fmtsize(Value *v) { int ret; switch(v->vstore.fmt) { default: return fsize[v->vstore.fmt]; case 'i': case 'I': if(v->type != TINT || machdata == 0) error("no size for i fmt pointer ++/--"); ret = (*machdata->instsize)(cormap, v->vstore.u0.sival); if(ret < 0) { ret = (*machdata->instsize)(symmap, v->vstore.u0.sival); if(ret < 0) error("%r"); } return ret; } } void chklval(Node *lp) { if(lp->op != ONAME) error("need l-value"); } void olist(Node *n, Node *res) { expr(n->left, res); expr(n->right, res); } void oeval(Node *n, Node *res) { expr(n->left, res); if(res->type != TCODE) error("bad type for eval"); expr(res->nstore.u0.scc, res); } void ocast(Node *n, Node *res) { if(n->sym->lt == 0) error("%s is not a complex type", n->sym->name); expr(n->left, res); res->nstore.comt = n->sym->lt; res->nstore.fmt = 'a'; } void oindm(Node *n, Node *res) { Map *m; Node l; m = cormap; if(m == 0) m = symmap; expr(n->left, &l); if(l.type != TINT) error("bad type for *"); if(m == 0) error("no map for *"); indir(m, l.nstore.u0.sival, l.nstore.fmt, res); res->nstore.comt = l.nstore.comt; } void oindc(Node *n, Node *res) { Map *m; Node l; m = symmap; if(m == 0) m = cormap; expr(n->left, &l); if(l.type != TINT) error("bad type for @"); if(m == 0) error("no map for @"); indir(m, l.nstore.u0.sival, l.nstore.fmt, res); res->nstore.comt = l.nstore.comt; } void oframe(Node *n, Node *res) { char *p; Node *lp; uvlong ival; Frtype *f; p = n->sym->name; while(*p && *p == '$') p++; lp = n->left; if(localaddr(cormap, p, lp->sym->name, &ival, rget) < 0) error("colon: %r"); res->nstore.u0.sival = ival; res->op = OCONST; res->nstore.fmt = 'X'; res->type = TINT; /* Try and set comt */ for(f = n->sym->local; f; f = f->next) { if(f->var == lp->sym) { res->nstore.comt = f->type; res->nstore.fmt = 'a'; break; } } } void oindex(Node *n, Node *res) { Node l, r; expr(n->left, &l); expr(n->right, &r); if(r.type != TINT) error("bad type for []"); switch(l.type) { default: error("lhs[] has bad type"); case TINT: indir(cormap, l.nstore.u0.sival+(r.nstore.u0.sival*fsize[l.nstore.fmt]), l.nstore.fmt, res); res->nstore.comt = l.nstore.comt; res->nstore.fmt = l.nstore.fmt; break; case TLIST: nthelem(l.nstore.u0.sl, r.nstore.u0.sival, res); break; case TSTRING: res->nstore.u0.sival = 0; if(r.nstore.u0.sival >= 0 && r.nstore.u0.sival < l.nstore.u0.sstring->len) { int xx8; /* to get around bug in vc */ xx8 = r.nstore.u0.sival; res->nstore.u0.sival = l.nstore.u0.sstring->string[xx8]; } res->op = OCONST; res->type = TINT; res->nstore.fmt = 'c'; break; } } void oappend(Node *n, Node *res) { Node r, l; expr(n->left, &l); expr(n->right, &r); if(l.type != TLIST) error("must append to list"); append(res, &l, &r); } void odelete(Node *n, Node *res) { Node l, r; expr(n->left, &l); expr(n->right, &r); if(l.type != TLIST) error("must delete from list"); if(r.type != TINT) error("delete index must be integer"); delete(l.nstore.u0.sl, r.nstore.u0.sival, res); } void ohead(Node *n, Node *res) { Node l; expr(n->left, &l); if(l.type != TLIST) error("head needs list"); res->op = OCONST; if(l.nstore.u0.sl) { res->type = l.nstore.u0.sl->type; res->nstore = l.nstore.u0.sl->lstore; } else { res->type = TLIST; res->nstore.u0.sl = 0; } } void otail(Node *n, Node *res) { Node l; expr(n->left, &l); if(l.type != TLIST) error("tail needs list"); res->op = OCONST; res->type = TLIST; if(l.nstore.u0.sl) res->nstore.u0.sl = l.nstore.u0.sl->next; else res->nstore.u0.sl = 0; } void oconst(Node *n, Node *res) { res->op = OCONST; res->type = n->type; res->nstore = n->nstore; res->nstore.comt = n->nstore.comt; } void oname(Node *n, Node *res) { Value *v; v = n->sym->v; if(v->set == 0) error("%s used but not set", n->sym->name); res->op = OCONST; res->type = v->type; res->nstore = v->vstore; res->nstore.comt = v->vstore.comt; } void octruct(Node *n, Node *res) { res->op = OCONST; res->type = TLIST; res->nstore.u0.sl = construct(n->left); } void oasgn(Node *n, Node *res) { Node *lp, r; Value *v; lp = n->left; switch(lp->op) { case OINDM: windir(cormap, lp->left, n->right, res); break; case OINDC: windir(symmap, lp->left, n->right, res); break; default: chklval(lp); v = lp->sym->v; expr(n->right, &r); v->set = 1; v->type = r.type; v->vstore = r.nstore; res->op = OCONST; res->type = v->type; res->nstore = v->vstore; res->nstore.comt = v->vstore.comt; } } void oadd(Node *n, Node *res) { Node l, r; expr(n->left, &l); expr(n->right, &r); res->nstore.fmt = l.nstore.fmt; res->op = OCONST; res->type = TFLOAT; switch(l.type) { default: error("bad lhs type +"); case TINT: switch(r.type) { case TINT: res->type = TINT; res->nstore.u0.sival = l.nstore.u0.sival+r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sival+r.nstore.u0.sfval; break; default: error("bad rhs type +"); } break; case TFLOAT: switch(r.type) { case TINT: res->nstore.u0.sfval = l.nstore.u0.sfval+r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sfval+r.nstore.u0.sfval; break; default: error("bad rhs type +"); } break; case TSTRING: if(r.type == TSTRING) { res->type = TSTRING; res->nstore.fmt = 's'; res->nstore.u0.sstring = stradd(l.nstore.u0.sstring, r.nstore.u0.sstring); break; } error("bad rhs for +"); case TLIST: res->type = TLIST; switch(r.type) { case TLIST: res->nstore.u0.sl = addlist(l.nstore.u0.sl, r.nstore.u0.sl); break; default: r.left = 0; r.right = 0; res->nstore.u0.sl = addlist(l.nstore.u0.sl, construct(&r)); break; } } } void osub(Node *n, Node *res) { Node l, r; expr(n->left, &l); expr(n->right, &r); res->nstore.fmt = l.nstore.fmt; res->op = OCONST; res->type = TFLOAT; switch(l.type) { default: error("bad lhs type -"); case TINT: switch(r.type) { case TINT: res->type = TINT; res->nstore.u0.sival = l.nstore.u0.sival-r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sival-r.nstore.u0.sfval; break; default: error("bad rhs type -"); } break; case TFLOAT: switch(r.type) { case TINT: res->nstore.u0.sfval = l.nstore.u0.sfval-r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sfval-r.nstore.u0.sfval; break; default: error("bad rhs type -"); } break; } } void omul(Node *n, Node *res) { Node l, r; expr(n->left, &l); expr(n->right, &r); res->nstore.fmt = l.nstore.fmt; res->op = OCONST; res->type = TFLOAT; switch(l.type) { default: error("bad lhs type *"); case TINT: switch(r.type) { case TINT: res->type = TINT; res->nstore.u0.sival = l.nstore.u0.sival*r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sival*r.nstore.u0.sfval; break; default: error("bad rhs type *"); } break; case TFLOAT: switch(r.type) { case TINT: res->nstore.u0.sfval = l.nstore.u0.sfval*r.nstore.u0.sival; break; case TFLOAT: res->nstore.u0.sfval = l.nstore.u0.sfval*r.nstore.u0.sfval; break; default: error("bad rhs type *"); } break; } } void odiv(Node *n, Node *res) { Node l, r; expr(n->left, &l); expr(n->right, &r); res->nstore.fmt = l.nstore.fmt; res->op = OCONST; res->type = TFLOAT; switch(l.type) { default: error("bad lhs type /"); case TINT: switch(r.type) { case TINT: res->type = TINT; if(r.nstore.u0.sival == 0) error("zero divide"); res->nstore.u0.sival = l.nstore.u0.sival/r.nstore.u0.sival;