2 see copyright notice in squirrel.h
\r
4 #include "sqpcheader.h"
\r
5 #include "sqopcodes.h"
\r
7 #include "sqfuncproto.h"
\r
8 #include "sqclosure.h"
\r
9 #include "sqstring.h"
\r
10 #include "sqtable.h"
\r
11 #include "sqarray.h"
\r
12 #include "squserdata.h"
\r
13 #include "sqclass.h"
\r
16 SQObjectPtr _true_(true);
\r
17 SQObjectPtr _false_(false);
\r
18 SQObjectPtr _one_((SQInteger)1);
\r
19 SQObjectPtr _minusone_((SQInteger)-1);
\r
21 SQSharedState::SQSharedState()
\r
23 _compilererrorhandler = NULL;
\r
26 _notifyallexceptions = false;
\r
29 #define newsysstring(s) { \
\r
30 _systemstrings->push_back(SQString::Create(this,s)); \
\r
33 #define newmetamethod(s) { \
\r
34 _metamethods->push_back(SQString::Create(this,s)); \
\r
35 _table(_metamethodsmap)->NewSlot(_metamethods->back(),(SQInteger)(_metamethods->size()-1)); \
\r
38 bool CompileTypemask(SQIntVec &res,const SQChar *typemask)
\r
43 while(typemask[i] != 0) {
\r
45 switch(typemask[i]){
\r
46 case 'o': mask |= _RT_NULL; break;
\r
47 case 'i': mask |= _RT_INTEGER; break;
\r
48 case 'f': mask |= _RT_FLOAT; break;
\r
49 case 'n': mask |= (_RT_FLOAT | _RT_INTEGER); break;
\r
50 case 's': mask |= _RT_STRING; break;
\r
51 case 't': mask |= _RT_TABLE; break;
\r
52 case 'a': mask |= _RT_ARRAY; break;
\r
53 case 'u': mask |= _RT_USERDATA; break;
\r
54 case 'c': mask |= (_RT_CLOSURE | _RT_NATIVECLOSURE); break;
\r
55 case 'b': mask |= _RT_BOOL; break;
\r
56 case 'g': mask |= _RT_GENERATOR; break;
\r
57 case 'p': mask |= _RT_USERPOINTER; break;
\r
58 case 'v': mask |= _RT_THREAD; break;
\r
59 case 'x': mask |= _RT_INSTANCE; break;
\r
60 case 'y': mask |= _RT_CLASS; break;
\r
61 case 'r': mask |= _RT_WEAKREF; break;
\r
62 case '.': mask = -1; res.push_back(mask); i++; mask = 0; continue;
\r
63 case ' ': i++; continue; //ignores spaces
\r
68 if(typemask[i] == '|') {
\r
70 if(typemask[i] == 0)
\r
74 res.push_back(mask);
\r
81 SQTable *CreateDefaultDelegate(SQSharedState *ss,SQRegFunction *funcz)
\r
84 SQTable *t=SQTable::Create(ss,0);
\r
85 while(funcz[i].name!=0){
\r
86 SQNativeClosure *nc = SQNativeClosure::Create(ss,funcz[i].f);
\r
87 nc->_nparamscheck = funcz[i].nparamscheck;
\r
88 nc->_name = SQString::Create(ss,funcz[i].name);
\r
89 if(funcz[i].typemask && !CompileTypemask(nc->_typecheck,funcz[i].typemask))
\r
91 t->NewSlot(SQString::Create(ss,funcz[i].name),nc);
\r
97 void SQSharedState::Init()
\r
101 #ifndef NO_GARBAGE_COLLECTOR
\r
104 sq_new(_stringtable,StringTable);
\r
105 sq_new(_metamethods,SQObjectPtrVec);
\r
106 sq_new(_systemstrings,SQObjectPtrVec);
\r
107 sq_new(_types,SQObjectPtrVec);
\r
108 _metamethodsmap = SQTable::Create(this,MT_LAST-1);
\r
109 //adding type strings to avoid memory trashing
\r
111 newsysstring(_SC("null"));
\r
112 newsysstring(_SC("table"));
\r
113 newsysstring(_SC("array"));
\r
114 newsysstring(_SC("closure"));
\r
115 newsysstring(_SC("string"));
\r
116 newsysstring(_SC("userdata"));
\r
117 newsysstring(_SC("integer"));
\r
118 newsysstring(_SC("float"));
\r
119 newsysstring(_SC("userpointer"));
\r
120 newsysstring(_SC("function"));
\r
121 newsysstring(_SC("generator"));
\r
122 newsysstring(_SC("thread"));
\r
123 newsysstring(_SC("class"));
\r
124 newsysstring(_SC("instance"));
\r
125 newsysstring(_SC("bool"));
\r
127 newmetamethod(MM_ADD);
\r
128 newmetamethod(MM_SUB);
\r
129 newmetamethod(MM_MUL);
\r
130 newmetamethod(MM_DIV);
\r
131 newmetamethod(MM_UNM);
\r
132 newmetamethod(MM_MODULO);
\r
133 newmetamethod(MM_SET);
\r
134 newmetamethod(MM_GET);
\r
135 newmetamethod(MM_TYPEOF);
\r
136 newmetamethod(MM_NEXTI);
\r
137 newmetamethod(MM_CMP);
\r
138 newmetamethod(MM_CALL);
\r
139 newmetamethod(MM_CLONED);
\r
140 newmetamethod(MM_NEWSLOT);
\r
141 newmetamethod(MM_DELSLOT);
\r
142 newmetamethod(MM_TOSTRING);
\r
143 newmetamethod(MM_NEWMEMBER);
\r
144 newmetamethod(MM_INHERITED);
\r
146 _constructoridx = SQString::Create(this,_SC("constructor"));
\r
147 _registry = SQTable::Create(this,0);
\r
148 _table_default_delegate=CreateDefaultDelegate(this,_table_default_delegate_funcz);
\r
149 _array_default_delegate=CreateDefaultDelegate(this,_array_default_delegate_funcz);
\r
150 _string_default_delegate=CreateDefaultDelegate(this,_string_default_delegate_funcz);
\r
151 _number_default_delegate=CreateDefaultDelegate(this,_number_default_delegate_funcz);
\r
152 _closure_default_delegate=CreateDefaultDelegate(this,_closure_default_delegate_funcz);
\r
153 _generator_default_delegate=CreateDefaultDelegate(this,_generator_default_delegate_funcz);
\r
154 _thread_default_delegate=CreateDefaultDelegate(this,_thread_default_delegate_funcz);
\r
155 _class_default_delegate=CreateDefaultDelegate(this,_class_default_delegate_funcz);
\r
156 _instance_default_delegate=CreateDefaultDelegate(this,_instance_default_delegate_funcz);
\r
157 _weakref_default_delegate=CreateDefaultDelegate(this,_weakref_default_delegate_funcz);
\r
161 SQSharedState::~SQSharedState()
\r
163 _constructoridx = _null_;
\r
164 _refs_table.Finalize();
\r
165 _table(_registry)->Finalize();
\r
166 _table(_metamethodsmap)->Finalize();
\r
167 // _refs_table = _null_;
\r
168 _registry = _null_;
\r
169 _metamethodsmap = _null_;
\r
170 while(!_systemstrings->empty()){
\r
171 _systemstrings->back()=_null_;
\r
172 _systemstrings->pop_back();
\r
174 _thread(_root_vm)->Finalize();
\r
176 _table_default_delegate=_null_;
\r
177 _array_default_delegate=_null_;
\r
178 _string_default_delegate=_null_;
\r
179 _number_default_delegate=_null_;
\r
180 _closure_default_delegate=_null_;
\r
181 _generator_default_delegate=_null_;
\r
182 _thread_default_delegate=_null_;
\r
183 _class_default_delegate=_null_;
\r
184 _instance_default_delegate=_null_;
\r
185 _weakref_default_delegate=_null_;
\r
187 #ifndef NO_GARBAGE_COLLECTOR
\r
190 SQCollectable *t=_gc_chain;
\r
191 SQCollectable *nx=NULL;
\r
200 assert(_gc_chain==NULL); //just to proove a theory
\r
202 _gc_chain->_uiRef++;
\r
203 _gc_chain->Release();
\r
206 sq_delete(_types,SQObjectPtrVec);
\r
207 sq_delete(_systemstrings,SQObjectPtrVec);
\r
208 sq_delete(_metamethods,SQObjectPtrVec);
\r
209 sq_delete(_stringtable,StringTable);
\r
210 if(_scratchpad)SQ_FREE(_scratchpad,_scratchpadsize);
\r
214 SQInteger SQSharedState::GetMetaMethodIdxByName(const SQObjectPtr &name)
\r
216 if(type(name) != OT_STRING)
\r
219 if(_table(_metamethodsmap)->Get(name,ret)) {
\r
220 return _integer(ret);
\r
225 #ifndef NO_GARBAGE_COLLECTOR
\r
227 void SQSharedState::MarkObject(SQObjectPtr &o,SQCollectable **chain)
\r
230 case OT_TABLE:_table(o)->Mark(chain);break;
\r
231 case OT_ARRAY:_array(o)->Mark(chain);break;
\r
232 case OT_USERDATA:_userdata(o)->Mark(chain);break;
\r
233 case OT_CLOSURE:_closure(o)->Mark(chain);break;
\r
234 case OT_NATIVECLOSURE:_nativeclosure(o)->Mark(chain);break;
\r
235 case OT_GENERATOR:_generator(o)->Mark(chain);break;
\r
236 case OT_THREAD:_thread(o)->Mark(chain);break;
\r
237 case OT_CLASS:_class(o)->Mark(chain);break;
\r
238 case OT_INSTANCE:_instance(o)->Mark(chain);break;
\r
239 default: break; //shutup compiler
\r
244 SQInteger SQSharedState::CollectGarbage(SQVM *vm)
\r
247 SQCollectable *tchain=NULL;
\r
248 SQVM *vms=_thread(_root_vm);
\r
250 vms->Mark(&tchain);
\r
251 SQInteger x = _table(_thread(_root_vm)->_roottable)->CountUsed();
\r
252 _refs_table.Mark(&tchain);
\r
253 MarkObject(_registry,&tchain);
\r
254 MarkObject(_metamethodsmap,&tchain);
\r
255 MarkObject(_table_default_delegate,&tchain);
\r
256 MarkObject(_array_default_delegate,&tchain);
\r
257 MarkObject(_string_default_delegate,&tchain);
\r
258 MarkObject(_number_default_delegate,&tchain);
\r
259 MarkObject(_generator_default_delegate,&tchain);
\r
260 MarkObject(_thread_default_delegate,&tchain);
\r
261 MarkObject(_closure_default_delegate,&tchain);
\r
262 MarkObject(_class_default_delegate,&tchain);
\r
263 MarkObject(_instance_default_delegate,&tchain);
\r
264 MarkObject(_weakref_default_delegate,&tchain);
\r
266 SQCollectable *t=_gc_chain;
\r
267 SQCollectable *nx=NULL;
\r
284 SQInteger z = _table(_thread(_root_vm)->_roottable)->CountUsed();
\r
290 #ifndef NO_GARBAGE_COLLECTOR
\r
291 void SQCollectable::AddToChain(SQCollectable **chain,SQCollectable *c)
\r
295 if(*chain) (*chain)->_prev=c;
\r
299 void SQCollectable::RemoveFromChain(SQCollectable **chain,SQCollectable *c)
\r
301 if(c->_prev) c->_prev->_next=c->_next;
\r
302 else *chain=c->_next;
\r
304 c->_next->_prev=c->_prev;
\r
310 SQChar* SQSharedState::GetScratchPad(SQInteger size)
\r
314 if(_scratchpadsize<size){
\r
315 newsize=size+(size>>1);
\r
316 _scratchpad=(SQChar *)SQ_REALLOC(_scratchpad,_scratchpadsize,newsize);
\r
317 _scratchpadsize=newsize;
\r
319 }else if(_scratchpadsize>=(size<<5)){
\r
320 newsize=_scratchpadsize>>1;
\r
321 _scratchpad=(SQChar *)SQ_REALLOC(_scratchpad,_scratchpadsize,newsize);
\r
322 _scratchpadsize=newsize;
\r
325 return _scratchpad;
\r
328 RefTable::RefTable()
\r
333 void RefTable::Finalize()
\r
335 RefNode *nodes = (RefNode *)&_buckets[_numofslots];
\r
336 for(SQUnsignedInteger n = 0; n < _numofslots; n++) {
\r
337 nodes->obj = _null_;
\r
342 RefTable::~RefTable()
\r
344 SQ_FREE(_buckets,_buffersize);
\r
346 #ifndef NO_GARBAGE_COLLECTOR
\r
347 void RefTable::Mark(SQCollectable **chain)
\r
349 RefNode *nodes = (RefNode *)&_buckets[_numofslots];
\r
350 for(SQUnsignedInteger n = 0; n < _numofslots; n++) {
\r
351 if(type(nodes->obj) != OT_NULL) {
\r
352 SQSharedState::MarkObject(nodes->obj,chain);
\r
358 void RefTable::AddRef(SQObject &obj)
\r
362 RefNode *ref = Get(obj,mainpos,&prev,true);
\r
366 SQBool RefTable::Release(SQObject &obj)
\r
370 RefNode *ref = Get(obj,mainpos,&prev,false);
\r
372 if(--ref->refs == 0) {
\r
375 prev->next = ref->next;
\r
378 _buckets[mainpos] = ref->next;
\r
380 ref->next = _freelist;
\r
383 //<<FIXME>>test for shrink?
\r
390 void RefTable::Resize(SQUnsignedInteger size)
\r
392 RefNode **oldbuffer = _buckets;
\r
393 RefNode *oldnodes = (RefNode *)&_buckets[_numofslots];
\r
394 SQUnsignedInteger oldnumofslots = _numofslots;
\r
395 SQUnsignedInteger oldbuffersize = _buffersize;
\r
398 for(SQUnsignedInteger n = 0; n < oldnumofslots; n++) {
\r
399 if(type(oldnodes->obj) != OT_NULL) {
\r
401 assert(oldnodes->refs != 0);
\r
402 RefNode *nn = Add(::HashObj(oldnodes->obj)&(_numofslots-1),oldnodes->obj);
\r
403 nn->refs = oldnodes->refs;
\r
404 oldnodes->obj = _null_;
\r
408 SQ_FREE(oldbuffer,oldbuffersize);
\r
411 RefTable::RefNode *RefTable::Add(SQHash mainpos,SQObject &obj)
\r
413 RefNode *t = _buckets[mainpos];
\r
414 RefNode *newnode = _freelist;
\r
415 newnode->obj = obj;
\r
416 _buckets[mainpos] = newnode;
\r
417 _freelist = _freelist->next;
\r
419 assert(newnode->refs == 0);
\r
424 RefTable::RefNode *RefTable::Get(SQObject &obj,SQHash &mainpos,RefNode **prev,bool add)
\r
427 mainpos = ::HashObj(obj)&(_numofslots-1);
\r
429 for (ref = _buckets[mainpos]; ref; ) {
\r
430 if(_rawval(ref->obj) == _rawval(obj) && type(ref->obj) == type(obj))
\r
435 if(ref == NULL && add) {
\r
436 if(_numofslots == _slotused) {
\r
437 Resize(_numofslots*2);
\r
439 ref = Add(mainpos,obj);
\r
444 void RefTable::AllocNodes(SQUnsignedInteger size)
\r
447 RefNode *firstnode;
\r
448 _buffersize = size * sizeof(RefNode *) + size * sizeof(RefNode);
\r
449 bucks = (RefNode **)SQ_MALLOC(_buffersize);
\r
450 firstnode = (RefNode *)&bucks[size];
\r
451 RefNode *temp = firstnode;
\r
452 SQUnsignedInteger n;
\r
453 for(n = 0; n < size - 1; n++) {
\r
456 new (&temp->obj) SQObjectPtr;
\r
457 temp->next = temp+1;
\r
462 new (&temp->obj) SQObjectPtr;
\r
464 _freelist = firstnode;
\r
467 _numofslots = size;
\r
469 //////////////////////////////////////////////////////////////////////////
\r
472 * The following code is based on Lua 4.0 (Copyright 1994-2002 Tecgraf, PUC-Rio.)
\r
473 * http://www.lua.org/copyright.html#4
\r
474 * http://www.lua.org/source/4.0.1/src_lstring.c.html
\r
477 StringTable::StringTable()
\r
483 StringTable::~StringTable()
\r
485 SQ_FREE(_strings,sizeof(SQString*)*_numofslots);
\r
489 void StringTable::AllocNodes(SQInteger size)
\r
493 _strings=(SQString**)SQ_MALLOC(sizeof(SQString*)*_numofslots);
\r
494 memset(_strings,0,sizeof(SQString*)*_numofslots);
\r
497 SQString *StringTable::Add(const SQChar *news,SQInteger len)
\r
500 len = (SQInteger)scstrlen(news);
\r
501 SQHash h = ::_hashstr(news,len)&(_numofslots-1);
\r
503 for (s = _strings[h]; s; s = s->_next){
\r
504 if(s->_len == len && (!memcmp(news,s->_val,rsl(len))))
\r
508 SQString *t=(SQString *)SQ_MALLOC(rsl(len)+sizeof(SQString));
\r
510 memcpy(t->_val,news,rsl(len));
\r
511 t->_val[len] = _SC('\0');
\r
513 t->_hash = ::_hashstr(news,len);
\r
514 t->_next = _strings[h];
\r
517 if (_slotused > _numofslots) /* too crowded? */
\r
518 Resize(_numofslots*2);
\r
522 void StringTable::Resize(SQInteger size)
\r
524 SQInteger oldsize=_numofslots;
\r
525 SQString **oldtable=_strings;
\r
527 for (SQInteger i=0; i<oldsize; i++){
\r
528 SQString *p = oldtable[i];
\r
530 SQString *next = p->_next;
\r
531 SQHash h = p->_hash&(_numofslots-1);
\r
532 p->_next = _strings[h];
\r
537 SQ_FREE(oldtable,oldsize*sizeof(SQString*));
\r
540 void StringTable::Remove(SQString *bs)
\r
543 SQString *prev=NULL;
\r
544 SQHash h = bs->_hash&(_numofslots - 1);
\r
546 for (s = _strings[h]; s; ){
\r
549 prev->_next = s->_next;
\r
551 _strings[h] = s->_next;
\r
553 SQInteger slen = s->_len;
\r
555 SQ_FREE(s,sizeof(SQString) + rsl(slen));
\r
561 assert(0);//if this fail something is wrong
\r