#ifndef __NASAL_GC_H__ #define __NASAL_GC_H__ enum nasal_type { /* none-gc object */ vm_none=0, vm_cnt, vm_addr, vm_ret, vm_nil, vm_num, /* gc object */ vm_str, vm_func, vm_vec, vm_hash, vm_upval, vm_obj, vm_co, vm_type_size }; // change parameters here to make your own efficient gc // better set bigger number on vm_vec const uint32_t initialize[vm_type_size]= { /* none-gc object */ 0, // vm_none, error type 0, // vm_count, used in foreach/forindex 0, // vm_addr, used to store local address pointers 0, // vm_ret, used to store call-return address 0, // vm_nil 0, // vm_num /* gc object */ 128, // vm_str 512, // vm_func 128, // vm_vec 64, // vm_hash 512, // vm_upval 16, // vm_obj 0 // vm_co }; const uint32_t increment[vm_type_size]= { /* none-gc object */ 0, // vm_none, error type 0, // vm_count, used in foreach/forindex 0, // vm_addr, used to store local address pointers 0, // vm_ret, used to store call-return address 0, // vm_nil 0, // vm_num /* gc object */ 1024,// vm_str 512, // vm_func 8192,// vm_vec 1024,// vm_hash 128, // vm_upval 256, // vm_obj 16 // vm_co }; struct nasal_vec; // vector struct nasal_hash; // hashmap(dict) struct nasal_func; // function(lambda) struct nasal_upval;// upvalue struct nasal_obj; // special objects struct nasal_co; // coroutine struct nasal_val; // nasal_val includes gc-managed types struct nasal_ref { uint8_t type; union { uint32_t ret; int64_t cnt; double num; nasal_ref* addr; nasal_val* gcobj; } value; // vm_none/vm_nil nasal_ref(const uint8_t t=vm_none):type(t){} // vm_ret nasal_ref(const uint8_t t,const uint32_t n):type(t){value.ret=n;} // vm_cnt nasal_ref(const uint8_t t,const int64_t n):type(t){value.cnt=n;} // vm_num nasal_ref(const uint8_t t,const double n):type(t){value.num=n;} // vm_str/vm_func/vm_vec/vm_hash/vm_upval/vm_obj nasal_ref(const uint8_t t,nasal_val* n):type(t){value.gcobj=n;} // vm_addr nasal_ref(const uint8_t t,nasal_ref* n):type(t){value.addr=n;} nasal_ref(const nasal_ref& nr):type(nr.type),value(nr.value){} nasal_ref& operator=(const nasal_ref& nr) { type=nr.type; value=nr.value; return *this; } bool operator==(const nasal_ref& nr){return type==nr.type && value.gcobj==nr.value.gcobj;} bool operator!=(const nasal_ref& nr){return type!=nr.type || value.gcobj!=nr.value.gcobj;} // number and string can be translated to each other double to_number(); std::string to_string(); void print(); bool objchk(uint32_t); inline nasal_ref* addr(); inline uint32_t ret (); inline int64_t& cnt (); inline double num (); inline std::string& str (); inline nasal_vec& vec (); inline nasal_hash& hash(); inline nasal_func& func(); inline nasal_upval& upval(); inline nasal_obj& obj (); inline nasal_co& co (); }; struct nasal_vec { bool printed; std::vector elems; nasal_vec():printed(false){} void print(); size_t size(){return elems.size();} nasal_ref get_val(const int); nasal_ref* get_mem(const int); }; struct nasal_hash { bool printed; std::unordered_map elems; nasal_hash():printed(false){} void print(); size_t size(){return elems.size();} nasal_ref get_val(const std::string&); nasal_ref* get_mem(const std::string&); }; struct nasal_func { int32_t dynpara; // dynamic parameter name index in hash. uint32_t entry; // pc will set to entry-1 to call this function uint32_t psize; // used to load default parameters to a new function uint32_t lsize; // used to expand memory space for local values on stack std::vector local; // local scope with default value(nasal_ref) std::vector upvalue; // closure std::unordered_map keys; // parameter name table, size_t begins from 1 nasal_func():dynpara(-1),entry(0),psize(0),lsize(0){} void clear(); }; struct nasal_upval { bool onstk; uint32_t size; nasal_ref* stk; std::vector elems; nasal_upval(){onstk=true;stk=nullptr;size=0;} nasal_ref& operator[](const int i){return onstk?stk[i]:elems[i];} void clear(){onstk=true;elems.clear();size=0;} }; struct nasal_obj { enum obj_type { null, file=1, dir, dylib, faddr }; /* RAII constructor */ /* new object is initialized when creating */ uint32_t type; void* ptr; /* RAII destroyer */ /* default destroyer does nothing */ typedef void (*dest)(void*); dest destructor; nasal_obj():type(obj_type::null),ptr(nullptr),destructor(nullptr){} ~nasal_obj(){clear();} void clear() { if(destructor && ptr) destructor(ptr); ptr=nullptr; destructor=nullptr; } }; struct nasal_co { enum coroutine_stat { suspended, running, dead }; static const uint32_t depth=1024; nasal_ref stack[depth]; uint32_t pc; nasal_ref* top; nasal_ref* canary; nasal_ref* localr; nasal_ref* memr; nasal_ref funcr; nasal_ref upvalr; uint32_t status; nasal_co(): pc(0), top(stack), canary(stack+depth-1), localr(nullptr), memr(nullptr), funcr({vm_nil,(double)0}), upvalr({vm_nil,(double)0}), status(nasal_co::suspended) { for(uint32_t i=0;i=size) return {vm_none}; return elems[index>=0?index:index+size]; } nasal_ref* nasal_vec::get_mem(const int index) { int size=elems.size(); if(index<-size || index>=size) return nullptr; return &elems[index>=0?index:index+size]; } void nasal_vec::print() { if(!elems.size() || printed) { std::cout<<(elems.size()?"[..]":"[]"); return; } printed=true; size_t iter=0; std::cout<<'['; for(auto& i:elems) { i.print(); std::cout<<",]"[(++iter)==elems.size()]; } printed=false; } nasal_ref nasal_hash::get_val(const std::string& key) { if(elems.count(key)) return elems[key]; else if(elems.count("parents")) { nasal_ref ret(vm_none); nasal_ref val=elems["parents"]; if(val.type==vm_vec) for(auto& i:val.vec().elems) { if(i.type==vm_hash) ret=i.hash().get_val(key); if(ret.type!=vm_none) return ret; } } return {vm_none}; } nasal_ref* nasal_hash::get_mem(const std::string& key) { if(elems.count(key)) return &elems[key]; else if(elems.count("parents")) { nasal_ref* addr=nullptr; nasal_ref val=elems["parents"]; if(val.type==vm_vec) for(auto& i:val.vec().elems) { if(i.type==vm_hash) addr=i.hash().get_mem(key); if(addr) return addr; } } return nullptr; } void nasal_hash::print() { if(!elems.size() || printed) { std::cout<<(elems.size()?"{..}":"{}"); return; } printed=true; size_t iter=0; std::cout<<'{'; for(auto& i:elems) { std::cout<"; break; case vm_co: std::cout<<""; break; } } bool nasal_ref::objchk(uint32_t objtype) { return type==vm_obj && obj().type==objtype && obj().ptr; } inline nasal_ref* nasal_ref::addr (){return value.addr; } inline uint32_t nasal_ref::ret (){return value.ret; } inline int64_t& nasal_ref::cnt (){return value.cnt; } inline double nasal_ref::num (){return value.num; } inline std::string& nasal_ref::str (){return *value.gcobj->ptr.str; } inline nasal_vec& nasal_ref::vec (){return *value.gcobj->ptr.vec; } inline nasal_hash& nasal_ref::hash (){return *value.gcobj->ptr.hash; } inline nasal_func& nasal_ref::func (){return *value.gcobj->ptr.func; } inline nasal_upval& nasal_ref::upval(){return *value.gcobj->ptr.upval;} inline nasal_obj& nasal_ref::obj (){return *value.gcobj->ptr.obj; } inline nasal_co& nasal_ref::co (){return *value.gcobj->ptr.co; } const nasal_ref zero={vm_num,(double)0}; const nasal_ref one ={vm_num,(double)1}; const nasal_ref nil ={vm_nil,(double)0}; struct nasal_gc { static const uint32_t stack_depth=8192; // depth of value stack struct { nasal_ref stack[stack_depth]; uint32_t pc; nasal_ref* top; nasal_ref* localr; nasal_ref* memr; nasal_ref funcr; nasal_ref upvalr; nasal_ref* canary; } main_ctx; /* runtime context */ uint32_t pc; // program counter nasal_ref* top; // stack top nasal_ref* localr; // local scope register nasal_ref* memr; // used for mem_call nasal_ref funcr; // function register nasal_ref upvalr; // upvalue register nasal_ref* canary; // avoid stackoverflow nasal_ref* stack; // stack pointer nasal_co* coroutine; // running coroutine /* constants and memory pool */ std::vector strs; // reserved address for const vm_str std::vector memory; // gc memory std::queue free_list[vm_type_size]; // gc free list /* values for analysis */ uint64_t size[vm_type_size]; uint64_t count[vm_type_size]; void mark(); void sweep(); void init(const std::vector&); void clear(); void info(); nasal_ref alloc(const uint8_t); nasal_ref builtin_alloc(const uint8_t); void ctxchg(nasal_co&); void ctxreserve(); }; /* gc functions */ void nasal_gc::mark() { std::queue bfs; if(!coroutine) { for(nasal_ref* i=stack;i<=top;++i) bfs.push(*i); bfs.push(funcr); bfs.push(upvalr); } else { for(nasal_ref* i=main_ctx.stack;i<=main_ctx.top;++i) bfs.push(*i); bfs.push(main_ctx.funcr); bfs.push(main_ctx.upvalr); } while(!bfs.empty()) { nasal_ref tmp=bfs.front(); bfs.pop(); if(tmp.type<=vm_num || tmp.value.gcobj->mark) continue; tmp.value.gcobj->mark=GC_FOUND; switch(tmp.type) { case vm_vec: for(auto& i:tmp.vec().elems) bfs.push(i); break; case vm_hash: for(auto& i:tmp.hash().elems) bfs.push(i.second); break; case vm_func: for(auto& i:tmp.func().local) bfs.push(i); for(auto& i:tmp.func().upvalue) bfs.push(i); break; case vm_upval: for(auto& i:tmp.upval().elems) bfs.push(i); break; case vm_co: bfs.push(tmp.co().funcr); bfs.push(tmp.co().upvalr); for(nasal_ref* i=tmp.co().stack;i<=tmp.co().top;++i) bfs.push(*i); break; } } } void nasal_gc::sweep() { for(auto i:memory) { if(i->mark==GC_UNCOLLECTED) { switch(i->type) { case vm_str: i->ptr.str->clear(); break; case vm_vec: i->ptr.vec->elems.clear(); break; case vm_hash: i->ptr.hash->elems.clear();break; case vm_func: i->ptr.func->clear(); break; case vm_upval:i->ptr.upval->clear(); break; case vm_obj: i->ptr.obj->clear(); break; case vm_co: i->ptr.co->clear(); break; } free_list[i->type].push(i); i->mark=GC_COLLECTED; } else if(i->mark==GC_FOUND) i->mark=GC_UNCOLLECTED; } } void nasal_gc::init(const std::vector& s) { // initiaize function register funcr=nil; for(uint8_t i=0;iunmut=1; strs[i].str()=s[i]; } } void nasal_gc::clear() { for(auto i:memory) delete i; memory.clear(); for(uint8_t i=0;imark=GC_UNCOLLECTED; free_list[type].pop(); return ret; } nasal_ref nasal_gc::builtin_alloc(uint8_t type) { // when running a builtin function,alloc will run more than one time // this may cause mark-sweep in gc::alloc // and the value got before will be collected,this is a fatal error // so use builtin_alloc in builtin functions if this function uses alloc more then one time if(free_list[type].empty()) { ++size[type]; for(uint32_t i=0;imark=GC_UNCOLLECTED; free_list[type].pop(); return ret; } void nasal_gc::ctxchg(nasal_co& context) { main_ctx.pc=pc; main_ctx.top=top; main_ctx.localr=localr; main_ctx.memr=memr; main_ctx.funcr=funcr; main_ctx.upvalr=upvalr; main_ctx.canary=canary; pc=context.pc; top=context.top; localr=context.localr; memr=context.memr; funcr=context.funcr; upvalr=context.upvalr; canary=context.canary; stack=context.stack; coroutine=&context; coroutine->status=nasal_co::running; } void nasal_gc::ctxreserve() { if(coroutine->status!=nasal_co::dead) coroutine->status=nasal_co::suspended; // pc=0 means this coroutine is finished, so we use entry to reset it coroutine->pc=pc==0?coroutine->funcr.func().entry:pc; coroutine->top=top; coroutine->localr=localr; coroutine->memr=memr; coroutine->funcr=funcr; coroutine->upvalr=upvalr; coroutine->canary=canary; pc=main_ctx.pc; top=main_ctx.top; localr=main_ctx.localr; memr=main_ctx.memr; funcr=main_ctx.funcr; upvalr=main_ctx.upvalr; canary=main_ctx.canary; stack=main_ctx.stack; coroutine=nullptr; } #endif