1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414
|
/*****
* coder.cc
* Andy Hammerlindl 2004/11/06
*
* Handles encoding of syntax into programs. It's methods are called by
* abstract syntax objects during translation to construct the virtual machine
* code.
*****/
#include <utility>
#include "errormsg.h"
#include "coder.h"
#include "genv.h"
#include "entry.h"
#include "builtin.h"
using namespace sym;
using namespace types;
namespace trans {
namespace {
function *inittype();
function *bootuptype();
}
vm::lambda *newLambda(string name) {
assert(!name.empty());
vm::lambda *l = new vm::lambda;
#ifdef DEBUG_FRAME
l->name = name;
#endif
return l;
}
// Used purely for global variables and static code blocks of file
// level modules.
coder::coder(position pos, string name, modifier sord)
#ifdef SIMPLE_FRAME
: level(frame::indirect_frame(name)),
#else
: level(new frame(name, 0, 0)),
#endif
recordLevel(0),
recordType(0),
isCodelet(false),
l(newLambda(name)),
funtype(bootuptype()),
parent(0),
sord(sord),
perm(DEFAULT_PERM),
program(new vm::program),
curPos(pos)
{
sord_stack.push(sord);
}
// Defines a new function environment.
coder::coder(position pos, string name, function *t, coder *parent,
modifier sord, bool reframe)
: level(reframe ? new frame(name,
parent->getFrame(),
t->sig.getNumFormals()) :
parent->getFrame()),
recordLevel(parent->recordLevel),
recordType(parent->recordType),
isCodelet(!reframe),
l(newLambda(name)),
funtype(t),
parent(parent),
sord(sord),
perm(DEFAULT_PERM),
program(new vm::program),
curPos(pos)
{
sord_stack.push(sord);
}
// Start encoding the body of the record. The function being encoded
// is the record's initializer.
coder::coder(position pos, record *t, coder *parent, modifier sord)
: level(t->getLevel()),
recordLevel(t->getLevel()),
recordType(t),
isCodelet(false),
l(t->getInit()),
funtype(inittype()),
parent(parent),
sord(sord),
perm(DEFAULT_PERM),
program(new vm::program),
curPos(pos)
{
sord_stack.push(sord);
}
coder coder::newFunction(position pos, string name, function *t, modifier sord)
{
return coder(pos, name, t, this, sord);
}
coder coder::newCodelet(position pos)
{
return coder(pos, "<codelet>", new function(primVoid()), this,
DEFAULT_DYNAMIC, false);
}
record *coder::newRecord(symbol id)
{
frame *underlevel = getFrame();
frame *level = new frame(id, underlevel, 0);
record *r = new record(id, level);
return r;
}
coder coder::newRecordInit(position pos, record *r, modifier sord)
{
return coder(pos, r, this, sord);
}
#ifdef DEBUG_BLTIN
void assertBltinLookup(inst::opcode op, item it)
{
if (op == inst::builtin) {
string name=lookupBltin(vm::get<vm::bltin>(it));
assert(!name.empty());
}
}
#endif
void coder::encodePop()
{
if (isStatic() && !isTopLevel()) {
assert(parent);
parent->encodePop();
}
else {
#ifdef COMBO
vm::program::label end = program->end();
--end;
inst& lastInst = *end;
if (lastInst.op == inst::varsave) {
lastInst.op = inst::varpop;
return;
}
if (lastInst.op == inst::fieldsave) {
lastInst.op = inst::fieldpop;
return;
}
// TODO: push+pop into no op.
#endif
// No combo applicable. Just encode a usual pop.
encode(inst::pop);
}
}
bool coder::encode(frame *f)
{
frame *toplevel = getFrame();
if (f == 0) {
encode(inst::constpush,(item)0);
return true;
}
else if (f == toplevel) {
encode(inst::pushclosure);
return true;
}
else {
encode(inst::varpush,toplevel->parentIndex());
return encode(f, toplevel->getParent());
}
}
bool coder::encode(frame *dest, frame *top)
{
if (dest == 0) {
// Change to encodePop?
encode(inst::pop);
encode(inst::constpush,(item)0);
}
else {
frame *level = top;
while (level != dest) {
if (level == 0) {
// Frame request was in an improper scope.
return false;
}
encode(inst::fieldpush, level->parentIndex());
level = level->getParent();
}
}
//cerr << "succeeded\n";
return true;
}
vm::program::label coder::encodeEmptyJump(inst::opcode op)
{
// Get the end position before encoding the label. Once encoded, this will
// point to the instruction.
vm::program::label pos = program->end();
encode(op);
return pos;
}
void replaceEmptyJump(vm::program::label from, vm::program::label to)
{
from->ref = to;
}
label coder::defNewLabel()
{
if (isStatic())
return parent->defNewLabel();
label l = new label_t();
assert(!l->location.defined());
assert(!l->firstUse.defined());
return defLabel(l);
}
label coder::defLabel(label label)
{
if (isStatic())
return parent->defLabel(label);
//cout << "defining label " << label << endl;
assert(!label->location.defined());
//vm::program::label here = program->end();
label->location = program->end();
assert(label->location.defined());
if (label->firstUse.defined()) {
replaceEmptyJump(label->firstUse, program->end());
//vm::printInst(cout, label->firstUse, program->begin());
//cout << endl;
if (label->moreUses) {
typedef label_t::useVector useVector;
useVector& v = *label->moreUses;
for (useVector::iterator p = v.begin(); p != v.end(); ++p) {
replaceEmptyJump(*p, program->end());
}
}
}
return label;
}
void coder::useLabel(inst::opcode op, label label)
{
if (isStatic())
return parent->useLabel(op,label);
if (label->location.defined()) {
encode(op, label->location);
} else {
if (label->firstUse.defined()) {
// Store additional uses in the moreUses array.
if (!label->moreUses)
label->moreUses = new label_t::useVector;
label->moreUses->push_back(encodeEmptyJump(op));
}
else {
label->firstUse = encodeEmptyJump(op);
assert(label->firstUse.defined());
assert(!label->location.defined());
}
}
}
label coder::fwdLabel()
{
if (isStatic())
return parent->fwdLabel();
// Create a new label without specifying its position.
label l = new label_t();
assert(!l->location.defined());
assert(!l->firstUse.defined());
//cout << "forward label " << l << endl;
return l;
}
bool coder::usesClosureSinceLabel(label l)
{
assert(l->location.defined());
for (vm::program::label i = l->location; i != program->end(); ++i)
if (i->op == inst::pushclosure)
return true;
return false;
}
void coder::encodePatch(label from, label to)
{
assert(from->location.defined());
assert(to->location.defined());
assert(from->location->op == inst::nop);
from->location->op = inst::jmp;
from->location->ref = to->location;
}
void coder::markPos(position pos)
{
curPos = pos;
}
// When translating the function is finished, this ties up loose ends
// and returns the lambda.
vm::lambda *coder::close() {
// These steps must be done dynamically, not statically.
sord = EXPLICIT_DYNAMIC;
sord_stack.push(sord);
// Add a return for void types; may be redundant.
if (funtype->result->kind == types::ty_void)
encode(inst::ret);
l->code = program;
l->parentIndex = level->parentIndex();
l->framesize = level->size();
sord_stack.pop();
sord = sord_stack.top();
return l;
}
void coder::closeRecord()
{
// Put record into finished state.
encode(inst::pushclosure);
close();
}
bool coder::isRecord()
{
return (funtype==inittype());
}
namespace {
function *inittype()
{
static function t(types::primVoid());
return &t;
}
function *bootuptype()
{
static function t(types::primVoid());
return &t;
}
} // private
bool coder::encodeParent(position pos, trans::tyEntry *ent) {
record *r = dynamic_cast<record *>(ent->t);
if (!r) {
em.compiler(pos);
em << "type '" << *ent->t << "' is not a structure";
return false;
}
assert(r);
// The level needed on which to allocate the record.
frame *level = r->getLevel()->getParent();
if (ent->v) {
// Put the record on the stack. For instance, in code like
// access imp;
// new imp.t;
// we are putting the instance of imp on the stack, so we can use it to
// allocate an instance of imp.t.
ent->v->encode(trans::READ, pos, *this);
// Adjust to the right frame. For instance, in the last new in
// struct A {
// struct B {
// static struct C {}
// }
// B b=new B;
// }
// A a=new A;
// new a.b.C;
// we push a.b onto the stack, but need a as the enclosing frame for
// allocating an instance of C.
record* q= dynamic_cast<record*>(ent->v->getType());
assert(q);
return encode(level, q->getLevel());
} else
return encode(level);
}
} // namespace trans
|