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,SQStringTable);
\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 _consts = SQTable::Create(this,0);
\r
149 _table_default_delegate = CreateDefaultDelegate(this,_table_default_delegate_funcz);
\r
150 _array_default_delegate = CreateDefaultDelegate(this,_array_default_delegate_funcz);
\r
151 _string_default_delegate = CreateDefaultDelegate(this,_string_default_delegate_funcz);
\r
152 _number_default_delegate = CreateDefaultDelegate(this,_number_default_delegate_funcz);
\r
153 _closure_default_delegate = CreateDefaultDelegate(this,_closure_default_delegate_funcz);
\r
154 _generator_default_delegate = CreateDefaultDelegate(this,_generator_default_delegate_funcz);
\r
155 _thread_default_delegate = CreateDefaultDelegate(this,_thread_default_delegate_funcz);
\r
156 _class_default_delegate = CreateDefaultDelegate(this,_class_default_delegate_funcz);
\r
157 _instance_default_delegate = CreateDefaultDelegate(this,_instance_default_delegate_funcz);
\r
158 _weakref_default_delegate = CreateDefaultDelegate(this,_weakref_default_delegate_funcz);
\r
162 SQSharedState::~SQSharedState()
\r
164 _constructoridx = _null_;
\r
165 _table(_registry)->Finalize();
\r
166 _table(_consts)->Finalize();
\r
167 _table(_metamethodsmap)->Finalize();
\r
168 _registry = _null_;
\r
170 _metamethodsmap = _null_;
\r
171 while(!_systemstrings->empty()) {
\r
172 _systemstrings->back()=_null_;
\r
173 _systemstrings->pop_back();
\r
175 _thread(_root_vm)->Finalize();
\r
177 _table_default_delegate = _null_;
\r
178 _array_default_delegate = _null_;
\r
179 _string_default_delegate = _null_;
\r
180 _number_default_delegate = _null_;
\r
181 _closure_default_delegate = _null_;
\r
182 _generator_default_delegate = _null_;
\r
183 _thread_default_delegate = _null_;
\r
184 _class_default_delegate = _null_;
\r
185 _instance_default_delegate = _null_;
\r
186 _weakref_default_delegate = _null_;
\r
187 _refs_table.Finalize();
\r
188 #ifndef NO_GARBAGE_COLLECTOR
\r
189 SQCollectable *t = _gc_chain;
\r
190 SQCollectable *nx = NULL;
\r
196 if(nx) nx->_uiRef++;
\r
197 if(--t->_uiRef == 0)
\r
202 assert(_gc_chain==NULL); //just to proove a theory
\r
204 _gc_chain->_uiRef++;
\r
205 _gc_chain->Release();
\r
209 sq_delete(_types,SQObjectPtrVec);
\r
210 sq_delete(_systemstrings,SQObjectPtrVec);
\r
211 sq_delete(_metamethods,SQObjectPtrVec);
\r
212 sq_delete(_stringtable,SQStringTable);
\r
213 if(_scratchpad)SQ_FREE(_scratchpad,_scratchpadsize);
\r
217 SQInteger SQSharedState::GetMetaMethodIdxByName(const SQObjectPtr &name)
\r
219 if(type(name) != OT_STRING)
\r
222 if(_table(_metamethodsmap)->Get(name,ret)) {
\r
223 return _integer(ret);
\r
228 #ifndef NO_GARBAGE_COLLECTOR
\r
230 void SQSharedState::MarkObject(SQObjectPtr &o,SQCollectable **chain)
\r
233 case OT_TABLE:_table(o)->Mark(chain);break;
\r
234 case OT_ARRAY:_array(o)->Mark(chain);break;
\r
235 case OT_USERDATA:_userdata(o)->Mark(chain);break;
\r
236 case OT_CLOSURE:_closure(o)->Mark(chain);break;
\r
237 case OT_NATIVECLOSURE:_nativeclosure(o)->Mark(chain);break;
\r
238 case OT_GENERATOR:_generator(o)->Mark(chain);break;
\r
239 case OT_THREAD:_thread(o)->Mark(chain);break;
\r
240 case OT_CLASS:_class(o)->Mark(chain);break;
\r
241 case OT_INSTANCE:_instance(o)->Mark(chain);break;
\r
242 default: break; //shutup compiler
\r
247 SQInteger SQSharedState::CollectGarbage(SQVM *vm)
\r
250 SQCollectable *tchain=NULL;
\r
251 SQVM *vms = _thread(_root_vm);
\r
253 vms->Mark(&tchain);
\r
254 SQInteger x = _table(_thread(_root_vm)->_roottable)->CountUsed();
\r
255 _refs_table.Mark(&tchain);
\r
256 MarkObject(_registry,&tchain);
\r
257 MarkObject(_consts,&tchain);
\r
258 MarkObject(_metamethodsmap,&tchain);
\r
259 MarkObject(_table_default_delegate,&tchain);
\r
260 MarkObject(_array_default_delegate,&tchain);
\r
261 MarkObject(_string_default_delegate,&tchain);
\r
262 MarkObject(_number_default_delegate,&tchain);
\r
263 MarkObject(_generator_default_delegate,&tchain);
\r
264 MarkObject(_thread_default_delegate,&tchain);
\r
265 MarkObject(_closure_default_delegate,&tchain);
\r
266 MarkObject(_class_default_delegate,&tchain);
\r
267 MarkObject(_instance_default_delegate,&tchain);
\r
268 MarkObject(_weakref_default_delegate,&tchain);
\r
270 SQCollectable *t = _gc_chain;
\r
271 SQCollectable *nx = NULL;
\r
277 if(nx) nx->_uiRef++;
\r
278 if(--t->_uiRef == 0)
\r
290 _gc_chain = tchain;
\r
291 SQInteger z = _table(_thread(_root_vm)->_roottable)->CountUsed();
\r
297 #ifndef NO_GARBAGE_COLLECTOR
\r
298 void SQCollectable::AddToChain(SQCollectable **chain,SQCollectable *c)
\r
302 if(*chain) (*chain)->_prev = c;
\r
306 void SQCollectable::RemoveFromChain(SQCollectable **chain,SQCollectable *c)
\r
308 if(c->_prev) c->_prev->_next = c->_next;
\r
309 else *chain = c->_next;
\r
311 c->_next->_prev = c->_prev;
\r
317 SQChar* SQSharedState::GetScratchPad(SQInteger size)
\r
321 if(_scratchpadsize < size) {
\r
322 newsize = size + (size>>1);
\r
323 _scratchpad = (SQChar *)SQ_REALLOC(_scratchpad,_scratchpadsize,newsize);
\r
324 _scratchpadsize = newsize;
\r
326 }else if(_scratchpadsize >= (size<<5)) {
\r
327 newsize = _scratchpadsize >> 1;
\r
328 _scratchpad = (SQChar *)SQ_REALLOC(_scratchpad,_scratchpadsize,newsize);
\r
329 _scratchpadsize = newsize;
\r
332 return _scratchpad;
\r
335 RefTable::RefTable()
\r
340 void RefTable::Finalize()
\r
342 RefNode *nodes = _nodes;
\r
343 for(SQUnsignedInteger n = 0; n < _numofslots; n++) {
\r
344 nodes->obj = _null_;
\r
349 RefTable::~RefTable()
\r
351 SQ_FREE(_buckets,(_numofslots * sizeof(RefNode *)) + (_numofslots * sizeof(RefNode)));
\r
354 #ifndef NO_GARBAGE_COLLECTOR
\r
355 void RefTable::Mark(SQCollectable **chain)
\r
357 RefNode *nodes = (RefNode *)_nodes;
\r
358 for(SQUnsignedInteger n = 0; n < _numofslots; n++) {
\r
359 if(type(nodes->obj) != OT_NULL) {
\r
360 SQSharedState::MarkObject(nodes->obj,chain);
\r
367 void RefTable::AddRef(SQObject &obj)
\r
371 RefNode *ref = Get(obj,mainpos,&prev,true);
\r
375 SQBool RefTable::Release(SQObject &obj)
\r
379 RefNode *ref = Get(obj,mainpos,&prev,false);
\r
381 if(--ref->refs == 0) {
\r
382 SQObjectPtr o = ref->obj;
\r
384 prev->next = ref->next;
\r
387 _buckets[mainpos] = ref->next;
\r
389 ref->next = _freelist;
\r
393 //<<FIXME>>test for shrink?
\r
403 void RefTable::Resize(SQUnsignedInteger size)
\r
405 RefNode **oldbucks = _buckets;
\r
406 RefNode *t = _nodes;
\r
407 SQUnsignedInteger oldnumofslots = _numofslots;
\r
410 SQUnsignedInteger nfound = 0;
\r
411 for(SQUnsignedInteger n = 0; n < oldnumofslots; n++) {
\r
412 if(type(t->obj) != OT_NULL) {
\r
414 assert(t->refs != 0);
\r
415 RefNode *nn = Add(::HashObj(t->obj)&(_numofslots-1),t->obj);
\r
416 nn->refs = t->refs;
\r
422 assert(nfound == oldnumofslots);
\r
423 SQ_FREE(oldbucks,(oldnumofslots * sizeof(RefNode *)) + (oldnumofslots * sizeof(RefNode)));
\r
426 RefTable::RefNode *RefTable::Add(SQHash mainpos,SQObject &obj)
\r
428 RefNode *t = _buckets[mainpos];
\r
429 RefNode *newnode = _freelist;
\r
430 newnode->obj = obj;
\r
431 _buckets[mainpos] = newnode;
\r
432 _freelist = _freelist->next;
\r
434 assert(newnode->refs == 0);
\r
439 RefTable::RefNode *RefTable::Get(SQObject &obj,SQHash &mainpos,RefNode **prev,bool add)
\r
442 mainpos = ::HashObj(obj)&(_numofslots-1);
\r
444 for (ref = _buckets[mainpos]; ref; ) {
\r
445 if(_rawval(ref->obj) == _rawval(obj) && type(ref->obj) == type(obj))
\r
450 if(ref == NULL && add) {
\r
451 if(_numofslots == _slotused) {
\r
452 assert(_freelist == 0);
\r
453 Resize(_numofslots*2);
\r
454 mainpos = ::HashObj(obj)&(_numofslots-1);
\r
456 ref = Add(mainpos,obj);
\r
461 void RefTable::AllocNodes(SQUnsignedInteger size)
\r
465 bucks = (RefNode **)SQ_MALLOC((size * sizeof(RefNode *)) + (size * sizeof(RefNode)));
\r
466 nodes = (RefNode *)&bucks[size];
\r
467 RefNode *temp = nodes;
\r
468 SQUnsignedInteger n;
\r
469 for(n = 0; n < size - 1; n++) {
\r
472 new (&temp->obj) SQObjectPtr;
\r
473 temp->next = temp+1;
\r
478 new (&temp->obj) SQObjectPtr;
\r
484 _numofslots = size;
\r
486 //////////////////////////////////////////////////////////////////////////
\r
489 * The following code is based on Lua 4.0 (Copyright 1994-2002 Tecgraf, PUC-Rio.)
\r
490 * http://www.lua.org/copyright.html#4
\r
491 * http://www.lua.org/source/4.0.1/src_lstring.c.html
\r
494 SQStringTable::SQStringTable()
\r
500 SQStringTable::~SQStringTable()
\r
502 SQ_FREE(_strings,sizeof(SQString*)*_numofslots);
\r
506 void SQStringTable::AllocNodes(SQInteger size)
\r
508 _numofslots = size;
\r
509 _strings = (SQString**)SQ_MALLOC(sizeof(SQString*)*_numofslots);
\r
510 memset(_strings,0,sizeof(SQString*)*_numofslots);
\r
513 SQString *SQStringTable::Add(const SQChar *news,SQInteger len)
\r
516 len = (SQInteger)scstrlen(news);
\r
517 SQHash h = ::_hashstr(news,len)&(_numofslots-1);
\r
519 for (s = _strings[h]; s; s = s->_next){
\r
520 if(s->_len == len && (!memcmp(news,s->_val,rsl(len))))
\r
524 SQString *t=(SQString *)SQ_MALLOC(rsl(len)+sizeof(SQString));
\r
526 memcpy(t->_val,news,rsl(len));
\r
527 t->_val[len] = _SC('\0');
\r
529 t->_hash = ::_hashstr(news,len);
\r
530 t->_next = _strings[h];
\r
533 if (_slotused > _numofslots) /* too crowded? */
\r
534 Resize(_numofslots*2);
\r
538 void SQStringTable::Resize(SQInteger size)
\r
540 SQInteger oldsize=_numofslots;
\r
541 SQString **oldtable=_strings;
\r
543 for (SQInteger i=0; i<oldsize; i++){
\r
544 SQString *p = oldtable[i];
\r
546 SQString *next = p->_next;
\r
547 SQHash h = p->_hash&(_numofslots-1);
\r
548 p->_next = _strings[h];
\r
553 SQ_FREE(oldtable,oldsize*sizeof(SQString*));
\r
556 void SQStringTable::Remove(SQString *bs)
\r
559 SQString *prev=NULL;
\r
560 SQHash h = bs->_hash&(_numofslots - 1);
\r
562 for (s = _strings[h]; s; ){
\r
565 prev->_next = s->_next;
\r
567 _strings[h] = s->_next;
\r
569 SQInteger slen = s->_len;
\r
571 SQ_FREE(s,sizeof(SQString) + rsl(slen));
\r
577 assert(0);//if this fail something is wrong
\r