text/plain
•
11.22 KB
•
452 lines
/* Nujel - Copyright (C) 2020-2021 - Benjamin Vincent Schulenburg
* This project uses the MIT license, a copy should be included under /LICENSE
*/
#include "bytecode.h"
#include "../exception.h"
#include "../allocation/symbol.h"
#include "../type/closure.h"
#include "../type/symbol.h"
#include "../collection/list.h"
#include "../misc/pf.h"
#include <string.h>
typedef enum lOpcode {
lopNOP = 0x0,
lopRet = 0x1,
lopIntByte = 0x2,
lopIntAdd = 0x3,
lopDebugPrintStack = 0x4,
lopPushLVal = 0x5,
lopMakeList = 0x6,
lopEval = 0x7,
lopApply = 0x8,
lopJmp = 0x9,
lopJt = 0xA,
lopJf = 0xB,
lopDup = 0xC,
lopDrop = 0xD,
lopDef = 0xE,
lopSet = 0xF,
lopGet = 0x10,
lopLambda = 0x11,
lopMacro = 0x12,
lopClosurePush = 0x13,
lopClosureEnter = 0x14,
lopLet = 0x15,
lopClosurePop = 0x16,
lopCall = 0x17,
lopTry = 0x18,
lopThrow = 0x19,
lopApplyDynamic = 0x1A,
lopRootsPush = 0x1B,
lopRootsPop = 0x1C,
lopRootsPeek = 0x1D,
lopLessPred = 0x1E,
lopLessEqPred = 0x1F,
lopEqualPred = 0x20,
lopGreaterEqPred = 0x21,
lopGreaterPred = 0x22,
} lOpcode;
int pushList(lVal **stack, int sp, lVal *args){
if(!args){return sp;}
sp = pushList(stack, sp, lCdr(args));
stack[sp] = lCar(args);
return sp + 1;
}
void printStack(lVal **stack, int sp, lClosure **cloStack, int csp){
(void)cloStack;
pf("-- Debug Output [SP:%u CSP:%u] -- %v\n", sp, csp);
while(sp > 0){
pf("%v\n",stack[--sp]);
}
}
static lVal *lStackBuildList(lVal **stack, int sp, int len){
lVal *ret, *t = NULL;
ret = RVP(lCons(NULL,NULL));
for(int i = len; i > 0; i--){
if(t == NULL){
ret->vList.car = stack[sp - i];
t = ret;
}else{
t->vList.cdr = lCons(stack[sp - i],NULL);
t = t->vList.cdr;
}
}
return ret;
}
static const lBytecodeOp *lBytecodeReadOPVal(const lBytecodeOp *ip, lVal **ret){
int i = *ip++;
i = (i << 8) | *ip++;
i = (i << 8) | *ip++;
*ret = lIndexVal(i);
return ip;
}
static const lBytecodeOp *lBytecodeReadOPSym(const lBytecodeOp *ip, lSymbol **ret){
int i = *ip++;
i = (i << 8) | *ip++;
i = (i << 8) | *ip++;
*ret = lIndexSym(i);
return ip;
}
static int lBytecodeGetOffset16(const lBytecodeOp *ip){
const int x = (ip[0] << 8) | ip[1];
return (x < (1 << 15)) ? x : -((1<<16) - x);
}
lVal *lBytecodeEval(lClosure *callingClosure, lVal *args, const lBytecodeArray *ops){
jmp_buf oldExceptionTarget;
const lBytecodeOp *ip;
int rootsStack[ROOT_STACK_SIZE];
rootsStack[0] = lRootsGet();
int rsp = 1;
lVal *stack[VALUE_STACK_SIZE];
lClosure *cloStack[CALL_STACK_SIZE];
lClosure *c = lClosureNew(callingClosure);
volatile int csp = 1;
int sp;
int exceptionCount = 0;
c->type = closureLet;
memset(stack, 0, sizeof(stack));
memset(cloStack, 0, sizeof(cloStack));
lRootsValStackPush(stack);
lRootsCallStackPush(cloStack);
cloStack[0] = c;
memcpy(oldExceptionTarget,exceptionTarget,sizeof(jmp_buf));
exceptionTargetDepth++;
const int setjmpRet = setjmp(exceptionTarget);
if(setjmpRet){
while((csp >= 0) && (c->type != closureTry)){
c = cloStack[--csp];
}
if((csp >= 0) && (++exceptionCount < 100000) && (c->type == closureTry)){
ip = c->ip;
sp = c->sp;
stack[sp++] = exceptionValue;
c = cloStack[--csp];
}else{
memcpy(exceptionTarget, oldExceptionTarget, sizeof(jmp_buf));
lExceptionThrowRaw(exceptionValue);
return NULL;
}
}else{
ip = ops->data;
sp = pushList(stack, 0, args);
csp = 1;
}
while((ip >= ops->data) && (ip < ops->dataEnd)){
switch(*ip){
default:
lExceptionThrowValClo("unknown-opcode", "Stubmbled upon an unknown opcode", NULL, c);
break;
case lopNOP:
ip++;
break;
case lopIntByte: {
const i8 v = *++ip;
stack[sp++] = lValInt(v);
ip++;
break;}
case lopIntAdd:
if(sp < 2){lExceptionThrowValClo("stack-underflow", "A stack underflow occured", NULL, c);}
stack[sp-2] = lValInt(castToInt(stack[sp-2],0) + castToInt(stack[sp-1],0));
sp--;
ip++;
break;
case lopLessPred:
if(sp < 2){lExceptionThrowValClo("stack-underflow", "A stack underflow occured", NULL, c);}
stack[sp-2] = lValBool(lValCompare(stack[sp-2], stack[sp-1]) == -1);
sp--;
ip++;
break;
case lopLessEqPred:
if(sp < 2){lExceptionThrowValClo("stack-underflow", "A stack underflow occured", NULL, c);}
stack[sp-2] = lValBool(lValCompare(stack[sp-2],stack[sp-1]) <= 0);
sp--;
ip++;
break;
case lopEqualPred:
if(sp < 2){lExceptionThrowValClo("stack-underflow", "A stack underflow occured", NULL, c);}
stack[sp-2] = lValBool(lValCompare(stack[sp-2],stack[sp-1]) == 0);
sp--;
ip++;
break;
case lopGreaterEqPred: {
if(sp < 2){lExceptionThrowValClo("stack-underflow", "A stack underflow occured", NULL, c);}
const int cmp = lValCompare(stack[sp-2],stack[sp-1]);
stack[sp-2] = lValBool((cmp == 1) || (cmp == 0));
sp--;
ip++;
break; }
case lopGreaterPred:
if(sp < 2){lExceptionThrowValClo("stack-underflow", "A stack underflow occured", NULL, c);}
stack[sp-2] = lValBool(lValCompare(stack[sp-2],stack[sp-1]) == 1);
sp--;
ip++;
break;
case lopDebugPrintStack:
pf("Bytecode Debug stack:\n");
printStack(stack, sp, cloStack, csp);
ip++;
break;
case lopPushLVal: {
ip = lBytecodeReadOPVal(ip+1, &stack[sp++]);
break;}
case lopMakeList: {
const int len = *++ip;
lVal *ret = lStackBuildList(stack, sp, len);
sp -= len;
stack[sp++] = ret;
ip++;
break;}
case lopEval:
stack[sp-1] = lEval(c,stack[sp-1]);
ip++;
break;
case lopApply: {
const int len = *++ip;
lVal *cargs = lStackBuildList(stack, sp, len);
sp -= len;
ip++;
lVal *fun = lIndexVal((ip[0] << 16) | (ip[1] << 8) | ip[2]);
stack[sp++] = lApply(c, cargs, fun, fun);
ip += 3;
break; }
case lopApplyDynamic: {
const int len = *++ip;
lVal *cargs = lStackBuildList(stack, sp, len);
sp -= len;
lVal *fun = RVP(stack[--sp]);
ip++;
stack[sp++] = lApply(c, cargs, fun, fun);
break; }
case lopDup:
if(sp < 1){lExceptionThrowValClo("stack-underflow", "Underflowed the stack while returning", NULL, c);}
stack[sp] = stack[sp-1];
sp++;
ip++;
break;
case lopJmp:
ip += lBytecodeGetOffset16(ip+1);
break;
case lopJt:
ip += castToBool(stack[--sp]) ? lBytecodeGetOffset16(ip+1) : 3;
break;
case lopJf:
ip += !castToBool(stack[--sp]) ? lBytecodeGetOffset16(ip+1) : 3;
break;
case lopDrop:
if(--sp < 0){lExceptionThrowValClo("stack-underflow", "Underflowed the stack while returning", NULL, c);}
ip++;
break;
case lopDef: {
lSymbol *sym;
ip = lBytecodeReadOPSym(ip+1, &sym);
lDefineClosureSym(c, sym, stack[sp - 1]);
break; }
case lopSet: {
lSymbol *sym;
ip = lBytecodeReadOPSym(ip+1, &sym);
lSetClosureSym(c, sym, stack[sp - 1]);
break; }
case lopGet: {
lSymbol *sym;
ip = lBytecodeReadOPSym(ip+1, &sym);
stack[sp++] = lGetClosureSym(c, sym);
break; }
case lopLambda: {
lVal *cName, *cArgs, *cDocs, *cBody;
ip = lBytecodeReadOPVal(ip+1, &cName);
ip = lBytecodeReadOPVal(ip, &cArgs);
ip = lBytecodeReadOPVal(ip, &cDocs);
ip = lBytecodeReadOPVal(ip, &cBody);
stack[sp++] = lLambdaNew(c, cName, cArgs, cDocs, cBody);
break;}
case lopMacro: {
lVal *cName, *cArgs, *cDocs, *cBody;
ip = lBytecodeReadOPVal(ip+1, &cName);
ip = lBytecodeReadOPVal(ip, &cArgs);
ip = lBytecodeReadOPVal(ip, &cDocs);
ip = lBytecodeReadOPVal(ip, &cBody);
stack[sp++] = lLambdaNew(c, cName, cArgs, cDocs, cBody);
if(stack[sp-1]){
stack[sp-1]->type = ltMacro;
}
break; }
case lopRootsPush:
ip++;
rootsStack[rsp++] = lRootsGet();
break;
case lopRootsPop:
ip++;
if(rsp == 0){
lExceptionThrowValClo("stack-underflow", "Poped one too many times off the roots stack", NULL, c);
}
lRootsRet(rootsStack[--rsp]);
break;
case lopRootsPeek:
ip++;
lRootsRet(rootsStack[rsp - 1]);
break;
case lopClosurePush:
ip++;
stack[sp++] = lValObject(c);
break;
case lopClosureEnter: {
ip++;
lVal *cObj = stack[--sp];
if((cObj->type != ltLambda) && (cObj->type != ltObject)){
lExceptionThrowValClo("invalid-closure", "Error while trying to enter a closure", cObj, c);
}
cloStack[csp++] = c;
c = cObj->vClosure;
cloStack[csp] = c;
break; }
case lopLet:
ip++;
cloStack[csp++] = c;
c = lClosureNew(c);
c->type = closureLet;
cloStack[csp] = c;
break;
case lopClosurePop:
ip++;
while(csp > 0){
lClosure *nclo = cloStack[--csp];
if(nclo->type == closureTry){continue;}
c = nclo;
break;
}
if(csp == 0){
lRootsRet(rootsStack[0]);
if(sp < 1){lExceptionThrowValClo("stack-underflow", "Underflowed the stack while returning", NULL, c);}
return NULL;
}
break;
case lopCall:
c->ip = ip+3;
c->sp = sp;
cloStack[csp++] = c;
c = lClosureNew(c);
c->type = closureCall;
cloStack[csp] = c;
ip += lBytecodeGetOffset16(ip+1);
break;
case lopTry:
cloStack[csp++] = c;
c = lClosureNew(c);
c->type = closureTry;
c->ip = ip + lBytecodeGetOffset16(ip+1);
c->sp = sp;
cloStack[csp] = c;
ip+=3;
break;
case lopRet:
while(csp > 0){
lVal *rv = stack[sp-1];
lClosure *nclo = cloStack[--csp];
if(csp == 0){break;}
if((nclo->type == closureTry)
|| (nclo->type == closureLet)){
continue;
}
ip = nclo->ip;
sp = nclo->sp;
stack[sp++] = rv;
break;
}
if(csp == 0){
lRootsRet(rootsStack[0]);
if(sp < 1){
lExceptionThrowValClo("stack-underflow", "Underflowed the stack while returning", NULL, c);
return NULL;
}
memcpy(exceptionTarget, oldExceptionTarget, sizeof(jmp_buf));
exceptionTargetDepth--;
return stack[--sp];
}
break;
case lopThrow:
ip++;
while(csp > 0){
lVal *rv = stack[sp-1];
lClosure *nclo = cloStack[--csp];
if(!nclo || csp == 0){break;}
if(nclo->type != closureTry){continue;}
ip = nclo->ip;
sp = nclo->sp;
stack[sp++] = rv;
break;
}
if(csp == 0){
lRootsRet(rootsStack[0]);
if(sp < 1){lExceptionThrowValClo("stack-underflow", "Underflowed the stack while returning", NULL, c);}
lExceptionThrowRaw(stack[--sp]);
return NULL;
}
break;
}}
lExceptionThrowValClo("expected-return", "The bytecode evaluator expected and explicit return operation", NULL, c);
return NULL;
}
static int lBytecodeOpLength(const lBytecodeOp op){
switch(op){
default:
return 1;
case lopMakeList:
case lopApplyDynamic:
case lopIntByte:
return 2;
case lopCall:
case lopTry:
case lopJmp:
case lopJf:
case lopJt:
return 3;
case lopDef:
case lopSet:
case lopGet:
case lopPushLVal:
return 4;
case lopApply:
return 5;
case lopLambda:
case lopMacro:
return 4*3+1;
}
}
void lBytecodeArrayMark(const lBytecodeArray *v){
for(const lBytecodeOp *c = v->data; c < v->dataEnd; c += lBytecodeOpLength(*c)){
switch(*c){
default: break;
case lopDef:
case lopGet:
case lopSet:
lSymbolGCMark(lIndexSym((c[1] << 16) | (c[2] << 8) | c[3]));
break;
case lopLambda:
case lopMacro:
lValGCMark(lIndexVal((c[ 1] << 16) | (c[ 2] << 8) | c[ 3]));
lValGCMark(lIndexVal((c[ 4] << 16) | (c[ 5] << 8) | c[ 6]));
lValGCMark(lIndexVal((c[ 7] << 16) | (c[ 8] << 8) | c[ 9]));
lValGCMark(lIndexVal((c[10] << 16) | (c[11] << 8) | c[12]));
break;
case lopPushLVal:
lValGCMark(lIndexVal((c[1] << 16) | (c[2] << 8) | c[3]));
break;
}
}
}
