forked from xxq250/Nasal-Interpreter
ValKmjolnir
1005 lines
27 KiB
C++
1005 lines
27 KiB
C++
#ifndef __NASAL_VM_H__
|
|
#define __NASAL_VM_H__
|
|
|
|
class nasal_vm
|
|
{
|
|
private:
|
|
/* reference from nasal_gc */
|
|
nasal_val**& stack_top;// stack top
|
|
/* values of nasal_vm */
|
|
uint32_t pc; // program counter
|
|
std::stack<int> ret; // ptr stack stores address for function to return
|
|
std::stack<int> counter; // iterator stack for forindex/foreach
|
|
std::vector<double> num_table;// numbers used in process(const calculation)
|
|
std::vector<std::string> str_table;// symbols used in process
|
|
std::vector<uint32_t> imm; // immediate number
|
|
nasal_val** mem_addr; // used for mem_call
|
|
nasal_gc gc; // garbage collector
|
|
|
|
void die(std::string);
|
|
bool condition(nasal_val*);
|
|
void opr_intg();
|
|
void opr_intl();
|
|
void opr_offset();
|
|
void opr_loadg();
|
|
void opr_loadl();
|
|
void opr_pnum();
|
|
void opr_pone();
|
|
void opr_pzero();
|
|
void opr_pnil();
|
|
void opr_pstr();
|
|
void opr_newv();
|
|
void opr_newh();
|
|
void opr_newf();
|
|
void opr_happ();
|
|
void opr_para();
|
|
void opr_defpara();
|
|
void opr_dynpara();
|
|
void opr_unot();
|
|
void opr_usub();
|
|
void opr_add();
|
|
void opr_sub();
|
|
void opr_mul();
|
|
void opr_div();
|
|
void opr_lnk();
|
|
void opr_addc();
|
|
void opr_subc();
|
|
void opr_mulc();
|
|
void opr_divc();
|
|
void opr_lnkc();
|
|
void opr_addeq();
|
|
void opr_subeq();
|
|
void opr_muleq();
|
|
void opr_diveq();
|
|
void opr_lnkeq();
|
|
void opr_addeqc();
|
|
void opr_subeqc();
|
|
void opr_muleqc();
|
|
void opr_diveqc();
|
|
void opr_lnkeqc();
|
|
void opr_meq();
|
|
void opr_eq();
|
|
void opr_neq();
|
|
void opr_less();
|
|
void opr_leq();
|
|
void opr_grt();
|
|
void opr_geq();
|
|
void opr_lessc();
|
|
void opr_leqc();
|
|
void opr_grtc();
|
|
void opr_geqc();
|
|
void opr_pop();
|
|
void opr_jmp();
|
|
void opr_jt();
|
|
void opr_jf();
|
|
void opr_counter();
|
|
void opr_cntpop();
|
|
void opr_findex();
|
|
void opr_feach();
|
|
void opr_callg();
|
|
void opr_calll();
|
|
void opr_callv();
|
|
void opr_callvi();
|
|
void opr_callh();
|
|
void opr_callfv();
|
|
void opr_callfh();
|
|
void opr_callb();
|
|
void opr_slcbegin();
|
|
void opr_slcend();
|
|
void opr_slc();
|
|
void opr_slc2();
|
|
void opr_mcallg();
|
|
void opr_mcalll();
|
|
void opr_mcallv();
|
|
void opr_mcallh();
|
|
void opr_ret();
|
|
public:
|
|
nasal_vm():stack_top(gc.stack_top){};
|
|
void init(
|
|
std::vector<std::string>&,
|
|
std::vector<double>&);
|
|
void clear();
|
|
void run(std::vector<opcode>&);
|
|
};
|
|
|
|
void nasal_vm::init(
|
|
std::vector<std::string>& strs,
|
|
std::vector<double>& nums)
|
|
{
|
|
gc.gc_init(nums,strs);
|
|
gc.val_stack[STACK_MAX_DEPTH-1]=nullptr;
|
|
num_table=nums; // get constant numbers
|
|
str_table=strs; // get constant strings & symbols
|
|
return;
|
|
}
|
|
void nasal_vm::clear()
|
|
{
|
|
gc.gc_clear();
|
|
while(!ret.empty())
|
|
ret.pop();
|
|
while(!counter.empty())
|
|
counter.pop();
|
|
num_table.clear();
|
|
str_table.clear();
|
|
imm.clear();
|
|
return;
|
|
}
|
|
void nasal_vm::die(std::string str)
|
|
{
|
|
printf(">> [vm] 0x%.8x: %s\n",pc,str.c_str());
|
|
gc.val_stack[STACK_MAX_DEPTH-1]=(nasal_val*)0xffff;
|
|
return;
|
|
}
|
|
bool nasal_vm::condition(nasal_val* val_addr)
|
|
{
|
|
if(val_addr->type==vm_num)
|
|
return val_addr->ptr.num;
|
|
else if(val_addr->type==vm_str)
|
|
{
|
|
std::string& str=*val_addr->ptr.str;
|
|
double num=str2num(str.c_str());
|
|
if(std::isnan(num))
|
|
return str.empty();
|
|
return num;
|
|
}
|
|
return false;
|
|
}
|
|
inline void nasal_vm::opr_intg()
|
|
{
|
|
// global values store on stack
|
|
for(int i=0;i<imm[pc];++i)
|
|
(stack_top++)[0]=gc.nil_addr;
|
|
--stack_top;// point to the top
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_intl()
|
|
{
|
|
stack_top[0]->ptr.func->closure.resize(imm[pc],gc.nil_addr);
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_offset()
|
|
{
|
|
stack_top[0]->ptr.func->offset=imm[pc];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_loadg()
|
|
{
|
|
gc.val_stack[imm[pc]]=(stack_top--)[0];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_loadl()
|
|
{
|
|
gc.local.back()[imm[pc]]=(stack_top--)[0];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_pnum()
|
|
{
|
|
(++stack_top)[0]=gc.num_addrs[imm[pc]];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_pone()
|
|
{
|
|
(++stack_top)[0]=gc.one_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_pzero()
|
|
{
|
|
(++stack_top)[0]=gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_pnil()
|
|
{
|
|
(++stack_top)[0]=gc.nil_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_pstr()
|
|
{
|
|
(++stack_top)[0]=gc.str_addrs[imm[pc]];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_newv()
|
|
{
|
|
nasal_val* vec_addr=gc.gc_alloc(vm_vec);
|
|
nasal_val** begin=stack_top-imm[pc]+1;
|
|
auto& vec=vec_addr->ptr.vec->elems;// stack_top-imm[pc] stores the vector
|
|
vec.resize(imm[pc]);
|
|
for(int i=0;i<imm[pc];++i)
|
|
vec[i]=begin[i];
|
|
begin[0]=vec_addr;
|
|
stack_top=begin;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_newh()
|
|
{
|
|
(++stack_top)[0]=gc.gc_alloc(vm_hash);
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_newf()
|
|
{
|
|
nasal_val* val=gc.gc_alloc(vm_func);
|
|
val->ptr.func->entry=imm[pc];
|
|
if(gc.local.empty())
|
|
val->ptr.func->closure.push_back(gc.nil_addr);// me
|
|
else
|
|
val->ptr.func->closure=gc.local.back();// local contains 'me'
|
|
(++stack_top)[0]=val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_happ()
|
|
{
|
|
nasal_val* val=stack_top[0];
|
|
(--stack_top)[0]->ptr.hash->elems[str_table[imm[pc]]]=val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_para()
|
|
{
|
|
nasal_func* func=stack_top[0]->ptr.func;
|
|
int size=func->key_table.size();
|
|
func->key_table[str_table[imm[pc]]]=size;
|
|
func->default_para.push_back(nullptr);
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_defpara()
|
|
{
|
|
nasal_val* def_val=stack_top[0];
|
|
nasal_func* func=(--stack_top)[0]->ptr.func;
|
|
int size=func->key_table.size();
|
|
func->key_table[str_table[imm[pc]]]=size;
|
|
func->default_para.push_back(def_val);
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_dynpara()
|
|
{
|
|
stack_top[0]->ptr.func->dynpara=imm[pc];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_unot()
|
|
{
|
|
nasal_val* val=stack_top[0];
|
|
int type=val->type;
|
|
if(type==vm_nil)
|
|
stack_top[0]=gc.one_addr;
|
|
else if(type==vm_num)
|
|
stack_top[0]=val->ptr.num?gc.zero_addr:gc.one_addr;
|
|
else if(type==vm_str)
|
|
{
|
|
double num=str2num(val->ptr.str->c_str());
|
|
if(std::isnan(num))
|
|
stack_top[0]=val->ptr.str->empty()?gc.one_addr:gc.zero_addr;
|
|
else
|
|
stack_top[0]=num?gc.zero_addr:gc.one_addr;
|
|
}
|
|
else
|
|
die("unot: incorrect value type");
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_usub()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=-stack_top[0]->to_number();
|
|
stack_top[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_add()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=stack_top[-1]->to_number()+stack_top[0]->to_number();
|
|
(--stack_top)[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_sub()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=stack_top[-1]->to_number()-stack_top[0]->to_number();
|
|
(--stack_top)[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_mul()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=stack_top[-1]->to_number()*stack_top[0]->to_number();
|
|
(--stack_top)[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_div()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=stack_top[-1]->to_number()/stack_top[0]->to_number();
|
|
(--stack_top)[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_lnk()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_str);
|
|
*new_val->ptr.str=stack_top[-1]->to_string()+stack_top[0]->to_string();
|
|
(--stack_top)[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_addc()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=stack_top[0]->to_number()+num_table[imm[pc]];
|
|
stack_top[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_subc()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=stack_top[0]->to_number()-num_table[imm[pc]];
|
|
stack_top[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_mulc()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=stack_top[0]->to_number()*num_table[imm[pc]];
|
|
stack_top[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_divc()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=stack_top[0]->to_number()/num_table[imm[pc]];
|
|
stack_top[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_lnkc()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_str);
|
|
*new_val->ptr.str=stack_top[0]->to_string()+str_table[imm[pc]];
|
|
stack_top[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_addeq()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=mem_addr[0]->to_number()+stack_top[-1]->to_number();
|
|
(--stack_top)[0]=mem_addr[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_subeq()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=mem_addr[0]->to_number()-stack_top[-1]->to_number();
|
|
(--stack_top)[0]=mem_addr[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_muleq()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=mem_addr[0]->to_number()*stack_top[-1]->to_number();
|
|
(--stack_top)[0]=mem_addr[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_diveq()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=mem_addr[0]->to_number()/stack_top[-1]->to_number();
|
|
(--stack_top)[0]=mem_addr[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_lnkeq()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_str);
|
|
*new_val->ptr.str=mem_addr[0]->to_string()+stack_top[-1]->to_string();
|
|
(--stack_top)[0]=mem_addr[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_addeqc()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=mem_addr[0]->to_number()+num_table[imm[pc]];
|
|
stack_top[0]=mem_addr[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_subeqc()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=mem_addr[0]->to_number()-num_table[imm[pc]];
|
|
stack_top[0]=mem_addr[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_muleqc()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=mem_addr[0]->to_number()*num_table[imm[pc]];
|
|
stack_top[0]=mem_addr[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_diveqc()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_num);
|
|
new_val->ptr.num=mem_addr[0]->to_number()/num_table[imm[pc]];
|
|
stack_top[0]=mem_addr[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_lnkeqc()
|
|
{
|
|
nasal_val* new_val=gc.gc_alloc(vm_str);
|
|
*new_val->ptr.str=mem_addr[0]->to_string()+str_table[imm[pc]];
|
|
stack_top[0]=mem_addr[0]=new_val;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_meq()
|
|
{
|
|
mem_addr[0]=(--stack_top)[0];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_eq()
|
|
{
|
|
nasal_val* val2=stack_top[0];
|
|
nasal_val* val1=(--stack_top)[0];
|
|
int a_type=val1->type;
|
|
int b_type=val2->type;
|
|
if(a_type==vm_nil && b_type==vm_nil)
|
|
stack_top[0]=gc.one_addr;
|
|
else if(a_type==vm_str && b_type==vm_str)
|
|
stack_top[0]=(*val1->ptr.str==*val2->ptr.str)?gc.one_addr:gc.zero_addr;
|
|
else if(a_type==vm_num || b_type==vm_num)
|
|
stack_top[0]=(val1->to_number()==val2->to_number())?gc.one_addr:gc.zero_addr;
|
|
else
|
|
stack_top[0]=(val1==val2)?gc.one_addr:gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_neq()
|
|
{
|
|
nasal_val* val2=stack_top[0];
|
|
nasal_val* val1=(--stack_top)[0];
|
|
int a_type=val1->type;
|
|
int b_type=val2->type;
|
|
if(a_type==vm_nil && b_type==vm_nil)
|
|
stack_top[0]=gc.zero_addr;
|
|
else if(a_type==vm_str && b_type==vm_str)
|
|
stack_top[0]=(*val1->ptr.str!=*val2->ptr.str)?gc.one_addr:gc.zero_addr;
|
|
else if(a_type==vm_num || b_type==vm_num)
|
|
stack_top[0]=(val1->to_number()!=val2->to_number())?gc.one_addr:gc.zero_addr;
|
|
else
|
|
stack_top[0]=(val1!=val2)?gc.one_addr:gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_less()
|
|
{
|
|
--stack_top;
|
|
stack_top[0]=(stack_top[0]->to_number()<stack_top[1]->to_number())?gc.one_addr:gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_leq()
|
|
{
|
|
--stack_top;
|
|
stack_top[0]=(stack_top[0]->to_number()<=stack_top[1]->to_number())?gc.one_addr:gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_grt()
|
|
{
|
|
--stack_top;
|
|
stack_top[0]=(stack_top[0]->to_number()>stack_top[1]->to_number())?gc.one_addr:gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_geq()
|
|
{
|
|
--stack_top;
|
|
stack_top[0]=(stack_top[0]->to_number()>=stack_top[1]->to_number())?gc.one_addr:gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_lessc()
|
|
{
|
|
stack_top[0]=(stack_top[0]->to_number()<num_table[imm[pc]])?gc.one_addr:gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_leqc()
|
|
{
|
|
stack_top[0]=(stack_top[0]->to_number()<=num_table[imm[pc]])?gc.one_addr:gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_grtc()
|
|
{
|
|
stack_top[0]=(stack_top[0]->to_number()>num_table[imm[pc]])?gc.one_addr:gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_geqc()
|
|
{
|
|
stack_top[0]=(stack_top[0]->to_number()>=num_table[imm[pc]])?gc.one_addr:gc.zero_addr;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_pop()
|
|
{
|
|
--stack_top;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_jmp()
|
|
{
|
|
pc=imm[pc]-1;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_jt()
|
|
{
|
|
if(condition(stack_top[0]))
|
|
pc=imm[pc]-1;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_jf()
|
|
{
|
|
if(!condition(stack_top[0]))
|
|
pc=imm[pc]-1;
|
|
--stack_top;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_counter()
|
|
{
|
|
counter.push(-1);
|
|
if(stack_top[0]->type!=vm_vec)
|
|
die("cnt: must use vector in forindex/foreach");
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_cntpop()
|
|
{
|
|
counter.pop();
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_findex()
|
|
{
|
|
if(++counter.top()>=stack_top[0]->ptr.vec->elems.size())
|
|
{
|
|
pc=imm[pc]-1;
|
|
return;
|
|
}
|
|
(++stack_top)[0]=gc.gc_alloc(vm_num);
|
|
stack_top[0]->ptr.num=counter.top();
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_feach()
|
|
{
|
|
std::vector<nasal_val*>& ref=stack_top[0]->ptr.vec->elems;
|
|
if(++counter.top()>=ref.size())
|
|
{
|
|
pc=imm[pc]-1;
|
|
return;
|
|
}
|
|
(++stack_top)[0]=ref[counter.top()];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_callg()
|
|
{
|
|
(++stack_top)[0]=gc.val_stack[imm[pc]];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_calll()
|
|
{
|
|
(++stack_top)[0]=gc.local.back()[imm[pc]];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_callv()
|
|
{
|
|
nasal_val* val=stack_top[0];
|
|
nasal_val* vec_addr=(--stack_top)[0];
|
|
int type=vec_addr->type;
|
|
if(type==vm_vec)
|
|
{
|
|
stack_top[0]=vec_addr->ptr.vec->get_val(val->to_number());
|
|
if(!stack_top[0])
|
|
die("callv: index out of range:"+num2str(val->to_number()));
|
|
}
|
|
else if(type==vm_hash)
|
|
{
|
|
if(val->type!=vm_str)
|
|
{
|
|
die("callv: must use string as the key");
|
|
return;
|
|
}
|
|
stack_top[0]=vec_addr->ptr.hash->get_val(*val->ptr.str);
|
|
if(!stack_top[0])
|
|
{
|
|
die("callv: cannot find member \""+*val->ptr.str+"\" of this hash");
|
|
return;
|
|
}
|
|
if(stack_top[0]->type==vm_func)
|
|
stack_top[0]->ptr.func->closure[0]=val;// me
|
|
}
|
|
else if(type==vm_str)
|
|
{
|
|
std::string& str=*vec_addr->ptr.str;
|
|
int num=val->to_number();
|
|
int str_size=str.length();
|
|
if(num<-str_size || num>=str_size)
|
|
{
|
|
die("callv: index out of range:"+num2str(val->to_number()));
|
|
return;
|
|
}
|
|
stack_top[0]=gc.gc_alloc(vm_num);
|
|
stack_top[0]->ptr.num=(str[num>=0? num:num+str_size]);
|
|
}
|
|
else
|
|
die("callv: must call a vector/hash/string");
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_callvi()
|
|
{
|
|
nasal_val* val=stack_top[0];
|
|
if(val->type!=vm_vec)
|
|
{
|
|
die("callvi: must use a vector");
|
|
return;
|
|
}
|
|
// cannot use operator[],because this may cause overflow
|
|
(++stack_top)[0]=val->ptr.vec->get_val(imm[pc]);
|
|
if(!stack_top[0])
|
|
die("callvi: index out of range:"+num2str(imm[pc]));
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_callh()
|
|
{
|
|
nasal_val* val=stack_top[0];
|
|
if(val->type!=vm_hash)
|
|
{
|
|
die("callh: must call a hash");
|
|
return;
|
|
}
|
|
stack_top[0]=val->ptr.hash->get_val(str_table[imm[pc]]);
|
|
if(!stack_top[0])
|
|
{
|
|
die("callh: member \""+str_table[imm[pc]]+"\" does not exist");
|
|
return;
|
|
}
|
|
if(stack_top[0]->type==vm_func)
|
|
stack_top[0]->ptr.func->closure[0]=val;// me
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_callfv()
|
|
{
|
|
// get parameter list and function value
|
|
int args_size=imm[pc];
|
|
nasal_val** vec=stack_top-args_size+1;
|
|
nasal_val* func_addr=vec[-1];
|
|
if(func_addr->type!=vm_func)
|
|
{
|
|
die("callfv: must call a function");
|
|
return;
|
|
}
|
|
// push new local scope
|
|
auto& ref_func=*func_addr->ptr.func;
|
|
gc.local.push_back(ref_func.closure);
|
|
// load parameters
|
|
auto& ref_default=ref_func.default_para;
|
|
auto& ref_closure=gc.local.back();
|
|
|
|
int offset=ref_func.offset;
|
|
int para_size=ref_func.key_table.size();
|
|
// load arguments
|
|
if(args_size<para_size && !ref_default[args_size])
|
|
{
|
|
// if the first default value is not nullptr,then values after it are not nullptr
|
|
die("callfv: lack argument(s)");
|
|
return;
|
|
}
|
|
// if args_size>para_size,for 0 to args_size will cause corruption
|
|
for(int i=0;i<para_size;++i)
|
|
ref_closure[i+offset]=(i<args_size)?vec[i]:ref_default[i];
|
|
// load dynamic argument if args_size>=para_size
|
|
if(ref_func.dynpara>=0)
|
|
{
|
|
nasal_val* vec_addr=gc.gc_alloc(vm_vec);
|
|
for(int i=para_size;i<args_size;++i)
|
|
vec_addr->ptr.vec->elems.push_back(vec[i]);
|
|
ref_closure[para_size+offset]=vec_addr;
|
|
}
|
|
|
|
stack_top-=args_size;// pop arguments
|
|
ret.push(pc);
|
|
pc=ref_func.entry-1;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_callfh()
|
|
{
|
|
// get parameter list and function value
|
|
auto& ref_hash=stack_top[0]->ptr.hash->elems;
|
|
nasal_val* func_addr=stack_top[-1];
|
|
if(func_addr->type!=vm_func)
|
|
{
|
|
die("callfh: must call a function");
|
|
return;
|
|
}
|
|
// push new local scope
|
|
auto& ref_func=*func_addr->ptr.func;
|
|
gc.local.push_back(ref_func.closure);
|
|
// load parameters
|
|
auto& ref_default=ref_func.default_para;
|
|
auto& ref_closure=gc.local.back();
|
|
|
|
if(ref_func.dynpara>=0)
|
|
{
|
|
die("callfh: special call cannot use dynamic argument");
|
|
return;
|
|
}
|
|
int offset=ref_func.offset;
|
|
for(auto& i:ref_func.key_table)
|
|
{
|
|
if(ref_hash.count(i.first))
|
|
ref_closure[i.second+offset]=ref_hash[i.first];
|
|
else if(ref_default[i.second])
|
|
ref_closure[i.second+offset]=ref_default[i.second];
|
|
else
|
|
{
|
|
die("callfh: lack argument(s): \""+i.first+"\"");
|
|
return;
|
|
}
|
|
}
|
|
|
|
--stack_top;// pop hash
|
|
ret.push(pc);
|
|
pc=ref_func.entry-1;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_callb()
|
|
{
|
|
(++stack_top)[0]=(*builtin_func[imm[pc]].func)(gc.local.back(),gc);
|
|
gc.val_stack[STACK_MAX_DEPTH-1]=(stack_top[0]?nullptr:(nasal_val*)0xffff);
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_slcbegin()
|
|
{
|
|
// | slice_vector | <-- stack_top[0]
|
|
// ----------------
|
|
// | resource_vec | <-- stack_top[-1]
|
|
// ----------------
|
|
(++stack_top)[0]=gc.gc_alloc(vm_vec);
|
|
if(stack_top[-1]->type!=vm_vec)
|
|
die("slcbegin: must slice a vector");
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_slcend()
|
|
{
|
|
stack_top[-1]=stack_top[0];
|
|
--stack_top;
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_slc()
|
|
{
|
|
nasal_val* val=(stack_top--)[0];
|
|
nasal_val* res=stack_top[-1]->ptr.vec->get_val(val->to_number());
|
|
if(!res)
|
|
die("slc: index out of range:"+num2str(val->to_number()));
|
|
stack_top[0]->ptr.vec->elems.push_back(res);
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_slc2()
|
|
{
|
|
nasal_val* val2=(stack_top--)[0];
|
|
nasal_val* val1=(stack_top--)[0];
|
|
std::vector<nasal_val*>& ref=stack_top[-1]->ptr.vec->elems;
|
|
std::vector<nasal_val*>& aim=stack_top[0]->ptr.vec->elems;
|
|
|
|
int type1=val1->type,type2=val2->type;
|
|
int num1=val1->to_number();
|
|
int num2=val2->to_number();
|
|
int ref_size=ref.size();
|
|
if(type1==vm_nil && type2==vm_nil)
|
|
{
|
|
num1=0;
|
|
num2=ref_size-1;
|
|
}
|
|
else if(type1==vm_nil && type2!=vm_nil)
|
|
num1=num2<0? -ref_size:0;
|
|
else if(type1!=vm_nil && type2==vm_nil)
|
|
num2=num1<0? -1:ref_size-1;
|
|
|
|
if(num1>=num2)
|
|
{
|
|
die("slc2: begin index must be less than end index");
|
|
return;
|
|
}
|
|
else if(num1<-ref_size || num1>=ref_size)
|
|
{
|
|
die("slc2: begin index out of range: "+num2str(num1));
|
|
return;
|
|
}
|
|
else if(num2<-ref_size || num2>=ref_size)
|
|
{
|
|
die("slc2: end index out of range: "+num2str(num2));
|
|
return;
|
|
}
|
|
for(int i=num1;i<=num2;++i)
|
|
aim.push_back(i>=0?ref[i]:ref[i+ref_size]);
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_mcallg()
|
|
{
|
|
mem_addr=gc.val_stack+imm[pc];
|
|
(++stack_top)[0]=mem_addr[0];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_mcalll()
|
|
{
|
|
mem_addr=&gc.local.back()[imm[pc]];
|
|
(++stack_top)[0]=mem_addr[0];
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_mcallv()
|
|
{
|
|
nasal_val* val=stack_top[0];
|
|
nasal_val* vec_addr=(--stack_top)[0];
|
|
int type=vec_addr->type;
|
|
if(type==vm_vec)
|
|
{
|
|
mem_addr=vec_addr->ptr.vec->get_mem(val->to_number());
|
|
if(!mem_addr)
|
|
die("mcallv: index out of range:"+num2str(val->to_number()));
|
|
}
|
|
else if(type==vm_hash)
|
|
{
|
|
if(val->type!=vm_str)
|
|
{
|
|
die("mcallv: must use string as the key");
|
|
return;
|
|
}
|
|
nasal_hash& ref=*vec_addr->ptr.hash;
|
|
std::string& str=*val->ptr.str;
|
|
mem_addr=ref.get_mem(str);
|
|
if(!mem_addr)
|
|
{
|
|
ref.elems[str]=gc.nil_addr;
|
|
mem_addr=ref.get_mem(str);
|
|
}
|
|
}
|
|
else
|
|
die("mcallv: cannot get memory space in other types");
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_mcallh()
|
|
{
|
|
nasal_val* hash_addr=stack_top[0];
|
|
if(hash_addr->type!=vm_hash)
|
|
{
|
|
die("mcallh: must call a hash");
|
|
return;
|
|
}
|
|
nasal_hash& ref=*hash_addr->ptr.hash;
|
|
std::string& str=str_table[imm[pc]];
|
|
mem_addr=ref.get_mem(str);
|
|
if(!mem_addr) // create a new key
|
|
{
|
|
ref.elems[str]=gc.nil_addr;
|
|
mem_addr=ref.get_mem(str);
|
|
}
|
|
return;
|
|
}
|
|
inline void nasal_vm::opr_ret()
|
|
{
|
|
gc.local.pop_back();// delete local scope
|
|
pc=ret.top();ret.pop();// fetch pc
|
|
(--stack_top)[0]->ptr.func->closure[0]=gc.nil_addr;// set 'me' to nil
|
|
stack_top[0]=stack_top[1];// rewrite nasal_func with returned value
|
|
return;
|
|
}
|
|
void nasal_vm::run(std::vector<opcode>& exec)
|
|
{
|
|
// int count[op_ret+1]={0};
|
|
void* opr_table[]=
|
|
{
|
|
&&nop, &&intg, &&intl, &&offset,
|
|
&&loadg, &&loadl, &&pnum, &&pone,
|
|
&&pzero, &&pnil, &&pstr, &&newv,
|
|
&&newh, &&newf, &&happ, &¶,
|
|
&&defpara, &&dynpara, &&unot, &&usub,
|
|
&&add, &&sub, &&mul, &&div,
|
|
&&lnk, &&addc, &&subc, &&mulc,
|
|
&&divc, &&lnkc, &&addeq, &&subeq,
|
|
&&muleq, &&diveq, &&lnkeq, &&addeqc,
|
|
&&subeqc, &&muleqc, &&diveqc, &&lnkeqc,
|
|
&&meq, &&eq, &&neq, &&less,
|
|
&&leq, &&grt, &&geq, &&lessc,
|
|
&&leqc, &&grtc, &&geqc, &&pop,
|
|
&&jmp, &&jt, &&jf, &&counter,
|
|
&&cntpop, &&findex, &&feach, &&callg,
|
|
&&calll, &&callv, &&callvi, &&callh,
|
|
&&callfv, &&callfh, &&callb, &&slcbegin,
|
|
&&slcend, &&slc, &&slc2, &&mcallg,
|
|
&&mcalll, &&mcallv, &&mcallh, &&ret
|
|
};
|
|
std::vector<void*> code;
|
|
for(auto& i:exec)
|
|
{
|
|
code.push_back(opr_table[i.op]);
|
|
imm.push_back(i.num);
|
|
}
|
|
|
|
nasal_val** canary=gc.val_stack+STACK_MAX_DEPTH-1;
|
|
clock_t begin=clock();
|
|
pc=0;
|
|
goto *code[pc];
|
|
|
|
nop:
|
|
if(canary[0] && canary[0]!=(nasal_val*)0xffff)
|
|
std::cout<<">> [vm] stack overflow.\n";
|
|
std::cout<<">> [vm] process exited after "<<((double)(clock()-begin))/CLOCKS_PER_SEC<<"s.\n";
|
|
// debug
|
|
// for(int i=0;i<15;++i)
|
|
// {
|
|
// int maxnum=0,index=0;
|
|
// for(int j=0;j<62;++j)
|
|
// if(count[j]>maxnum)
|
|
// {
|
|
// index=j;
|
|
// maxnum=count[j];
|
|
// }
|
|
// std::cout<<code_table[index].name<<": "<<maxnum<<"\n";
|
|
// count[index]=0;
|
|
// }
|
|
return;
|
|
#define exec_operand(op,num) {op();/*++count[num];*/if(!canary[0])goto *code[++pc];goto nop;}
|
|
intg: exec_operand(opr_intg ,1);
|
|
intl: exec_operand(opr_intl ,2);
|
|
offset: exec_operand(opr_offset ,3);
|
|
loadg: exec_operand(opr_loadg ,4);
|
|
loadl: exec_operand(opr_loadl ,5);
|
|
pnum: exec_operand(opr_pnum ,6);
|
|
pone: exec_operand(opr_pone ,7);
|
|
pzero: exec_operand(opr_pzero ,8);
|
|
pnil: exec_operand(opr_pnil ,9);
|
|
pstr: exec_operand(opr_pstr ,10);
|
|
newv: exec_operand(opr_newv ,11);
|
|
newh: exec_operand(opr_newh ,12);
|
|
newf: exec_operand(opr_newf ,13);
|
|
happ: exec_operand(opr_happ ,14);
|
|
para: exec_operand(opr_para ,15);
|
|
defpara: exec_operand(opr_defpara ,16);
|
|
dynpara: exec_operand(opr_dynpara ,17);
|
|
unot: exec_operand(opr_unot ,18);
|
|
usub: exec_operand(opr_usub ,19);
|
|
add: exec_operand(opr_add ,20);
|
|
sub: exec_operand(opr_sub ,21);
|
|
mul: exec_operand(opr_mul ,22);
|
|
div: exec_operand(opr_div ,23);
|
|
lnk: exec_operand(opr_lnk ,24);
|
|
addc: exec_operand(opr_addc ,25);
|
|
subc: exec_operand(opr_subc ,26);
|
|
mulc: exec_operand(opr_mulc ,27);
|
|
divc: exec_operand(opr_divc ,28);
|
|
lnkc: exec_operand(opr_lnkc ,29);
|
|
addeq: exec_operand(opr_addeq ,30);
|
|
subeq: exec_operand(opr_subeq ,31);
|
|
muleq: exec_operand(opr_muleq ,32);
|
|
diveq: exec_operand(opr_diveq ,33);
|
|
lnkeq: exec_operand(opr_lnkeq ,34);
|
|
addeqc: exec_operand(opr_addeqc ,35);
|
|
subeqc: exec_operand(opr_subeqc ,36);
|
|
muleqc: exec_operand(opr_muleqc ,37);
|
|
diveqc: exec_operand(opr_diveqc ,38);
|
|
lnkeqc: exec_operand(opr_lnkeqc ,39);
|
|
meq: exec_operand(opr_meq ,40);
|
|
eq: exec_operand(opr_eq ,41);
|
|
neq: exec_operand(opr_neq ,42);
|
|
less: exec_operand(opr_less ,43);
|
|
leq: exec_operand(opr_leq ,44);
|
|
grt: exec_operand(opr_grt ,45);
|
|
geq: exec_operand(opr_geq ,46);
|
|
lessc: exec_operand(opr_lessc ,47);
|
|
leqc: exec_operand(opr_leqc ,48);
|
|
grtc: exec_operand(opr_grtc ,49);
|
|
geqc: exec_operand(opr_geqc ,50);
|
|
pop: exec_operand(opr_pop ,51);
|
|
jmp: exec_operand(opr_jmp ,52);
|
|
jt: exec_operand(opr_jt ,53);
|
|
jf: exec_operand(opr_jf ,54);
|
|
counter: exec_operand(opr_counter ,55);
|
|
cntpop: exec_operand(opr_cntpop ,56);
|
|
findex: exec_operand(opr_findex ,57);
|
|
feach: exec_operand(opr_feach ,58);
|
|
callg: exec_operand(opr_callg ,59);
|
|
calll: exec_operand(opr_calll ,60);
|
|
callv: exec_operand(opr_callv ,61);
|
|
callvi: exec_operand(opr_callvi ,62);
|
|
callh: exec_operand(opr_callh ,63);
|
|
callfv: exec_operand(opr_callfv ,64);
|
|
callfh: exec_operand(opr_callfh ,65);
|
|
callb: exec_operand(opr_callb ,66);
|
|
slcbegin:exec_operand(opr_slcbegin,67);
|
|
slcend: exec_operand(opr_slcend ,68);
|
|
slc: exec_operand(opr_slc ,69);
|
|
slc2: exec_operand(opr_slc2 ,70);
|
|
mcallg: exec_operand(opr_mcallg ,71);
|
|
mcalll: exec_operand(opr_mcalll ,72);
|
|
mcallv: exec_operand(opr_mcallv ,73);
|
|
mcallh: exec_operand(opr_mcallh ,74);
|
|
ret: exec_operand(opr_ret ,75);
|
|
}
|
|
#endif |