forked from xxq250/Nasal-Interpreter
Valk Richard Li
a463af53b7
parser recognizes syntax errors more accurately. change some for loop to standard c++11 for(auto iter:obj) add MIT license change info in README.md
427 lines
10 KiB
C++
427 lines
10 KiB
C++
#ifndef __NASAL_GC_H__
|
|
#define __NASAL_GC_H__
|
|
|
|
enum nasal_type
|
|
{
|
|
vm_nil=0,
|
|
vm_num,
|
|
vm_str,
|
|
vm_func,
|
|
vm_vec,
|
|
vm_hash
|
|
};
|
|
|
|
struct nasal_vec;
|
|
struct nasal_hash;
|
|
struct nasal_func;
|
|
struct nasal_scop;
|
|
struct nasal_val;
|
|
|
|
struct nasal_vec
|
|
{
|
|
std::vector<nasal_val*> elems;
|
|
|
|
void print();
|
|
nasal_val* get_val(int);
|
|
nasal_val** get_mem(int);
|
|
};
|
|
|
|
struct nasal_hash
|
|
{
|
|
std::unordered_map<std::string,nasal_val*> elems;
|
|
|
|
bool check_contain(std::string&);
|
|
void print();
|
|
nasal_val* get_val(std::string&);
|
|
nasal_val** get_mem(std::string&);
|
|
};
|
|
|
|
struct nasal_func
|
|
{
|
|
int dynpara;// dynamic parameter name index in hash
|
|
int offset;
|
|
int entry;
|
|
std::vector<nasal_val*> default_para;
|
|
std::unordered_map<std::string,int> key_table;// parameter name hash
|
|
std::vector<nasal_val*> closure;
|
|
|
|
nasal_func();
|
|
};
|
|
|
|
struct nasal_val
|
|
{
|
|
bool mark;
|
|
int type;
|
|
union
|
|
{
|
|
double num;
|
|
std::string* str;
|
|
nasal_vec* vec;
|
|
nasal_hash* hash;
|
|
nasal_func* func;
|
|
}ptr;
|
|
|
|
nasal_val();
|
|
nasal_val(int);
|
|
~nasal_val();
|
|
void clear();
|
|
void set_type(int);
|
|
double to_number();
|
|
std::string to_string();
|
|
};
|
|
|
|
/*functions of nasal_vec*/
|
|
nasal_val* nasal_vec::get_val(int index)
|
|
{
|
|
int vec_size=elems.size();
|
|
if(index<-vec_size || index>=vec_size)
|
|
{
|
|
std::cout<<">> [gc] nasal_vec::get_val: index out of range: "<<index<<"\n";
|
|
return nullptr;
|
|
}
|
|
int idx[2]={index+vec_size,index};
|
|
return elems[idx[index>=0]];
|
|
}
|
|
nasal_val** nasal_vec::get_mem(int index)
|
|
{
|
|
int vec_size=elems.size();
|
|
if(index<-vec_size || index>=vec_size)
|
|
{
|
|
std::cout<<">> [gc] nasal_vec::get_mem: index out of range: "<<index<<"\n";
|
|
return nullptr;
|
|
}
|
|
int idx[2]={index+vec_size,index};
|
|
return &elems[idx[index>=0]];
|
|
}
|
|
void nasal_vec::print()
|
|
{
|
|
int size=elems.size();
|
|
std::cout<<'[';
|
|
for(auto i:elems)
|
|
{
|
|
switch(i->type)
|
|
{
|
|
case vm_nil: std::cout<<"nil"; break;
|
|
case vm_num: std::cout<<i->ptr.num; break;
|
|
case vm_str: std::cout<<*i->ptr.str; break;
|
|
case vm_vec: i->ptr.vec->print(); break;
|
|
case vm_hash: i->ptr.hash->print(); break;
|
|
case vm_func: std::cout<<"func(...){...}"; break;
|
|
}
|
|
std::cout<<',';
|
|
}
|
|
std::cout<<']';
|
|
return;
|
|
}
|
|
|
|
/*functions of nasal_hash*/
|
|
nasal_val* nasal_hash::get_val(std::string& key)
|
|
{
|
|
nasal_val* ret_addr=nullptr;
|
|
if(elems.count(key))
|
|
return elems[key];
|
|
else if(elems.count("parents"))
|
|
{
|
|
nasal_val* val_addr=elems["parents"];
|
|
if(val_addr->type==vm_vec)
|
|
for(auto i:val_addr->ptr.vec->elems)
|
|
{
|
|
if(i->type==vm_hash)
|
|
ret_addr=i->ptr.hash->get_val(key);
|
|
if(ret_addr)
|
|
return ret_addr;
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
nasal_val** nasal_hash::get_mem(std::string& key)
|
|
{
|
|
nasal_val** mem_addr=nullptr;
|
|
if(elems.count(key))
|
|
return &elems[key];
|
|
else if(elems.count("parents"))
|
|
{
|
|
nasal_val* val_addr=elems["parents"];
|
|
if(val_addr->type==vm_vec)
|
|
for(auto i:val_addr->ptr.vec->elems)
|
|
{
|
|
if(i->type==vm_hash)
|
|
mem_addr=i->ptr.hash->get_mem(key);
|
|
if(mem_addr)
|
|
return mem_addr;
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
bool nasal_hash::check_contain(std::string& key)
|
|
{
|
|
if(elems.count(key))
|
|
return true;
|
|
if(elems.count("parents"))
|
|
{
|
|
nasal_val* val_addr=elems["parents"];
|
|
if(val_addr->type==vm_vec)
|
|
{
|
|
bool result=false;
|
|
for(auto i:val_addr->ptr.vec->elems)
|
|
{
|
|
if(i->type==vm_hash)
|
|
result=i->ptr.hash->check_contain(key);
|
|
if(result)
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
void nasal_hash::print()
|
|
{
|
|
std::cout<<'{';
|
|
for(auto i:elems)
|
|
{
|
|
std::cout<<i.first<<':';
|
|
nasal_val* tmp=i.second;
|
|
switch(tmp->type)
|
|
{
|
|
case vm_nil: std::cout<<"nil"; break;
|
|
case vm_num: std::cout<<tmp->ptr.num; break;
|
|
case vm_str: std::cout<<*tmp->ptr.str; break;
|
|
case vm_vec: tmp->ptr.vec->print(); break;
|
|
case vm_hash: tmp->ptr.hash->print(); break;
|
|
case vm_func: std::cout<<"func(...){...}"; break;
|
|
}
|
|
std::cout<<',';
|
|
}
|
|
std::cout<<'}';
|
|
return;
|
|
}
|
|
|
|
/*functions of nasal_func*/
|
|
nasal_func::nasal_func()
|
|
{
|
|
dynpara=-1;
|
|
return;
|
|
}
|
|
|
|
/*functions of nasal_val*/
|
|
nasal_val::nasal_val()
|
|
{
|
|
mark=false;
|
|
type=vm_nil;
|
|
return;
|
|
}
|
|
nasal_val::nasal_val(int val_type)
|
|
{
|
|
mark=false;
|
|
type=val_type;
|
|
switch(type)
|
|
{
|
|
case vm_num: ptr.num=0; break;
|
|
case vm_str: ptr.str=new std::string; break;
|
|
case vm_vec: ptr.vec=new nasal_vec; break;
|
|
case vm_hash: ptr.hash=new nasal_hash; break;
|
|
case vm_func: ptr.func=new nasal_func; break;
|
|
}
|
|
return;
|
|
}
|
|
nasal_val::~nasal_val()
|
|
{
|
|
switch(type)
|
|
{
|
|
case vm_str: delete ptr.str; break;
|
|
case vm_vec: delete ptr.vec; break;
|
|
case vm_hash: delete ptr.hash; break;
|
|
case vm_func: delete ptr.func; break;
|
|
}
|
|
type=vm_nil;
|
|
return;
|
|
}
|
|
void nasal_val::clear()
|
|
{
|
|
switch(type)
|
|
{
|
|
case vm_str: delete ptr.str; break;
|
|
case vm_vec: delete ptr.vec; break;
|
|
case vm_hash: delete ptr.hash; break;
|
|
case vm_func: delete ptr.func; break;
|
|
}
|
|
type=vm_nil;
|
|
return;
|
|
}
|
|
void nasal_val::set_type(int val_type)
|
|
{
|
|
type=val_type;
|
|
switch(type)
|
|
{
|
|
case vm_num: ptr.num=0; break;
|
|
case vm_str: ptr.str=new std::string; break;
|
|
case vm_vec: ptr.vec=new nasal_vec; break;
|
|
case vm_hash: ptr.hash=new nasal_hash; break;
|
|
case vm_func: ptr.func=new nasal_func; break;
|
|
}
|
|
return;
|
|
}
|
|
double nasal_val::to_number()
|
|
{
|
|
if(type==vm_str)
|
|
return trans_string_to_number(*ptr.str);
|
|
return ptr.num;
|
|
}
|
|
std::string nasal_val::to_string()
|
|
{
|
|
if(type==vm_str)
|
|
return *ptr.str;
|
|
else if(type==vm_num)
|
|
return trans_number_to_string(ptr.num);
|
|
return "";
|
|
}
|
|
|
|
struct nasal_gc
|
|
{
|
|
#define STACK_MAX_DEPTH (65536<<4)
|
|
nasal_val* zero_addr; // reserved address of nasal_val,type vm_num, 0
|
|
nasal_val* one_addr; // reserved address of nasal_val,type vm_num, 1
|
|
nasal_val* nil_addr; // reserved address of nasal_val,type vm_nil
|
|
nasal_val* val_stack[STACK_MAX_DEPTH];
|
|
nasal_val** stack_top; // stack top
|
|
std::vector<nasal_val*> num_addrs; // reserved address for const vm_num
|
|
std::vector<nasal_val*> str_addrs; // reserved address for const vm_str
|
|
std::vector<nasal_val*> slice_stack; // slice stack for vec[val,val,val:val]
|
|
std::vector<nasal_val*> memory; // gc memory
|
|
std::queue <nasal_val*> free_list; // gc free list
|
|
std::vector<nasal_val*> global;
|
|
std::list<std::vector<nasal_val*> > local;
|
|
void mark();
|
|
void sweep();
|
|
void gc_init(std::vector<double>&,std::vector<std::string>&);
|
|
void gc_clear();
|
|
nasal_val* gc_alloc(int);
|
|
};
|
|
|
|
/* gc functions */
|
|
void nasal_gc::mark()
|
|
{
|
|
std::queue<nasal_val*> bfs;
|
|
for(auto i:global)
|
|
bfs.push(i);
|
|
for(auto i:local)
|
|
for(auto j:i)
|
|
bfs.push(j);
|
|
for(auto i:slice_stack)
|
|
bfs.push(i);
|
|
for(nasal_val** i=val_stack;i<=stack_top;++i)
|
|
bfs.push(*i);
|
|
while(!bfs.empty())
|
|
{
|
|
nasal_val* tmp=bfs.front();
|
|
bfs.pop();
|
|
if(!tmp || tmp->mark) continue;
|
|
tmp->mark=true;
|
|
if(tmp->type==vm_vec)
|
|
for(auto i:tmp->ptr.vec->elems)
|
|
bfs.push(i);
|
|
else if(tmp->type==vm_hash)
|
|
for(auto i:tmp->ptr.hash->elems)
|
|
bfs.push(i.second);
|
|
else if(tmp->type==vm_func)
|
|
{
|
|
for(auto i:tmp->ptr.func->closure)
|
|
bfs.push(i);
|
|
for(auto i:tmp->ptr.func->default_para)
|
|
bfs.push(i);
|
|
}
|
|
}
|
|
return;
|
|
}
|
|
void nasal_gc::sweep()
|
|
{
|
|
for(auto i:memory)
|
|
{
|
|
if(!i->mark)
|
|
{
|
|
i->clear();
|
|
free_list.push(i);
|
|
}
|
|
i->mark=false;
|
|
}
|
|
return;
|
|
}
|
|
void nasal_gc::gc_init(std::vector<double>& nums,std::vector<std::string>& strs)
|
|
{
|
|
for(int i=0;i<65536;++i)
|
|
{
|
|
nasal_val* tmp=new nasal_val;
|
|
memory.push_back(tmp);
|
|
free_list.push(tmp);
|
|
}
|
|
stack_top=val_stack; // set stack_top to val_stack
|
|
|
|
zero_addr=new nasal_val(vm_num); // init constant 0
|
|
zero_addr->ptr.num=0;
|
|
|
|
one_addr=new nasal_val(vm_num); // init constant 1
|
|
one_addr->ptr.num=1;
|
|
|
|
nil_addr=new nasal_val(vm_nil); // init nil
|
|
|
|
*val_stack=nil_addr; // the first space will not store any values,but gc checks
|
|
|
|
// init constant numbers
|
|
for(int i=0;i<nums.size();++i)
|
|
{
|
|
nasal_val* tmp=new nasal_val(vm_num);
|
|
tmp->ptr.num=nums[i];
|
|
num_addrs.push_back(tmp);
|
|
}
|
|
|
|
// init constant strings
|
|
for(int i=0;i<strs.size();++i)
|
|
{
|
|
nasal_val* tmp=new nasal_val(vm_str);
|
|
*tmp->ptr.str=strs[i];
|
|
str_addrs.push_back(tmp);
|
|
}
|
|
return;
|
|
}
|
|
void nasal_gc::gc_clear()
|
|
{
|
|
for(auto i:memory)
|
|
delete i;
|
|
memory.clear();
|
|
while(!free_list.empty())
|
|
free_list.pop();
|
|
global.clear();
|
|
local.clear();
|
|
slice_stack.clear();
|
|
|
|
delete nil_addr;
|
|
delete one_addr;
|
|
delete zero_addr;
|
|
for(auto i:num_addrs)
|
|
delete i;
|
|
num_addrs.clear();
|
|
for(auto i:str_addrs)
|
|
delete i;
|
|
str_addrs.clear();
|
|
return;
|
|
}
|
|
nasal_val* nasal_gc::gc_alloc(int type)
|
|
{
|
|
if(free_list.empty())
|
|
{
|
|
mark();
|
|
sweep();
|
|
}
|
|
if(free_list.empty())
|
|
for(int i=0;i<65536;++i)
|
|
{
|
|
nasal_val* tmp=new nasal_val;
|
|
memory.push_back(tmp);
|
|
free_list.push(tmp);
|
|
}
|
|
nasal_val* ret=free_list.front();
|
|
free_list.pop();
|
|
ret->set_type(type);
|
|
return ret;
|
|
}
|
|
#endif |