sqvm.cpp 59 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147
  1. /*
  2. see copyright notice in squirrel.h
  3. */
  4. #include "sqpcheader.h"
  5. #include <math.h>
  6. #include <limits.h>
  7. #include <stdlib.h>
  8. #include "sqopcodes.h"
  9. #include "sqvm.h"
  10. #include "sqfuncproto.h"
  11. #include "sqclosure.h"
  12. #include "sqstring.h"
  13. #include "sqtable.h"
  14. #include "squserdata.h"
  15. #include "sqarray.h"
  16. #include "sqclass.h"
  17. #ifdef SQ_JIT_LLVM
  18. #include "sq_llvm.h"
  19. #endif
  20. #define TOP() (_stack._vals[_top-1])
  21. #define STK(a) _stack._vals[_stackbase+(a)]
  22. #define TARGET _stack._vals[_stackbase+arg0]
  23. #define EXISTS_FALL_BACK -1
  24. bool SQVM::BW_OP(SQUnsignedInteger op,SQObjectPtr &trg,const SQObjectPtr &o1,const SQObjectPtr &o2)
  25. {
  26. SQInteger res;
  27. if((sq_type(o1)|sq_type(o2)) == OT_INTEGER)
  28. {
  29. SQInteger i1 = _integer(o1), i2 = _integer(o2);
  30. switch(op) {
  31. case BW_AND: res = i1 & i2; break;
  32. case BW_OR: res = i1 | i2; break;
  33. case BW_XOR: res = i1 ^ i2; break;
  34. case BW_SHIFTL: res = i1 << i2; break;
  35. case BW_SHIFTR: res = i1 >> i2; break;
  36. case BW_USHIFTR:res = (SQInteger)(*((SQUnsignedInteger*)&i1) >> i2); break;
  37. default: { Raise_Error(_SC("internal vm error bitwise op failed")); return false; }
  38. }
  39. }
  40. else { Raise_Error(_SC("bitwise op between '%s' and '%s'"),GetTypeName(o1),GetTypeName(o2)); return false;}
  41. trg = res;
  42. return true;
  43. }
  44. #define _ARITH_BASE_(op,trg,o1,o2, ARITH_INTEGER) \
  45. { \
  46. switch(sq_type(o1)|sq_type(o2)) { \
  47. case OT_INTEGER: ARITH_INTEGER;break; \
  48. case (OT_FLOAT): trg = _float(o1) op _float(o2); break;\
  49. case (OT_FLOAT|OT_INTEGER): trg = tofloat(o1) op tofloat(o2); break;\
  50. default: _GUARD(ARITH_OP((#op)[0],trg,o1,o2)); break;\
  51. } \
  52. }
  53. #define _ARITH_(op,trg,o1,o2) _ARITH_BASE_(op,trg,o1,o2, trg = _integer(o1) op _integer(o2))
  54. #define _ARITH_NOZERO(op,trg,o1,o2,err) _ARITH_BASE_(op,trg,o1,o2, {\
  55. SQInteger i1 = _integer(o1); SQInteger i2 = _integer(o2);\
  56. if(i2 == 0) { Raise_Error(err); SQ_THROW(); } \
  57. else if(i2 == -1 && i1 == SQ_INT_MIN) { Raise_Error(_SC("integer overflow")); SQ_THROW(); }\
  58. trg = i1 op i2;\
  59. })
  60. bool SQVM::ARITH_OP(SQUnsignedInteger op,SQObjectPtr &trg,const SQObjectPtr &o1,const SQObjectPtr &o2)
  61. {
  62. SQInteger tmask = sq_type(o1)|sq_type(o2);
  63. switch(tmask) {
  64. case OT_INTEGER:{
  65. SQInteger res, i1 = _integer(o1), i2 = _integer(o2);
  66. switch(op) {
  67. case '+': res = i1 + i2; break;
  68. case '-': res = i1 - i2; break;
  69. case '/':
  70. if(i2 == 0) { Raise_Error(_SC("division by zero")); return false; }
  71. else if(i2 == -1 && i1 == SQ_INT_MIN) { Raise_Error(_SC("integer overflow")); return false; }
  72. res = i1 / i2;
  73. break;
  74. case '*': res = i1 * i2; break;
  75. case '%': if(i2 == 0) { Raise_Error(_SC("modulo by zero")); return false; }
  76. else if(i2 == -1 && i1 == SQ_INT_MIN) { res = 0; break; }
  77. res = i1 % i2;
  78. break;
  79. default: res = 0xDEADBEEF;
  80. }
  81. trg = res; }
  82. break;
  83. case (OT_FLOAT|OT_INTEGER):
  84. case (OT_FLOAT):{
  85. SQFloat res, f1, f2;
  86. if(tmask == OT_FLOAT){
  87. f1 = _float(o1);
  88. f2 = _float(o2);
  89. }
  90. else
  91. {
  92. f1 = tofloat(o1);
  93. f2 = tofloat(o2);
  94. }
  95. switch(op) {
  96. case '+': res = f1 + f2; break;
  97. case '-': res = f1 - f2; break;
  98. case '/': res = f1 / f2; break;
  99. case '*': res = f1 * f2; break;
  100. case '%': res = SQFloat(fmod((double)f1,(double)f2)); break;
  101. default: res = 0x0f;
  102. }
  103. trg = res; }
  104. break;
  105. default:
  106. if(op == '+' && (tmask & _RT_STRING)){
  107. if(!StringCat(o1, o2, trg)) return false;
  108. }
  109. else if(!ArithMetaMethod(op,o1,o2,trg)) {
  110. return false;
  111. }
  112. }
  113. return true;
  114. }
  115. SQVM::SQVM(SQSharedState *ss)
  116. {
  117. _closing=SQFalse;
  118. _sharedstate=ss;
  119. _suspended = SQFalse;
  120. _suspended_target = -1;
  121. _suspended_root = SQFalse;
  122. _suspended_traps = -1;
  123. _foreignptr = NULL;
  124. _nnativecalls = 0;
  125. _nmetamethodscall = 0;
  126. _lasterror.Null();
  127. _lasterror_line = 0;
  128. _lasterror_column = 0;
  129. memset(&_lasterror_stackinfo, 0, sizeof(SQStackInfos));
  130. _errorhandler.Null();
  131. _atexithandler.Null();
  132. _debughook = false;
  133. _debughook_native = NULL;
  134. _debughook_closure.Null();
  135. _openouters = NULL;
  136. ci = NULL;
  137. _releasehook = NULL;
  138. INIT_CHAIN();ADD_TO_CHAIN(&_ss(this)->_gc_chain,this);
  139. #ifdef SQ_WITH_DELAYED_RELEASE_HOOKS
  140. _check_delayed_relase_hooks = true;
  141. #endif
  142. #ifdef PROFILE_SQVM
  143. printf("SQVM::SQVM : %p\n", this);
  144. _op_profile_timer.start();
  145. _op_profile.resize(_OP__LAST__+1);
  146. for(SQUnsignedInteger i=0; i <= _OP__LAST__; ++i){
  147. OpProfile &opp = _op_profile[i];
  148. opp.op = i;
  149. opp.count = opp.total_time = 0;
  150. }
  151. #endif
  152. }
  153. void SQVM::Finalize()
  154. {
  155. _closing=SQTrue;
  156. CallAtExitHandler();
  157. #ifdef SQ_WITH_DELAYED_RELEASE_HOOKS
  158. _sharedstate->CallDelayedReleaseHooks(this);
  159. #else
  160. if(_releasehook) { _releasehook(_foreignptr,0,0); _releasehook = NULL; }
  161. #endif
  162. if(_openouters) CloseOuters(&_stack._vals[0]);
  163. _roottable.Null();
  164. _lasterror.Null();
  165. _errorhandler.Null();
  166. _atexithandler.Null();
  167. _debughook = false;
  168. _debughook_native = NULL;
  169. _debughook_closure.Null();
  170. _include_path.Null();
  171. temp_reg.Null();
  172. _callstackdata.resize(0);
  173. SQInteger size=_stack.size();
  174. for(SQInteger i=0;i<size;i++)
  175. _stack[i].Null();
  176. #ifdef PROFILE_SQVM
  177. printf("SQVM::Finalize : %p\n", this);
  178. #define ENUM_OP(a,b) {\
  179. OpProfile &opp = _op_profile[a];\
  180. if(opp.count) printf("%d\t%d\t%d\t%f\t%s\n", a, opp.op, opp.count, opp.total_time, _SC(#a));\
  181. }
  182. SQ_OP_CODE_LIST()
  183. #undef ENUM_OP
  184. #endif
  185. }
  186. SQVM::~SQVM()
  187. {
  188. Finalize();
  189. REMOVE_FROM_CHAIN(&_ss(this)->_gc_chain,this);
  190. }
  191. bool SQVM::ArithMetaMethod(SQInteger op,const SQObjectPtr &o1,const SQObjectPtr &o2,SQObjectPtr &dest)
  192. {
  193. if(is_delegable(o1) && _delegable(o1)->_delegate) {
  194. SQObjectPtr closure;
  195. SQMetaMethod mm;
  196. switch(op){
  197. case _SC('+'): mm=MT_ADD; break;
  198. case _SC('-'): mm=MT_SUB; break;
  199. case _SC('/'): mm=MT_DIV; break;
  200. case _SC('*'): mm=MT_MUL; break;
  201. case _SC('%'): mm=MT_MODULO; break;
  202. default: assert(0); break; //shutup compiler
  203. }
  204. if(_delegable(o1)->GetMetaMethod(this, mm, closure)) {
  205. Push(o1);Push(o2);
  206. return CallMetaMethod(closure,mm,2,dest);
  207. }
  208. }
  209. Raise_Error(_SC("arith op %c on between '%s' and '%s'"),op,GetTypeName(o1),GetTypeName(o2));
  210. return false;
  211. }
  212. bool SQVM::NEG_OP(SQObjectPtr &trg,const SQObjectPtr &o)
  213. {
  214. switch(sq_type(o)) {
  215. case OT_INTEGER:
  216. trg = -_integer(o);
  217. return true;
  218. case OT_FLOAT:
  219. trg = -_float(o);
  220. return true;
  221. case OT_TABLE:
  222. case OT_USERDATA:
  223. case OT_INSTANCE:
  224. if(_delegable(o)->_delegate) {
  225. SQObjectPtr closure;
  226. if(_delegable(o)->GetMetaMethod(this, MT_UNM, closure)) {
  227. Push(o);
  228. if(!CallMetaMethod(closure, MT_UNM, 1, temp_reg)) return false;
  229. _Swap(trg,temp_reg);
  230. return true;
  231. }
  232. }
  233. default:break; //shutup compiler
  234. }
  235. Raise_Error(_SC("attempt to negate a %s"), GetTypeName(o));
  236. return false;
  237. }
  238. static int sq_l_strcmp (const SQObjectPtr &ls,const SQObjectPtr &rs) {
  239. const SQChar *l = _stringval(ls);
  240. SQInteger ll = _string(ls)->_len;
  241. const SQChar *r = _stringval(rs);
  242. SQInteger lr = _string(rs)->_len;
  243. for (;;) {
  244. int temp = scstrcmp(l, r); //strcoll(l, r);
  245. if (temp != 0) return temp;
  246. else { /* strings are equal up to a `\0' */
  247. int len = (int)scstrlen(l); /* index of first `\0' in both strings */
  248. if (len == lr) /* r is finished? */
  249. return (len == ll) ? 0 : 1;
  250. else if (len == ll) /* l is finished? */
  251. return -1; /* l is smaller than r (because r is not finished) */
  252. /* both strings longer than `len'; go on comparing (after the `\0') */
  253. len++;
  254. l += len; ll -= len; r += len; lr -= len;
  255. }
  256. }
  257. }
  258. #define _RET_SUCCEED(exp) { result = (exp); return true; }
  259. bool SQVM::ObjCmp(const SQObjectPtr &o1,const SQObjectPtr &o2,SQInteger &result)
  260. {
  261. SQObjectType t1 = sq_type(o1), t2 = sq_type(o2);
  262. if(t1 == t2) {
  263. if(_rawval(o1) == _rawval(o2))_RET_SUCCEED(0);
  264. SQObjectPtr res;
  265. switch(t1){
  266. case OT_STRING:
  267. _RET_SUCCEED(sq_l_strcmp(o1,o2));
  268. case OT_INTEGER:
  269. _RET_SUCCEED((_integer(o1)<_integer(o2))?-1:1);
  270. case OT_FLOAT:
  271. _RET_SUCCEED((_float(o1)<_float(o2))?-1:1);
  272. case OT_TABLE:
  273. case OT_USERDATA:
  274. case OT_INSTANCE:
  275. if(_delegable(o1)->_delegate) {
  276. SQObjectPtr closure;
  277. if(_delegable(o1)->GetMetaMethod(this, MT_CMP, closure)) {
  278. Push(o1);Push(o2);
  279. if(CallMetaMethod(closure,MT_CMP,2,res)) {
  280. if(sq_type(res) != OT_INTEGER) {
  281. Raise_Error(_SC("_cmp must return an integer"));
  282. return false;
  283. }
  284. _RET_SUCCEED(_integer(res))
  285. }
  286. return false;
  287. }
  288. }
  289. //continues through (no break needed)
  290. default:
  291. _RET_SUCCEED( _userpointer(o1) < _userpointer(o2)?-1:1 );
  292. }
  293. assert(0);
  294. //if(sq_type(res)!=OT_INTEGER) { Raise_CompareError(o1,o2); return false; }
  295. // _RET_SUCCEED(_integer(res));
  296. }
  297. else{
  298. if(sq_isnumeric(o1) && sq_isnumeric(o2)){
  299. if((t1==OT_INTEGER) && (t2==OT_FLOAT)) {
  300. if( _integer(o1)==_float(o2) ) { _RET_SUCCEED(0); }
  301. else if( _integer(o1)<_float(o2) ) { _RET_SUCCEED(-1); }
  302. _RET_SUCCEED(1);
  303. }
  304. else{
  305. if( _float(o1)==_integer(o2) ) { _RET_SUCCEED(0); }
  306. else if( _float(o1)<_integer(o2) ) { _RET_SUCCEED(-1); }
  307. _RET_SUCCEED(1);
  308. }
  309. }
  310. else if(t1==OT_NULL) {_RET_SUCCEED(-1);}
  311. else if(t2==OT_NULL) {_RET_SUCCEED(1);}
  312. else { Raise_CompareError(o1,o2); return false; }
  313. }
  314. assert(0);
  315. _RET_SUCCEED(0); //cannot happen
  316. }
  317. bool SQVM::CMP_OP(CmpOP op, const SQObjectPtr &o1,const SQObjectPtr &o2,SQObjectPtr &res)
  318. {
  319. SQInteger r;
  320. if(ObjCmp(o1,o2,r)) {
  321. switch(op) {
  322. case CMP_G: res = (r > 0); return true;
  323. case CMP_GE: res = (r >= 0); return true;
  324. case CMP_L: res = (r < 0); return true;
  325. case CMP_LE: res = (r <= 0); return true;
  326. case CMP_3W: res = r; return true;
  327. }
  328. assert(0);
  329. }
  330. return false;
  331. }
  332. bool SQVM::ToString(const SQObjectPtr &o,SQObjectPtr &res)
  333. {
  334. switch(sq_type(o)) {
  335. case OT_STRING:
  336. res = o;
  337. return true;
  338. case OT_FLOAT:
  339. scsprintf(_sp(sq_rsl(NUMBER_MAX_CHAR+1)),sq_rsl(NUMBER_MAX_CHAR),_SC("%g"),_float(o));
  340. break;
  341. case OT_INTEGER:
  342. scsprintf(_sp(sq_rsl(NUMBER_MAX_CHAR+1)),sq_rsl(NUMBER_MAX_CHAR),_PRINT_INT_FMT,_integer(o));
  343. break;
  344. case OT_BOOL:
  345. scsprintf(_sp(sq_rsl(6)),sq_rsl(6),_integer(o)?_SC("true"):_SC("false"));
  346. break;
  347. case OT_TABLE:
  348. case OT_USERDATA:
  349. case OT_INSTANCE:
  350. if(_delegable(o)->_delegate) {
  351. SQObjectPtr closure;
  352. if(_delegable(o)->GetMetaMethod(this, MT_TOSTRING, closure)) {
  353. Push(o);
  354. if(CallMetaMethod(closure,MT_TOSTRING,1,res)) {
  355. if(sq_type(res) == OT_STRING)
  356. return true;
  357. }
  358. else {
  359. return false;
  360. }
  361. }
  362. }
  363. default:
  364. SQInteger size = (sizeof(void*)*2)+NUMBER_MAX_CHAR;
  365. scsprintf(_sp(sq_rsl(size)),sq_rsl(size),_SC("(%s : 0x%p)"),GetTypeName(o),(void*)_rawval(o));
  366. }
  367. res = SQString::Create(_ss(this),_spval);
  368. return true;
  369. }
  370. #define SQ_MAX_STR_SIZE (((size_t)(512*1024*1024)))
  371. bool SQVM::StringCat(const SQObjectPtr &str,const SQObjectPtr &obj,SQObjectPtr &dest)
  372. {
  373. SQObjectPtr a, b;
  374. if(!ToString(str, a)) return false;
  375. if(!ToString(obj, b)) return false;
  376. SQInteger l = _string(a)->_len , ol = _string(b)->_len;
  377. //if (l >= SQ_MAX_STR_SIZE - ol) Raise_Error(_SC("string length overflow"));
  378. SQChar *s = _sp(sq_rsl(l + ol + 1));
  379. memcpy(s, _stringval(a), sq_rsl(l));
  380. memcpy(s + l, _stringval(b), sq_rsl(ol));
  381. dest = SQString::Create(_ss(this), _spval, l + ol);
  382. return true;
  383. }
  384. bool SQVM::TypeOf(const SQObjectPtr &obj1,SQObjectPtr &dest)
  385. {
  386. if(is_delegable(obj1) && _delegable(obj1)->_delegate) {
  387. SQObjectPtr closure;
  388. if(_delegable(obj1)->GetMetaMethod(this, MT_TYPEOF, closure)) {
  389. Push(obj1);
  390. return CallMetaMethod(closure,MT_TYPEOF,1,dest);
  391. }
  392. }
  393. dest = SQString::Create(_ss(this),GetTypeName(obj1));
  394. return true;
  395. }
  396. bool SQVM::Init(SQVM *friendvm, SQInteger stacksize)
  397. {
  398. _stack.resize(stacksize);
  399. _alloccallsstacksize = 4;
  400. _callstackdata.resize(_alloccallsstacksize);
  401. _callsstacksize = 0;
  402. _callsstack = &_callstackdata[0];
  403. _stackbase = 0;
  404. _top = 0;
  405. if(!friendvm) {
  406. _roottable = SQTable::Create(_ss(this), 0);
  407. sq_base_register(this);
  408. } else {
  409. _roottable = friendvm->_roottable;
  410. _errorhandler = friendvm->_errorhandler;
  411. _debughook = friendvm->_debughook;
  412. _debughook_native = friendvm->_debughook_native;
  413. _debughook_closure = friendvm->_debughook_closure;
  414. }
  415. return true;
  416. }
  417. bool SQVM::StartCall(SQClosure *closure,SQInteger target,SQInteger args,SQInteger stackbase,bool tailcall)
  418. {
  419. SQFunctionProto *func = closure->_function;
  420. SQInteger paramssize = func->_nparameters;
  421. const SQInteger newtop = stackbase + func->_stacksize;
  422. SQInteger nargs = args;
  423. if(func->_varparams)
  424. {
  425. paramssize--;
  426. if (nargs < paramssize) {
  427. Raise_Error(_SC("wrong number of parameters"));
  428. return false;
  429. }
  430. //dumpstack(stackbase);
  431. SQInteger nvargs = nargs - paramssize;
  432. SQArray *arr = SQArray::Create(_ss(this),nvargs);
  433. SQInteger pbase = stackbase+paramssize;
  434. for(SQInteger n = 0; n < nvargs; n++) {
  435. arr->_set(n, _stack._vals[pbase]);
  436. _stack._vals[pbase].Null();
  437. pbase++;
  438. }
  439. _stack._vals[stackbase+paramssize] = arr;
  440. //dumpstack(stackbase);
  441. }
  442. else if (paramssize != nargs) {
  443. SQInteger ndef = func->_ndefaultparams;
  444. SQInteger diff;
  445. if(ndef && nargs < paramssize && (diff = paramssize - nargs) <= ndef) {
  446. for(SQInteger n = ndef - diff; n < ndef; n++) {
  447. _stack._vals[stackbase + (nargs++)] = closure->_defaultparams[n];
  448. }
  449. }
  450. else {
  451. Raise_Error(_SC("wrong number of parameters"));
  452. return false;
  453. }
  454. }
  455. if(closure->_env) {
  456. _stack._vals[stackbase] = closure->_env->_obj;
  457. }
  458. if(!EnterFrame(stackbase, newtop, tailcall)) return false;
  459. ci->_closure = closure;
  460. ci->_literals = func->_literals;
  461. ci->_ip = func->_instructions;
  462. ci->_target = (SQInt32)target;
  463. if (_debughook) {
  464. CallDebugHook(_SC('c'));
  465. }
  466. if (closure->_function->_bgenerator) {
  467. SQFunctionProto *f = closure->_function;
  468. SQGenerator *gen = SQGenerator::Create(_ss(this), closure);
  469. if(!gen->Yield(this,f->_stacksize))
  470. return false;
  471. SQObjectPtr temp;
  472. Return(1, target, temp);
  473. STK(target) = gen;
  474. }
  475. return true;
  476. }
  477. bool SQVM::Return(SQInteger _arg0, SQInteger _arg1, SQObjectPtr &retval)
  478. {
  479. SQBool _isroot = ci->_root;
  480. SQInteger callerbase = _stackbase - ci->_prevstkbase;
  481. if (_debughook) {
  482. for(SQInteger i=0; i<ci->_ncalls; i++) {
  483. CallDebugHook(_SC('r'));
  484. }
  485. }
  486. SQObjectPtr *dest;
  487. if (_isroot) {
  488. dest = &(retval);
  489. } else if (ci->_target == -1) {
  490. dest = NULL;
  491. } else {
  492. dest = &_stack._vals[callerbase + ci->_target];
  493. }
  494. if (dest) {
  495. if(_arg0 != 0xFF) {
  496. *dest = _stack._vals[_stackbase+_arg1];
  497. }
  498. else {
  499. dest->Null();
  500. }
  501. //*dest = (_arg0 != 0xFF) ? _stack._vals[_stackbase+_arg1] : _null_;
  502. }
  503. LeaveFrame();
  504. return _isroot ? true : false;
  505. }
  506. #define _RET_ON_FAIL(exp) { if(!exp) return false; }
  507. bool SQVM::PLOCAL_INC(SQInteger op,SQObjectPtr &target, SQObjectPtr &a, SQObjectPtr &incr)
  508. {
  509. SQObjectPtr trg;
  510. _RET_ON_FAIL(ARITH_OP( op , trg, a, incr));
  511. target = a;
  512. a = trg;
  513. return true;
  514. }
  515. bool SQVM::DerefInc(SQInteger op,SQObjectPtr &target, SQObjectPtr &self, SQObjectPtr &key, SQObjectPtr &incr, bool postfix,SQInteger selfidx)
  516. {
  517. SQObjectPtr tmp, tself = self, tkey = key;
  518. if (!Get(tself, tkey, tmp, false, selfidx)) { return false; }
  519. _RET_ON_FAIL(ARITH_OP( op , target, tmp, incr))
  520. if (!Set(tself, tkey, target,selfidx)) { return false; }
  521. if (postfix) target = tmp;
  522. return true;
  523. }
  524. #define arg0 (_i_._arg0)
  525. #define sarg0 ((SQInteger)*((const signed char *)&_i_._arg0))
  526. #define arg1 (_i_._arg1)
  527. #define sarg1 (*((const SQInt32 *)&_i_._arg1))
  528. #define arg2 (_i_._arg2)
  529. #define arg3 (_i_._arg3)
  530. #define sarg3 ((SQInteger)*((const signed char *)&_i_._arg3))
  531. SQRESULT SQVM::Suspend()
  532. {
  533. if (_suspended)
  534. return sq_throwerror(this, _SC("cannot suspend an already suspended vm"));
  535. if (_nnativecalls!=2)
  536. return sq_throwerror(this, _SC("cannot suspend through native calls/metamethods"));
  537. return SQ_SUSPEND_FLAG;
  538. }
  539. #define _FINISH(howmuchtojump) {jump = howmuchtojump; return true; }
  540. bool SQVM::FOREACH_OP(SQObjectPtr &o1,SQObjectPtr &o2,SQObjectPtr
  541. &o3,SQObjectPtr &o4,SQInteger SQ_UNUSED_ARG(arg_2),int exitpos,int &jump)
  542. {
  543. SQInteger nrefidx;
  544. switch(sq_type(o1)) {
  545. case OT_TABLE:
  546. if((nrefidx = _table(o1)->Next(false,o4, o2, o3)) == -1) _FINISH(exitpos);
  547. o4 = (SQInteger)nrefidx; _FINISH(1);
  548. case OT_ARRAY:
  549. if((nrefidx = _array(o1)->Next(o4, o2, o3)) == -1) _FINISH(exitpos);
  550. o4 = (SQInteger) nrefidx; _FINISH(1);
  551. case OT_STRING:
  552. if((nrefidx = _string(o1)->Next(o4, o2, o3)) == -1)_FINISH(exitpos);
  553. o4 = (SQInteger)nrefidx; _FINISH(1);
  554. case OT_CLASS:
  555. if((nrefidx = _class(o1)->Next(o4, o2, o3)) == -1)_FINISH(exitpos);
  556. o4 = (SQInteger)nrefidx; _FINISH(1);
  557. case OT_USERDATA:
  558. case OT_INSTANCE:
  559. if(_delegable(o1)->_delegate) {
  560. SQObjectPtr itr;
  561. SQObjectPtr closure;
  562. if(_delegable(o1)->GetMetaMethod(this, MT_NEXTI, closure)) {
  563. Push(o1);
  564. Push(o4);
  565. if(CallMetaMethod(closure, MT_NEXTI, 2, itr)) {
  566. o4 = o2 = itr;
  567. if(sq_type(itr) == OT_NULL) _FINISH(exitpos);
  568. if(!Get(o1, itr, o3, false, DONT_FALL_BACK)) {
  569. Raise_Error(_SC("_nexti returned an invalid idx")); // cloud be changed
  570. return false;
  571. }
  572. _FINISH(1);
  573. }
  574. else {
  575. return false;
  576. }
  577. }
  578. Raise_Error(_SC("_nexti failed"));
  579. return false;
  580. }
  581. break;
  582. case OT_GENERATOR:
  583. switch(_generator(o1)->_state){
  584. case SQGenerator::eDead: _FINISH(exitpos);
  585. break;
  586. case SQGenerator::eSuspended:{
  587. SQInteger idx = 0;
  588. if(sq_type(o4) == OT_INTEGER) {
  589. idx = _integer(o4) + 1;
  590. }
  591. o2 = idx;
  592. o4 = idx;
  593. _generator(o1)->Resume(this, o3);
  594. _FINISH(0);
  595. }
  596. break;
  597. default:
  598. break;
  599. }
  600. default:
  601. Raise_Error(_SC("cannot iterate %s"), GetTypeName(o1));
  602. }
  603. return false; //cannot be hit(just to avoid warnings)
  604. }
  605. #define COND_LITERAL (arg3!=0?ci->_literals[arg1]:STK(arg1))
  606. #define SQ_THROW() { goto exception_trap; }
  607. #define _GUARD(exp) { if(!exp) { SQ_THROW();} }
  608. bool SQVM::CLOSURE_OP(SQObjectPtr &target, SQFunctionProto *func)
  609. {
  610. SQInteger nouters;
  611. SQClosure *closure = SQClosure::Create(_ss(this), func,_table(_roottable)->GetWeakRef(OT_TABLE));
  612. if((nouters = func->_noutervalues)) {
  613. for(SQInteger i = 0; i<nouters; i++) {
  614. SQOuterVar &v = func->_outervalues[i];
  615. switch(v._type){
  616. case otLOCAL:
  617. FindOuter(closure->_outervalues[i], &STK(_integer(v._src)));
  618. break;
  619. case otOUTER:
  620. closure->_outervalues[i] = _closure(ci->_closure)->_outervalues[_integer(v._src)];
  621. break;
  622. }
  623. }
  624. }
  625. SQInteger ndefparams;
  626. if((ndefparams = func->_ndefaultparams)) {
  627. for(SQInteger i = 0; i < ndefparams; i++) {
  628. SQInteger spos = func->_defaultparams[i];
  629. closure->_defaultparams[i] = _stack._vals[_stackbase + spos];
  630. }
  631. }
  632. target = closure;
  633. return true;
  634. }
  635. bool SQVM::CLASS_OP(SQObjectPtr &target,SQInteger baseclass,SQInteger attributes)
  636. {
  637. SQClass *base = NULL;
  638. SQObjectPtr attrs;
  639. if(baseclass != -1) {
  640. if(sq_type(_stack._vals[_stackbase+baseclass]) != OT_CLASS) { Raise_Error(_SC("trying to inherit from a %s"),GetTypeName(_stack._vals[_stackbase+baseclass])); return false; }
  641. base = _class(_stack._vals[_stackbase + baseclass]);
  642. }
  643. if(attributes != MAX_FUNC_STACKSIZE) {
  644. attrs = _stack._vals[_stackbase+attributes];
  645. }
  646. target = SQClass::Create(_ss(this),base);
  647. if(sq_type(_class(target)->_metamethods[MT_INHERITED]) != OT_NULL) {
  648. int nparams = 2;
  649. SQObjectPtr ret;
  650. Push(target); Push(attrs);
  651. if(!Call(_class(target)->_metamethods[MT_INHERITED],nparams,_top - nparams, ret, false)) {
  652. Pop(nparams);
  653. return false;
  654. }
  655. Pop(nparams);
  656. }
  657. _class(target)->_attributes = attrs;
  658. return true;
  659. }
  660. bool SQVM::IsEqualDeep(const SQObjectPtr &o1,const SQObjectPtr &o2)
  661. {
  662. if(sq_type(o1) == sq_type(o2)) {
  663. if(_rawval(o1) == _rawval(o2)) return true;
  664. SQInteger rc;
  665. if(ObjCmp(o1, o2, rc) && (rc == 0)) return true;
  666. return false;
  667. }
  668. return IsEqual(o1, o2);
  669. }
  670. bool SQVM::IsEqual(const SQObjectPtr &o1,const SQObjectPtr &o2)
  671. {
  672. bool res = false;
  673. if(sq_type(o1) == sq_type(o2)) {
  674. res = (_rawval(o1) == _rawval(o2));
  675. }
  676. else if(sq_isnumeric(o1) && sq_isnumeric(o2)) {
  677. res = (tofloat(o1) == tofloat(o2));
  678. }
  679. else if(sq_type(o1) == OT_BOOL) {
  680. if(sq_type(o2) & SQOBJECT_CANBEFALSE) {
  681. res = _integer(o1) == (IsFalse(o2) ? 0 : 1);
  682. }
  683. }
  684. else if(sq_type(o2) == OT_BOOL) {
  685. if(sq_type(o1) & SQOBJECT_CANBEFALSE) {
  686. res = _integer(o2) == (IsFalse(o1) ? 0 : 1);
  687. }
  688. }
  689. return res;
  690. }
  691. bool SQVM::IsEqualIdentity(const SQObjectPtr &o1,const SQObjectPtr &o2)
  692. {
  693. bool res = false;
  694. if(sq_type(o1) == sq_type(o2)) {
  695. res = (_rawval(o1) == _rawval(o2));
  696. }
  697. return res;
  698. }
  699. bool SQVM::IsFalse(const SQObjectPtr &o)
  700. {
  701. if(((sq_type(o) & SQOBJECT_CANBEFALSE)
  702. && ( ((sq_type(o) == OT_FLOAT) && (_float(o) == SQFloat(0.0))) ))
  703. #if !defined(SQUSEDOUBLE) || (defined(SQUSEDOUBLE) && defined(_SQ64))
  704. || (_integer(o) == 0) ) //OT_NULL|OT_INTEGER|OT_BOOL
  705. #else
  706. || (((sq_type(o) != OT_FLOAT) && (_integer(o) == 0))) ) //OT_NULL|OT_INTEGER|OT_BOOL
  707. #endif
  708. {
  709. return true;
  710. }
  711. return false;
  712. }
  713. #if defined(__GNUC__) && defined(USE_COMPUTED_GOTOS)
  714. //it doesn't generate faster code, even slower
  715. //on lua it has a small noticeable improvement
  716. //needs -fno-gcse or even -fno-crossjumping
  717. #define COMPUTED_GOTO 1
  718. #pragma GCC push_options
  719. //#pragma GCC optimize ("no-gcse")
  720. //#pragma GCC optimize ("no-crossjumping")
  721. #endif
  722. #ifdef COMPUTED_GOTO
  723. #define OPCODE_TARGET(op) DO_OP_##op:
  724. #define CALL_OPCODE(op) \
  725. if ((op < sizeof(opcodes) / sizeof(opcodes[0])) && opcodes[op]) \
  726. goto *opcodes[op];
  727. #define OPCODE_PTR(op) [_OP_##op] = &&DO_OP_##op
  728. #else
  729. #define OPCODE_TARGET(op) case _OP_##op:
  730. #define CALL_OPCODE(op) switch (op)
  731. #endif
  732. bool SQVM::Execute(SQObjectPtr &closure, SQInteger nargs, SQInteger stackbase,SQObjectPtr &outres, SQBool raiseerror,ExecutionType et)
  733. {
  734. if ((_nnativecalls + 1) > MAX_NATIVE_CALLS) { Raise_Error(_SC("Native stack overflow")); return false; }
  735. _nnativecalls++;
  736. AutoDec ad(&_nnativecalls);
  737. SQInteger traps = 0;
  738. CallInfo *prevci = ci;
  739. #ifdef COMPUTED_GOTO
  740. static const void *opcodes[] = {
  741. OPCODE_PTR(LINE),
  742. OPCODE_PTR(LOAD),
  743. OPCODE_PTR(LOADINT),
  744. OPCODE_PTR(LOADFLOAT),
  745. OPCODE_PTR(DLOAD),
  746. OPCODE_PTR(TAILCALL),
  747. OPCODE_PTR(CALL),
  748. OPCODE_PTR(PREPCALL),
  749. OPCODE_PTR(PREPCALLK),
  750. OPCODE_PTR(GETK),
  751. OPCODE_PTR(MOVE),
  752. OPCODE_PTR(NEWSLOT),
  753. OPCODE_PTR(DELETE),
  754. OPCODE_PTR(SET),
  755. OPCODE_PTR(GET),
  756. OPCODE_PTR(EQ),
  757. OPCODE_PTR(NE),
  758. OPCODE_PTR(ADD),
  759. OPCODE_PTR(SUB),
  760. OPCODE_PTR(MUL),
  761. OPCODE_PTR(DIV),
  762. OPCODE_PTR(MOD),
  763. OPCODE_PTR(BITW),
  764. OPCODE_PTR(RETURN),
  765. OPCODE_PTR(LOADNULLS),
  766. OPCODE_PTR(LOADROOT),
  767. OPCODE_PTR(LOADBOOL),
  768. OPCODE_PTR(DMOVE),
  769. OPCODE_PTR(JMP),
  770. OPCODE_PTR(JCMP),
  771. OPCODE_PTR(JZ),
  772. OPCODE_PTR(SETOUTER),
  773. OPCODE_PTR(GETOUTER),
  774. OPCODE_PTR(NEWOBJ),
  775. OPCODE_PTR(APPENDARRAY),
  776. OPCODE_PTR(COMPARITH),
  777. OPCODE_PTR(INC),
  778. OPCODE_PTR(INCL),
  779. OPCODE_PTR(PINC),
  780. OPCODE_PTR(PINCL),
  781. OPCODE_PTR(CMP),
  782. OPCODE_PTR(EXISTS),
  783. OPCODE_PTR(INSTANCEOF),
  784. OPCODE_PTR(AND),
  785. OPCODE_PTR(OR),
  786. OPCODE_PTR(NEG),
  787. OPCODE_PTR(NOT),
  788. OPCODE_PTR(BWNOT),
  789. OPCODE_PTR(CLOSURE),
  790. OPCODE_PTR(YIELD),
  791. OPCODE_PTR(RESUME),
  792. OPCODE_PTR(FOREACH),
  793. OPCODE_PTR(POSTFOREACH),
  794. OPCODE_PTR(CLONE),
  795. OPCODE_PTR(TYPEOF),
  796. OPCODE_PTR(PUSHTRAP),
  797. OPCODE_PTR(POPTRAP),
  798. OPCODE_PTR(THROW),
  799. OPCODE_PTR(NEWSLOTA),
  800. OPCODE_PTR(GETBASE),
  801. OPCODE_PTR(CLOSE),
  802. OPCODE_PTR(EQI),
  803. OPCODE_PTR(NEI),
  804. OPCODE_PTR(NOP),
  805. };
  806. #endif
  807. switch(et) {
  808. case ET_CALL: {
  809. temp_reg = closure;
  810. if(!StartCall(_closure(temp_reg), _top - nargs, nargs, stackbase, false)) {
  811. //call the handler if there are no calls in the stack, if not relies on the previous node
  812. if(ci == NULL) CallErrorHandler(_lasterror);
  813. return false;
  814. }
  815. if(ci == prevci) {
  816. outres = STK(_top-nargs);
  817. return true;
  818. }
  819. ci->_root = SQTrue;
  820. }
  821. break;
  822. case ET_RESUME_GENERATOR: _generator(closure)->Resume(this, outres); ci->_root = SQTrue; traps += ci->_etraps; break;
  823. case ET_RESUME_VM:
  824. case ET_RESUME_THROW_VM:
  825. traps = _suspended_traps;
  826. ci->_root = _suspended_root;
  827. _suspended = SQFalse;
  828. if(et == ET_RESUME_THROW_VM) { SQ_THROW(); }
  829. break;
  830. }
  831. exception_restore:
  832. #ifdef SQ_JIT_LLVM
  833. try
  834. {
  835. sq_jit_func_type funcPtr = (sq_jit_func_type)_sharedstate->GetJitEngine().GetExecEngine()->getPointerToFunction(
  836. _closure(closure)->_function->_jitfunction);
  837. CallingContext context =
  838. {
  839. this,
  840. _closure(closure)->_function,
  841. &traps,
  842. &outres,
  843. false,
  844. true,
  845. };
  846. funcPtr(&context);
  847. if(context.Suspend)
  848. {
  849. return true;
  850. }
  851. else
  852. {
  853. return context.ReturnValue ? true : false;
  854. }
  855. }
  856. catch(const sqrt_exception& ex) //FIXME: Give a specific exception type
  857. {
  858. }
  859. #else
  860. //
  861. {
  862. for(;;)
  863. {
  864. //if the last instruction was a call then check for release hooks
  865. //obs.: changing the order of comparison bellow with gcc makes the code slower
  866. #ifdef PROFILE_SQVM
  867. OpProfile &opp_last = _op_profile[ci->_ip->op];
  868. _op_profile_timer.stop();
  869. opp_last.total_time += _op_profile_timer.getElapsedTimeInMicroSec();
  870. _op_profile_timer.start();
  871. #endif
  872. const SQInstruction &_i_ = *ci->_ip++;
  873. //dumpstack(_stackbase);
  874. //scprintf("\n[%d] %s %d %d %d %d\n",ci->_ip-ci->_iv->_vals,g_InstrDesc[_i_.op].name,arg0,arg1,arg2,arg3);
  875. #ifdef PROFILE_SQVM
  876. OpProfile &opp = _op_profile[_i_.op];
  877. ++opp.count;
  878. #endif
  879. CALL_OPCODE(_i_.op)
  880. {
  881. OPCODE_TARGET(LINE) { if (_debughook) CallDebugHook(_SC('l'),arg1); continue;}
  882. OPCODE_TARGET(LOAD) { TARGET = ci->_literals[arg1]; continue;}
  883. OPCODE_TARGET(LOADINT) {
  884. #ifdef _SQ64
  885. TARGET = (SQInteger)((SQUnsignedInteger32)arg1);
  886. #else
  887. TARGET = (SQInteger)arg1;
  888. #endif
  889. continue;
  890. }
  891. OPCODE_TARGET(LOADFLOAT) {
  892. #ifdef _SQ64
  893. TARGET = *((SQFloat32*)&arg1);
  894. #else
  895. TARGET = *((SQFloat32*)&arg1);
  896. #endif
  897. continue;
  898. }
  899. OPCODE_TARGET(DLOAD) { TARGET = ci->_literals[arg1]; STK(arg2) = ci->_literals[arg3];continue;}
  900. OPCODE_TARGET(TAILCALL) {
  901. SQObjectPtr &t = STK(arg1);
  902. if (sq_type(t) == OT_CLOSURE
  903. && (!_closure(t)->_function->_bgenerator)){
  904. SQObjectPtr clo = t;
  905. SQInteger last_top = _top;
  906. if(_openouters) CloseOuters(&(_stack._vals[_stackbase]));
  907. for (SQInteger i = 0; i < arg3; i++) STK(i) = STK(arg2 + i);
  908. _GUARD(StartCall(_closure(clo), ci->_target, arg3, _stackbase, true));
  909. if (last_top >= _top) _top = last_top;
  910. continue;
  911. }
  912. }
  913. OPCODE_TARGET(CALL) {
  914. SQObjectPtr clo = STK(arg1);
  915. int tgt0 = arg0 == 255 ? -1 : arg0;
  916. switch (sq_type(clo)) {
  917. case OT_CLOSURE:
  918. _GUARD(StartCall(_closure(clo), tgt0, arg3, _stackbase+arg2, false));
  919. continue;
  920. case OT_NATIVECLOSURE: {
  921. bool suspend;
  922. bool tailcall;
  923. _GUARD(CallNative(_nativeclosure(clo), arg3, _stackbase+arg2, clo, tgt0, suspend, tailcall));
  924. #ifdef SQ_WITH_DELAYED_RELEASE_HOOKS
  925. if(_check_delayed_relase_hooks) _sharedstate->CallDelayedReleaseHooks(this);
  926. #endif
  927. if(suspend){
  928. _suspended = SQTrue;
  929. _suspended_target = tgt0;
  930. _suspended_root = ci->_root;
  931. _suspended_traps = traps;
  932. outres = clo;
  933. return true;
  934. }
  935. if((tgt0 != -1) && !tailcall) {
  936. STK(tgt0) = clo;
  937. }
  938. }
  939. continue;
  940. case OT_CLASS:{
  941. SQObjectPtr inst;
  942. _GUARD(CreateClassInstance(_class(clo),inst,clo));
  943. if(tgt0 != -1) {
  944. STK(tgt0) = inst;
  945. }
  946. SQInteger stkbase;
  947. switch(sq_type(clo)) {
  948. case OT_CLOSURE:
  949. stkbase = _stackbase+arg2;
  950. _stack._vals[stkbase] = inst;
  951. _GUARD(StartCall(_closure(clo), -1, arg3, stkbase, false));
  952. break;
  953. case OT_NATIVECLOSURE:
  954. bool dummy;
  955. stkbase = _stackbase+arg2;
  956. _stack._vals[stkbase] = inst;
  957. _GUARD(CallNative(_nativeclosure(clo), arg3, stkbase, clo, -1, dummy, dummy));
  958. break;
  959. default: break; //shutup GCC 4.x
  960. }
  961. }
  962. break;
  963. case OT_TABLE:
  964. case OT_USERDATA:
  965. case OT_INSTANCE:{
  966. SQObjectPtr mclosure;
  967. if(_delegable(clo)->_delegate && _delegable(clo)->GetMetaMethod(this,MT_CALL,mclosure)) {
  968. Push(clo);
  969. for (SQInteger i = 0; i < arg3; i++) Push(STK(arg2 + i));
  970. if(!CallMetaMethod(mclosure, MT_CALL, arg3+1, clo)) SQ_THROW();
  971. if(tgt0 != -1) {
  972. STK(tgt0) = clo;
  973. }
  974. break;
  975. }
  976. //Raise_Error(_SC("attempt to call '%s'"), GetTypeName(clo));
  977. //SQ_THROW();
  978. }
  979. default:
  980. Raise_Error(_SC("attempt to call '%s' [%s]"), GetTypeName(clo),
  981. sq_type(clo) == OT_STRING ? _stringval(clo) : "");
  982. SQ_THROW();
  983. }
  984. }
  985. continue;
  986. OPCODE_TARGET(PREPCALL)
  987. OPCODE_TARGET(PREPCALLK) {
  988. SQObjectPtr &key = _i_.op == _OP_PREPCALLK?(ci->_literals)[arg1]:STK(arg1);
  989. SQObjectPtr &o = STK(arg2);
  990. if (!Get(o, key, temp_reg,false,arg2)) {
  991. SQ_THROW();
  992. }
  993. STK(arg3) = o;
  994. _Swap(TARGET,temp_reg);//TARGET = temp_reg;
  995. }
  996. continue;
  997. OPCODE_TARGET(GETK) {
  998. #ifndef NO_EXCEPTION_KEY_NOT_FOUND
  999. if (!Get(STK(arg2), ci->_literals[arg1], temp_reg, false,arg2)) { SQ_THROW();}
  1000. #else
  1001. //DAD instead of throw an exception return null
  1002. if(!Get(STK(arg2), ci->_literals[arg1], temp_reg, false,arg2)) temp_reg.Null();
  1003. #endif
  1004. _Swap(TARGET,temp_reg);//TARGET = temp_reg;
  1005. continue;}
  1006. OPCODE_TARGET(MOVE) { TARGET = STK(arg1); continue;}
  1007. OPCODE_TARGET(NEWSLOT) {
  1008. _GUARD(NewSlot(STK(arg1), STK(arg2), STK(arg3),false));
  1009. if(arg0 != 0xFF) TARGET = STK(arg3);
  1010. continue;}
  1011. OPCODE_TARGET(DELETE) { _GUARD(DeleteSlot(STK(arg1), STK(arg2), TARGET)); continue;}
  1012. OPCODE_TARGET(SET) {
  1013. if (!Set(STK(arg1), STK(arg2), STK(arg3),arg1)) { SQ_THROW(); }
  1014. if (arg0 != 0xFF) TARGET = STK(arg3);
  1015. continue;}
  1016. OPCODE_TARGET(GET) {
  1017. if (!Get(STK(arg1), STK(arg2), temp_reg, false,arg1)) { SQ_THROW(); }
  1018. _Swap(TARGET,temp_reg);//TARGET = temp_reg;
  1019. continue;}
  1020. OPCODE_TARGET(EQ) {
  1021. TARGET = IsEqualDeep(STK(arg2),COND_LITERAL)?true:false;
  1022. continue;}
  1023. OPCODE_TARGET(EQI) {
  1024. TARGET = IsEqualIdentity(STK(arg2),COND_LITERAL)?true:false;
  1025. continue;}
  1026. OPCODE_TARGET(NE) {
  1027. TARGET = (!IsEqual(STK(arg2),COND_LITERAL))?true:false;
  1028. continue;}
  1029. OPCODE_TARGET(NEI) {
  1030. TARGET = (!IsEqualIdentity(STK(arg2),COND_LITERAL))?true:false;
  1031. continue;}
  1032. OPCODE_TARGET(NOP) {continue;}
  1033. OPCODE_TARGET(ADD) { _ARITH_(+,TARGET,STK(arg2),STK(arg1)); continue;}
  1034. OPCODE_TARGET(SUB) { _ARITH_(-,TARGET,STK(arg2),STK(arg1)); continue;}
  1035. OPCODE_TARGET(MUL) { _ARITH_(*,TARGET,STK(arg2),STK(arg1)); continue;}
  1036. OPCODE_TARGET(DIV) { _ARITH_NOZERO(/,TARGET,STK(arg2),STK(arg1),_SC("division by zero")); continue;}
  1037. OPCODE_TARGET(MOD) { ARITH_OP('%',TARGET,STK(arg2),STK(arg1)); continue;}
  1038. OPCODE_TARGET(BITW) { _GUARD(BW_OP( arg3,TARGET,STK(arg2),STK(arg1))); continue;}
  1039. OPCODE_TARGET(RETURN) {
  1040. if((ci)->_generator) {
  1041. (ci)->_generator->Kill();
  1042. }
  1043. if(Return(arg0, arg1, temp_reg)){
  1044. assert(traps==0);
  1045. //outres = temp_reg;
  1046. _Swap(outres,temp_reg);
  1047. return true;
  1048. }
  1049. continue;}
  1050. OPCODE_TARGET(LOADNULLS) { for(SQInt32 n=0; n < arg1; n++) STK(arg0+n).Null(); }continue;
  1051. OPCODE_TARGET(LOADROOT) { TARGET = _roottable; continue;}
  1052. OPCODE_TARGET(LOADBOOL) { TARGET = arg1?true:false; continue;}
  1053. OPCODE_TARGET(DMOVE) { STK(arg0) = STK(arg1); STK(arg2) = STK(arg3); continue;}
  1054. OPCODE_TARGET(JMP) { ci->_ip += (sarg1); continue;}
  1055. //OPCODE_TARGET(JNZ) { if(!IsFalse(STK(arg0))) ci->_ip+=(sarg1); continue;
  1056. OPCODE_TARGET(JCMP) {
  1057. _GUARD(CMP_OP((CmpOP)arg3,STK(arg2),STK(arg0),temp_reg));
  1058. if(IsFalse(temp_reg)) ci->_ip+=(sarg1);
  1059. continue;}
  1060. OPCODE_TARGET(JZ) { if(IsFalse(STK(arg0))) ci->_ip+=(sarg1); continue;}
  1061. OPCODE_TARGET(GETOUTER) {
  1062. SQClosure *cur_cls = _closure(ci->_closure);
  1063. SQOuter *otr = _outer(cur_cls->_outervalues[arg1]);
  1064. TARGET = *(otr->_valptr);
  1065. }
  1066. continue;
  1067. OPCODE_TARGET(SETOUTER) {
  1068. SQClosure *cur_cls = _closure(ci->_closure);
  1069. SQOuter *otr = _outer(cur_cls->_outervalues[arg1]);
  1070. *(otr->_valptr) = STK(arg2);
  1071. if(arg0 != 0xFF) {
  1072. TARGET = STK(arg2);
  1073. }
  1074. }
  1075. continue;
  1076. OPCODE_TARGET(NEWOBJ) {
  1077. switch(arg3) {
  1078. case NOT_TABLE: TARGET = SQTable::Create(_ss(this), arg1); continue;
  1079. case NOT_ARRAY: TARGET = SQArray::Create(_ss(this), 0); _array(TARGET)->Reserve(arg1); continue;
  1080. case NOT_CLASS: _GUARD(CLASS_OP(TARGET,arg1,arg2)); continue;
  1081. default: assert(0); continue;
  1082. }}
  1083. OPCODE_TARGET(APPENDARRAY) {
  1084. {
  1085. SQObject val;
  1086. val._unVal.raw = 0;
  1087. switch(arg2) {
  1088. case AAT_STACK:
  1089. val = STK(arg1); break;
  1090. case AAT_LITERAL:
  1091. val = ci->_literals[arg1]; break;
  1092. case AAT_INT:
  1093. val._type = OT_INTEGER;
  1094. #ifdef _SQ64
  1095. val._unVal.nInteger = (SQInteger)((SQUnsignedInteger32)arg1);
  1096. #else
  1097. val._unVal.nInteger = (SQInteger)arg1;
  1098. #endif
  1099. break;
  1100. case AAT_FLOAT:
  1101. val._type = OT_FLOAT;
  1102. #ifdef _SQ64
  1103. val._unVal.fFloat = *((SQFloat32 *)&arg1);
  1104. #else
  1105. val._unVal.fFloat = *((SQFloat *)&arg1);
  1106. #endif
  1107. break;
  1108. case AAT_BOOL:
  1109. val._type = OT_BOOL;
  1110. val._unVal.nInteger = arg1;
  1111. break;
  1112. default: assert(0); break;
  1113. }
  1114. if(!_array(STK(arg0))->Append(val))
  1115. {Raise_Error(_SC("error appending")); SQ_THROW();}
  1116. continue;
  1117. }}
  1118. OPCODE_TARGET(COMPARITH) {
  1119. SQInteger selfidx = (((SQUnsignedInteger)arg1&0xFFFF0000)>>16);
  1120. _GUARD(DerefInc(arg3, TARGET, STK(selfidx), STK(arg2), STK(arg1&0x0000FFFF), false, selfidx));
  1121. }
  1122. continue;
  1123. OPCODE_TARGET(INC) {SQObjectPtr o(sarg3); _GUARD(DerefInc('+',TARGET, STK(arg1), STK(arg2), o, false, arg1));} continue;
  1124. OPCODE_TARGET(INCL) {
  1125. SQObjectPtr &a = STK(arg1);
  1126. if(sq_type(a) == OT_INTEGER) {
  1127. a._unVal.nInteger = _integer(a) + sarg3;
  1128. }
  1129. else {
  1130. SQObjectPtr o(sarg3); //_GUARD(LOCAL_INC('+',TARGET, STK(arg1), o));
  1131. _ARITH_(+,a,a,o);
  1132. }
  1133. } continue;
  1134. OPCODE_TARGET(PINC) {SQObjectPtr o(sarg3); _GUARD(DerefInc('+',TARGET, STK(arg1), STK(arg2), o, true, arg1));} continue;
  1135. OPCODE_TARGET(PINCL) {
  1136. SQObjectPtr &a = STK(arg1);
  1137. if(sq_type(a) == OT_INTEGER) {
  1138. TARGET = a;
  1139. a._unVal.nInteger = _integer(a) + sarg3;
  1140. }
  1141. else {
  1142. SQObjectPtr o(sarg3); _GUARD(PLOCAL_INC('+',TARGET, STK(arg1), o));
  1143. }
  1144. } continue;
  1145. OPCODE_TARGET(CMP) { _GUARD(CMP_OP((CmpOP)arg3,STK(arg2),STK(arg1),TARGET)) continue;}
  1146. OPCODE_TARGET(EXISTS) { TARGET = Get(STK(arg1), STK(arg2), temp_reg, true,EXISTS_FALL_BACK);continue;}
  1147. OPCODE_TARGET(INSTANCEOF) {
  1148. if(sq_type(STK(arg1)) != OT_CLASS)
  1149. {Raise_Error(_SC("cannot apply instanceof between a %s and a %s"),GetTypeName(STK(arg1)),GetTypeName(STK(arg2))); SQ_THROW();}
  1150. TARGET = (sq_type(STK(arg2)) == OT_INSTANCE) ? (_instance(STK(arg2))->InstanceOf(_class(STK(arg1)))?true:false) : false;
  1151. continue;}
  1152. OPCODE_TARGET(AND) {
  1153. if(IsFalse(STK(arg2))) {
  1154. TARGET = STK(arg2);
  1155. ci->_ip += (sarg1);
  1156. }
  1157. continue;}
  1158. OPCODE_TARGET(OR) {
  1159. if(!IsFalse(STK(arg2))) {
  1160. TARGET = STK(arg2);
  1161. ci->_ip += (sarg1);
  1162. }
  1163. continue;}
  1164. OPCODE_TARGET(NEG) { _GUARD(NEG_OP(TARGET,STK(arg1))); continue;}
  1165. OPCODE_TARGET(NOT) { TARGET = IsFalse(STK(arg1)); continue;}
  1166. OPCODE_TARGET(BWNOT) {
  1167. if(sq_type(STK(arg1)) == OT_INTEGER) {
  1168. SQInteger t = _integer(STK(arg1));
  1169. TARGET = SQInteger(~t);
  1170. continue;
  1171. }
  1172. Raise_Error(_SC("attempt to perform a bitwise op on a %s"), GetTypeName(STK(arg1)));
  1173. SQ_THROW();}
  1174. OPCODE_TARGET(CLOSURE) {
  1175. SQClosure *c = ci->_closure._unVal.pClosure;
  1176. SQFunctionProto *fp = c->_function;
  1177. if(!CLOSURE_OP(TARGET,fp->_functions[arg1]._unVal.pFunctionProto)) { SQ_THROW(); }
  1178. continue;
  1179. }
  1180. OPCODE_TARGET(YIELD) {
  1181. if(ci->_generator) {
  1182. if(sarg1 != MAX_FUNC_STACKSIZE) temp_reg = STK(arg1);
  1183. _GUARD(ci->_generator->Yield(this,arg2));
  1184. traps -= ci->_etraps;
  1185. if(sarg1 != MAX_FUNC_STACKSIZE) _Swap(STK(arg1),temp_reg);//STK(arg1) = temp_reg;
  1186. }
  1187. else { Raise_Error(_SC("trying to yield a '%s',only genenerator can be yielded"), GetTypeName(ci->_generator)); SQ_THROW();}
  1188. if(Return(arg0, arg1, temp_reg)){
  1189. assert(traps == 0);
  1190. outres = temp_reg;
  1191. return true;
  1192. }
  1193. }
  1194. continue;
  1195. OPCODE_TARGET(RESUME) {
  1196. if(sq_type(STK(arg1)) != OT_GENERATOR){ Raise_Error(_SC("trying to resume a '%s',only genenerator can be resumed"), GetTypeName(STK(arg1))); SQ_THROW();}
  1197. _GUARD(_generator(STK(arg1))->Resume(this, TARGET));
  1198. traps += ci->_etraps;
  1199. continue;}
  1200. OPCODE_TARGET(FOREACH) { int tojump;
  1201. _GUARD(FOREACH_OP(STK(arg0),STK(arg2),STK(arg2+1),STK(arg2+2),arg2,sarg1,tojump));
  1202. ci->_ip += tojump; }
  1203. continue;
  1204. OPCODE_TARGET(POSTFOREACH) {
  1205. assert(sq_type(STK(arg0)) == OT_GENERATOR);
  1206. if(_generator(STK(arg0))->_state == SQGenerator::eDead)
  1207. ci->_ip += (sarg1 - 1);
  1208. continue;}
  1209. OPCODE_TARGET(CLONE) { _GUARD(Clone(STK(arg1), TARGET)); continue;}
  1210. OPCODE_TARGET(TYPEOF) { _GUARD(TypeOf(STK(arg1), TARGET)) continue;}
  1211. OPCODE_TARGET(PUSHTRAP) {
  1212. SQInstruction *_iv = _closure(ci->_closure)->_function->_instructions;
  1213. _etraps.push_back(SQExceptionTrap(_top,_stackbase, &_iv[(ci->_ip-_iv)+arg1], arg0)); traps++;
  1214. ci->_etraps++;
  1215. }
  1216. continue;
  1217. OPCODE_TARGET(POPTRAP) {
  1218. for(SQInteger i = 0; i < arg0; i++) {
  1219. _etraps.pop_back(); traps--;
  1220. ci->_etraps--;
  1221. }
  1222. }
  1223. continue;
  1224. OPCODE_TARGET(THROW) { Raise_Error(TARGET); SQ_THROW(); continue;}
  1225. OPCODE_TARGET(NEWSLOTA) {
  1226. _GUARD(NewSlotA(STK(arg1),STK(arg2),STK(arg3),(arg0&NEW_SLOT_ATTRIBUTES_FLAG) ? STK(arg2-1) : SQObjectPtr(),(arg0&NEW_SLOT_STATIC_FLAG)?true:false,false));
  1227. continue;}
  1228. OPCODE_TARGET(GETBASE) {
  1229. SQClosure *clo = _closure(ci->_closure);
  1230. if(clo->_base) {
  1231. TARGET = clo->_base;
  1232. }
  1233. else {
  1234. TARGET.Null();
  1235. }
  1236. continue;
  1237. }
  1238. OPCODE_TARGET(CLOSE) {
  1239. if(_openouters) CloseOuters(&(STK(arg1)));
  1240. continue;}
  1241. }
  1242. }
  1243. }
  1244. #if defined(__GNUC__) && defined(USE_COMPUTED_GOTOS)
  1245. #pragma GCC pop_options
  1246. #endif
  1247. #endif
  1248. exception_trap:
  1249. {
  1250. sq_stackinfos(this, 0, &_lasterror_stackinfo);
  1251. SQObjectPtr currerror = _lasterror;
  1252. // dumpstack(_stackbase);
  1253. // SQInteger n = 0;
  1254. SQInteger last_top = _top;
  1255. if(_ss(this)->_notifyallexceptions || (!traps && raiseerror)) CallErrorHandler(currerror);
  1256. while( ci ) {
  1257. if(ci->_etraps > 0) {
  1258. SQExceptionTrap &vet = _etraps.top();
  1259. ci->_ip = vet._ip;
  1260. _top = vet._stacksize;
  1261. _stackbase = vet._stackbase;
  1262. _stack._vals[_stackbase + vet._extarget] = currerror;
  1263. _etraps.pop_back(); traps--; ci->_etraps--;
  1264. while(last_top >= _top) _stack._vals[last_top--].Null();
  1265. goto exception_restore;
  1266. }
  1267. else if (_debughook) {
  1268. //notify debugger of a "return"
  1269. //even if it really an exception unwinding the stack
  1270. for(SQInteger i = 0; i < ci->_ncalls; i++) {
  1271. CallDebugHook(_SC('r'));
  1272. }
  1273. }
  1274. if(ci->_generator) ci->_generator->Kill();
  1275. bool mustbreak = ci && ci->_root;
  1276. LeaveFrame();
  1277. if(mustbreak) break;
  1278. }
  1279. _lasterror = currerror;
  1280. return false;
  1281. }
  1282. assert(0);
  1283. return false;
  1284. }
  1285. bool SQVM::CreateClassInstance(SQClass *theclass, SQObjectPtr &inst, SQObjectPtr &constructor)
  1286. {
  1287. inst = theclass->CreateInstance();
  1288. if(!theclass->GetConstructor(constructor)) {
  1289. constructor.Null();
  1290. }
  1291. return true;
  1292. }
  1293. void SQVM::CallErrorHandler(SQObjectPtr &error)
  1294. {
  1295. if(sq_type(_errorhandler) != OT_NULL) {
  1296. SQObjectPtr out;
  1297. Push(_roottable); Push(error);
  1298. Call(_errorhandler, 2, _top-2, out,SQFalse);
  1299. Pop(2);
  1300. }
  1301. }
  1302. void SQVM::CallAtExitHandler()
  1303. {
  1304. if(sq_type(_atexithandler) != OT_NULL) {
  1305. SQObjectPtr out;
  1306. Push(_roottable);
  1307. Call(_atexithandler, 1, _top-1, out,SQFalse);
  1308. Pop(1);
  1309. }
  1310. }
  1311. void SQVM::CallDebugHook(SQInteger type,SQInteger forcedline)
  1312. {
  1313. _debughook = false;
  1314. SQFunctionProto *func=_closure(ci->_closure)->_function;
  1315. if(_debughook_native) {
  1316. const SQChar *src = sq_type(func->_sourcename) == OT_STRING?_stringval(func->_sourcename):NULL;
  1317. const SQChar *fname = sq_type(func->_name) == OT_STRING?_stringval(func->_name):NULL;
  1318. SQInteger line = forcedline?forcedline:func->GetLine(ci->_ip);
  1319. _debughook_native(this,type,src,line,fname);
  1320. }
  1321. else {
  1322. SQObjectPtr creg;
  1323. SQInteger nparams=5;
  1324. Push(_roottable); Push(type); Push(func->_sourcename); Push(forcedline?forcedline:func->GetLine(ci->_ip)); Push(func->_name);
  1325. Call(_debughook_closure,nparams,_top-nparams,creg,SQFalse);
  1326. Pop(nparams);
  1327. }
  1328. _debughook = true;
  1329. }
  1330. bool SQVM::CallNative(SQNativeClosure *nclosure, SQInteger nargs, SQInteger newbase, SQObjectPtr &retval, SQInt32 target, bool &suspend, bool &tailcall)
  1331. {
  1332. SQInteger nparamscheck = nclosure->_nparamscheck;
  1333. SQInteger newtop = newbase + nargs + nclosure->_noutervalues;
  1334. if (_nnativecalls + 1 > MAX_NATIVE_CALLS) {
  1335. Raise_Error(_SC("Native stack overflow"));
  1336. return false;
  1337. }
  1338. if(nparamscheck && (((nparamscheck > 0) && (nparamscheck != nargs)) ||
  1339. ((nparamscheck < 0) && (nargs < (-nparamscheck)))))
  1340. {
  1341. Raise_Error(_SC("wrong number of parameters"));
  1342. return false;
  1343. }
  1344. SQInteger tcs;
  1345. SQIntVec &tc = nclosure->_typecheck;
  1346. if((tcs = tc.size())) {
  1347. for(SQInteger i = 0; i < nargs && i < tcs; i++) {
  1348. if(tc._vals[i] != -1) {
  1349. SQInteger ptype;
  1350. if(i==0 && nclosure->_env) {
  1351. //if nclosure->_env is set then check it instead
  1352. ptype = nclosure->_env->_obj._type;
  1353. }
  1354. else ptype = sq_type(_stack._vals[newbase+i]);
  1355. if(!(ptype & tc._vals[i])) {
  1356. Raise_ParamTypeError(i,tc._vals[i],ptype);
  1357. return false;
  1358. }
  1359. }
  1360. }
  1361. }
  1362. if(!EnterFrame(newbase, newtop, false)) return false;
  1363. ci->_closure = nclosure;
  1364. ci->_target = target;
  1365. SQInteger outers = nclosure->_noutervalues;
  1366. for (SQInteger i = 0; i < outers; i++) {
  1367. _stack._vals[newbase+nargs+i] = nclosure->_outervalues[i];
  1368. }
  1369. if(nclosure->_env) {
  1370. _stack._vals[newbase] = nclosure->_env->_obj;
  1371. }
  1372. _nnativecalls++;
  1373. SQInteger ret = (nclosure->_function)(this);
  1374. _nnativecalls--;
  1375. suspend = false;
  1376. tailcall = false;
  1377. if (ret == SQ_TAILCALL_FLAG) {
  1378. tailcall = true;
  1379. return true;
  1380. }
  1381. else if (ret == SQ_SUSPEND_FLAG) {
  1382. suspend = true;
  1383. }
  1384. else if (ret < 0) {
  1385. LeaveFrame();
  1386. Raise_Error(_lasterror);
  1387. return false;
  1388. }
  1389. if(ret) {
  1390. retval = _stack._vals[_top-1];
  1391. }
  1392. else {
  1393. retval.Null();
  1394. }
  1395. //retval = ret ? _stack._vals[_top-1] : _null_;
  1396. LeaveFrame();
  1397. return true;
  1398. }
  1399. bool SQVM::TailCall(SQClosure *closure, SQInteger parambase,SQInteger nparams)
  1400. {
  1401. SQInteger last_top = _top;
  1402. SQObjectPtr clo = closure;
  1403. if (ci->_root)
  1404. {
  1405. Raise_Error("root calls cannot invoke tailcalls");
  1406. return false;
  1407. }
  1408. for (SQInteger i = 0; i < nparams; i++) STK(i) = STK(parambase + i);
  1409. bool ret = StartCall(closure, ci->_target, nparams, _stackbase, true);
  1410. if (last_top >= _top) {
  1411. _top = last_top;
  1412. }
  1413. return ret;
  1414. }
  1415. #define FALLBACK_OK 0
  1416. #define FALLBACK_NO_MATCH 1
  1417. #define FALLBACK_ERROR 2
  1418. bool SQVM::Get(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest,bool raw, SQInteger selfidx)
  1419. {
  1420. switch(sq_type(self)){
  1421. case OT_TABLE:
  1422. if(_table(self)->Get(key,dest))return true;
  1423. break;
  1424. case OT_ARRAY:
  1425. if(sq_isnumeric(key)) { if(_array(self)->Get(tointeger(key),dest)) { return true; } if(selfidx != EXISTS_FALL_BACK) Raise_IdxError(key); return false; }
  1426. break;
  1427. case OT_INSTANCE:
  1428. if(_instance(self)->Get(key,dest)) return true;
  1429. break;
  1430. case OT_CLASS:
  1431. if(_class(self)->Get(key,dest)) return true;
  1432. break;
  1433. case OT_STRING:
  1434. if(sq_isnumeric(key)){
  1435. SQInteger n = tointeger(key);
  1436. SQInteger len = _string(self)->_len;
  1437. if (n < 0) { n += len; }
  1438. if (n >= 0 && n < len) {
  1439. dest = SQInteger(_stringval(self)[n]);
  1440. return true;
  1441. }
  1442. if(selfidx != EXISTS_FALL_BACK) Raise_IdxError(key);
  1443. return false;
  1444. }
  1445. break;
  1446. default:
  1447. break; //shut up compiler
  1448. }
  1449. if(!raw) {
  1450. switch(FallBackGet(self,key,dest)) {
  1451. case FALLBACK_OK: return true; //okie
  1452. case FALLBACK_NO_MATCH: break; //keep falling back
  1453. case FALLBACK_ERROR: return false; // the metamethod failed
  1454. }
  1455. if(InvokeDefaultDelegate(self,key,dest)) {
  1456. return true;
  1457. }
  1458. }
  1459. //#ifdef ROOT_FALLBACK
  1460. if(selfidx == 0) {
  1461. if(_table(_roottable)->Get(key,dest)) return true;
  1462. }
  1463. //#endif
  1464. if(selfidx != EXISTS_FALL_BACK) Raise_IdxError(key);
  1465. return false;
  1466. }
  1467. bool SQVM::InvokeDefaultDelegate(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest)
  1468. {
  1469. SQTable *ddel = NULL;
  1470. switch(sq_type(self)) {
  1471. case OT_CLASS: ddel = _class_ddel; break;
  1472. case OT_TABLE: ddel = _table_ddel; break;
  1473. case OT_ARRAY: ddel = _array_ddel; break;
  1474. case OT_STRING: ddel = _string_ddel; break;
  1475. case OT_INSTANCE: ddel = _instance_ddel; break;
  1476. case OT_INTEGER:case OT_FLOAT:case OT_BOOL: ddel = _number_ddel; break;
  1477. case OT_GENERATOR: ddel = _generator_ddel; break;
  1478. case OT_CLOSURE: case OT_NATIVECLOSURE: ddel = _closure_ddel; break;
  1479. case OT_THREAD: ddel = _thread_ddel; break;
  1480. case OT_WEAKREF: ddel = _weakref_ddel; break;
  1481. default: return false;
  1482. }
  1483. return ddel->Get(key,dest);
  1484. }
  1485. SQInteger SQVM::FallBackGet(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &dest)
  1486. {
  1487. switch(sq_type(self)){
  1488. case OT_TABLE:
  1489. case OT_USERDATA:
  1490. //delegation
  1491. if(_delegable(self)->_delegate) {
  1492. if(Get(SQObjectPtr(_delegable(self)->_delegate),key,dest,false,DONT_FALL_BACK)) return FALLBACK_OK;
  1493. }
  1494. else {
  1495. return FALLBACK_NO_MATCH;
  1496. }
  1497. //go through
  1498. case OT_INSTANCE: {
  1499. SQObjectPtr closure;
  1500. if(_delegable(self)->GetMetaMethod(this, MT_GET, closure)) {
  1501. Push(self);Push(key);
  1502. _nmetamethodscall++;
  1503. AutoDec ad(&_nmetamethodscall);
  1504. if(Call(closure, 2, _top - 2, dest, SQFalse)) {
  1505. Pop(2);
  1506. return FALLBACK_OK;
  1507. }
  1508. else {
  1509. Pop(2);
  1510. if(sq_type(_lasterror) != OT_NULL) { //NULL means "clean failure" (not found)
  1511. return FALLBACK_ERROR;
  1512. }
  1513. }
  1514. }
  1515. }
  1516. break;
  1517. default: break;//shutup GCC 4.x
  1518. }
  1519. // no metamethod or no fallback type
  1520. return FALLBACK_NO_MATCH;
  1521. }
  1522. bool SQVM::Set(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,SQInteger selfidx)
  1523. {
  1524. switch(sq_type(self)){
  1525. case OT_TABLE:
  1526. if(_table(self)->Set(key,val)) return true;
  1527. break;
  1528. case OT_CLASS:
  1529. if(_class(self)->Set(key,val)) return true;
  1530. break;
  1531. case OT_INSTANCE:
  1532. if(_instance(self)->Set(key,val)) return true;
  1533. break;
  1534. case OT_ARRAY:
  1535. if(!sq_isnumeric(key)) { Raise_Error(_SC("indexing %s with %s"),GetTypeName(self),GetTypeName(key)); return false; }
  1536. if(!_array(self)->Set(tointeger(key),val)) {
  1537. Raise_IdxError(key);
  1538. return false;
  1539. }
  1540. return true;
  1541. case OT_USERDATA: break; // must fall back
  1542. default:
  1543. Raise_Error(_SC("trying to set '%s'"),GetTypeName(self));
  1544. return false;
  1545. }
  1546. switch(FallBackSet(self,key,val)) {
  1547. case FALLBACK_OK: return true; //okie
  1548. case FALLBACK_NO_MATCH: break; //keep falling back
  1549. case FALLBACK_ERROR: return false; // the metamethod failed
  1550. }
  1551. if(selfidx == 0) {
  1552. if(_table(_roottable)->Set(key,val))
  1553. return true;
  1554. }
  1555. Raise_IdxError(key);
  1556. return false;
  1557. }
  1558. SQInteger SQVM::FallBackSet(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val)
  1559. {
  1560. switch(sq_type(self)) {
  1561. case OT_TABLE:
  1562. if(_table(self)->_delegate) {
  1563. if(Set(_table(self)->_delegate,key,val,DONT_FALL_BACK)) return FALLBACK_OK;
  1564. }
  1565. //keps on going
  1566. case OT_INSTANCE:
  1567. case OT_USERDATA:{
  1568. SQObjectPtr closure;
  1569. SQObjectPtr t;
  1570. if(_delegable(self)->GetMetaMethod(this, MT_SET, closure)) {
  1571. Push(self);Push(key);Push(val);
  1572. _nmetamethodscall++;
  1573. AutoDec ad(&_nmetamethodscall);
  1574. if(Call(closure, 3, _top - 3, t, SQFalse)) {
  1575. Pop(3);
  1576. return FALLBACK_OK;
  1577. }
  1578. else {
  1579. Pop(3);
  1580. if(sq_type(_lasterror) != OT_NULL) { //NULL means "clean failure" (not found)
  1581. return FALLBACK_ERROR;
  1582. }
  1583. }
  1584. }
  1585. }
  1586. break;
  1587. default: break;//shutup GCC 4.x
  1588. }
  1589. // no metamethod or no fallback type
  1590. return FALLBACK_NO_MATCH;
  1591. }
  1592. bool SQVM::Clone(const SQObjectPtr &self,SQObjectPtr &target)
  1593. {
  1594. SQObjectPtr vtemp_reg;
  1595. SQObjectPtr newobj;
  1596. switch(sq_type(self)){
  1597. case OT_TABLE:
  1598. newobj = _table(self)->Clone();
  1599. goto cloned_mt;
  1600. case OT_INSTANCE: {
  1601. newobj = _instance(self)->Clone(_ss(this));
  1602. cloned_mt:
  1603. SQObjectPtr closure;
  1604. if(_delegable(newobj)->_delegate && _delegable(newobj)->GetMetaMethod(this,MT_CLONED,closure)) {
  1605. Push(newobj);
  1606. Push(self);
  1607. if(!CallMetaMethod(closure,MT_CLONED,2,vtemp_reg))
  1608. return false;
  1609. }
  1610. }
  1611. target = newobj;
  1612. return true;
  1613. case OT_ARRAY:
  1614. target = _array(self)->Clone();
  1615. return true;
  1616. case OT_INTEGER:
  1617. case OT_FLOAT:
  1618. case OT_STRING:
  1619. target = self;
  1620. return true;
  1621. default:
  1622. Raise_Error(_SC("cloning a %s"), GetTypeName(self));
  1623. return false;
  1624. }
  1625. }
  1626. bool SQVM::NewSlotA(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,const SQObjectPtr &attrs,bool bstatic,bool raw)
  1627. {
  1628. if(sq_type(self) != OT_CLASS) {
  1629. Raise_Error(_SC("object must be a class"));
  1630. return false;
  1631. }
  1632. SQClass *c = _class(self);
  1633. if(!raw) {
  1634. SQObjectPtr &mm = c->_metamethods[MT_NEWMEMBER];
  1635. if(sq_type(mm) != OT_NULL ) {
  1636. Push(self); Push(key); Push(val);
  1637. Push(attrs);
  1638. Push(bstatic);
  1639. return CallMetaMethod(mm,MT_NEWMEMBER,5,temp_reg);
  1640. }
  1641. }
  1642. if(!NewSlot(self, key, val,bstatic))
  1643. return false;
  1644. if(sq_type(attrs) != OT_NULL) {
  1645. c->SetAttributes(key,attrs);
  1646. }
  1647. return true;
  1648. }
  1649. bool SQVM::NewSlot(const SQObjectPtr &self,const SQObjectPtr &key,const SQObjectPtr &val,bool bstatic)
  1650. {
  1651. if(sq_type(key) == OT_NULL) { Raise_Error(_SC("null cannot be used as index")); return false; }
  1652. switch(sq_type(self)) {
  1653. case OT_TABLE: {
  1654. bool rawcall = true;
  1655. if(_table(self)->_delegate) {
  1656. SQObjectPtr res;
  1657. if(!_table(self)->Get(key,res)) {
  1658. SQObjectPtr closure;
  1659. if(_delegable(self)->_delegate && _delegable(self)->GetMetaMethod(this,MT_NEWSLOT,closure)) {
  1660. Push(self);Push(key);Push(val);
  1661. if(!CallMetaMethod(closure,MT_NEWSLOT,3,res)) {
  1662. return false;
  1663. }
  1664. rawcall = false;
  1665. }
  1666. else {
  1667. rawcall = true;
  1668. }
  1669. }
  1670. }
  1671. if(rawcall) _table(self)->NewSlot(key,val); //cannot fail
  1672. break;}
  1673. case OT_INSTANCE: {
  1674. SQObjectPtr res;
  1675. SQObjectPtr closure;
  1676. if(_delegable(self)->_delegate && _delegable(self)->GetMetaMethod(this,MT_NEWSLOT,closure)) {
  1677. Push(self);Push(key);Push(val);
  1678. if(!CallMetaMethod(closure,MT_NEWSLOT,3,res)) {
  1679. return false;
  1680. }
  1681. break;
  1682. }
  1683. Raise_Error(_SC("class instances do not support the new slot operator"));
  1684. return false;
  1685. break;}
  1686. case OT_CLASS:
  1687. if(!_class(self)->NewSlot(_ss(this),key,val,bstatic)) {
  1688. if(_class(self)->_locked) {
  1689. Raise_Error(_SC("trying to modify a class that has already been instantiated"));
  1690. return false;
  1691. }
  1692. else {
  1693. SQObjectPtr oval = PrintObjVal(key);
  1694. Raise_Error(_SC("the property '%s' already exists"),_stringval(oval));
  1695. return false;
  1696. }
  1697. }
  1698. break;
  1699. default:
  1700. Raise_Error(_SC("indexing %s with %s"),GetTypeName(self),GetTypeName(key));
  1701. return false;
  1702. break;
  1703. }
  1704. return true;
  1705. }
  1706. bool SQVM::DeleteSlot(const SQObjectPtr &self,const SQObjectPtr &key,SQObjectPtr &res)
  1707. {
  1708. switch(sq_type(self)) {
  1709. case OT_TABLE:
  1710. case OT_INSTANCE:
  1711. case OT_USERDATA: {
  1712. SQObjectPtr t;
  1713. //bool handled = false;
  1714. SQObjectPtr closure;
  1715. if(_delegable(self)->_delegate && _delegable(self)->GetMetaMethod(this,MT_DELSLOT,closure)) {
  1716. Push(self);Push(key);
  1717. return CallMetaMethod(closure,MT_DELSLOT,2,res);
  1718. }
  1719. else {
  1720. if(sq_type(self) == OT_TABLE) {
  1721. if(_table(self)->Get(key,t)) {
  1722. _table(self)->Remove(key);
  1723. }
  1724. else {
  1725. Raise_IdxError((SQObject &)key);
  1726. return false;
  1727. }
  1728. }
  1729. else {
  1730. Raise_Error(_SC("cannot delete a slot from %s"),GetTypeName(self));
  1731. return false;
  1732. }
  1733. }
  1734. res = t;
  1735. }
  1736. break;
  1737. default:
  1738. Raise_Error(_SC("attempt to delete a slot from a %s"),GetTypeName(self));
  1739. return false;
  1740. }
  1741. return true;
  1742. }
  1743. bool SQVM::Call(SQObjectPtr &closure,SQInteger nparams,SQInteger stackbase,SQObjectPtr &outres,SQBool raiseerror)
  1744. {
  1745. #ifdef _DEBUG
  1746. SQInteger prevstackbase = _stackbase;
  1747. #endif
  1748. switch(sq_type(closure)) {
  1749. case OT_CLOSURE:
  1750. return Execute(closure, nparams, stackbase, outres, raiseerror);
  1751. break;
  1752. case OT_NATIVECLOSURE:{
  1753. bool dummy;
  1754. return CallNative(_nativeclosure(closure), nparams, stackbase, outres, -1, dummy, dummy);
  1755. }
  1756. break;
  1757. case OT_CLASS: {
  1758. SQObjectPtr constr;
  1759. SQObjectPtr temp;
  1760. CreateClassInstance(_class(closure),outres,constr);
  1761. SQObjectType ctype = sq_type(constr);
  1762. if (ctype == OT_NATIVECLOSURE || ctype == OT_CLOSURE) {
  1763. _stack[stackbase] = outres;
  1764. return Call(constr,nparams,stackbase,temp,raiseerror);
  1765. }
  1766. return true;
  1767. }
  1768. break;
  1769. default:
  1770. return false;
  1771. }
  1772. #ifdef _DEBUG
  1773. if(!_suspended) {
  1774. assert(_stackbase == prevstackbase);
  1775. }
  1776. #endif
  1777. return true;
  1778. }
  1779. bool SQVM::CallMetaMethod(SQObjectPtr &closure,SQMetaMethod /*mm*/,SQInteger nparams,SQObjectPtr &outres)
  1780. {
  1781. //SQObjectPtr closure;
  1782. _nmetamethodscall++;
  1783. if(Call(closure, nparams, _top - nparams, outres, SQFalse)) {
  1784. _nmetamethodscall--;
  1785. Pop(nparams);
  1786. return true;
  1787. }
  1788. _nmetamethodscall--;
  1789. //}
  1790. Pop(nparams);
  1791. return false;
  1792. }
  1793. void SQVM::FindOuter(SQObjectPtr &target, SQObjectPtr *stackindex)
  1794. {
  1795. SQOuter **pp = &_openouters;
  1796. SQOuter *p;
  1797. SQOuter *otr;
  1798. while ((p = *pp) != NULL && p->_valptr >= stackindex) {
  1799. if (p->_valptr == stackindex) {
  1800. target = SQObjectPtr(p);
  1801. return;
  1802. }
  1803. pp = &p->_next_outer;
  1804. }
  1805. otr = SQOuter::Create(_ss(this), stackindex);
  1806. otr->_next_outer = *pp;
  1807. otr->_idx = (stackindex - _stack._vals);
  1808. __ObjAddRef(otr);
  1809. *pp = otr;
  1810. target = SQObjectPtr(otr);
  1811. }
  1812. bool SQVM::EnterFrame(SQInteger newbase, SQInteger newtop, bool tailcall)
  1813. {
  1814. if( !tailcall ) {
  1815. if( _callsstacksize == _alloccallsstacksize ) {
  1816. GrowCallStack();
  1817. }
  1818. ci = &_callsstack[_callsstacksize++];
  1819. ci->_prevstkbase = (SQInt32)(newbase - _stackbase);
  1820. ci->_prevtop = (SQInt32)(_top - _stackbase);
  1821. ci->_etraps = 0;
  1822. ci->_ncalls = 1;
  1823. ci->_generator = NULL;
  1824. ci->_root = SQFalse;
  1825. }
  1826. else {
  1827. ci->_ncalls++;
  1828. }
  1829. _stackbase = newbase;
  1830. _top = newtop;
  1831. if(newtop + MIN_STACK_OVERHEAD > (SQInteger)_stack.size()) {
  1832. if(_nmetamethodscall) {
  1833. Raise_Error(_SC("stack overflow, cannot resize stack while in a metamethod"));
  1834. return false;
  1835. }
  1836. _stack.resize(newtop + (MIN_STACK_OVERHEAD << 2));
  1837. RelocateOuters();
  1838. }
  1839. return true;
  1840. }
  1841. #if 0
  1842. void SQVM::LeaveFrame() {
  1843. SQInteger last_top = _top;
  1844. SQInteger last_stackbase = _stackbase;
  1845. SQInteger css = --_callsstacksize;
  1846. /* First clean out the call stack frame */
  1847. while (last_top >= _top) {
  1848. SQObjectPtr &val = _stack._vals[last_top];
  1849. if(val._type == OT_INSTANCE){
  1850. SQObjectPtr dtor;
  1851. if(_instance(val)->_class->GetDestructor(dtor)){
  1852. SQInteger stkbase;
  1853. switch(sq_type(dtor)) {
  1854. case OT_CLOSURE:
  1855. case OT_NATIVECLOSURE:{
  1856. SQObjectPtr res;
  1857. Push(val);
  1858. Call(dtor, 1, last_top+1, res, SQFalse);
  1859. }
  1860. break;
  1861. default: break; //shutup GCC 4.x
  1862. }
  1863. }
  1864. }
  1865. val.Null();
  1866. --last_top;
  1867. }
  1868. ci->_closure.Null();
  1869. _stackbase -= ci->_prevstkbase;
  1870. _top = _stackbase + ci->_prevtop;
  1871. ci = (css) ? &_callsstack[css-1] : NULL;
  1872. if(_openouters) CloseOuters(&(_stack._vals[last_stackbase]));
  1873. #ifdef SQ_WITH_DELAYED_RELEASE_HOOKS
  1874. if(_check_delayed_relase_hooks) _sharedstate->CallDelayedReleaseHooks(this);
  1875. #endif
  1876. }
  1877. #endif
  1878. void SQVM::LeaveFrame() {
  1879. SQInteger last_top = _top;
  1880. SQInteger last_stackbase = _stackbase;
  1881. SQInteger css = --_callsstacksize;
  1882. /* First clean out the call stack frame */
  1883. ci->_closure.Null();
  1884. _stackbase -= ci->_prevstkbase;
  1885. _top = _stackbase + ci->_prevtop;
  1886. ci = (css) ? &_callsstack[css-1] : NULL;
  1887. if(_openouters) CloseOuters(&(_stack._vals[last_stackbase]));
  1888. while (last_top >= _top) {
  1889. _stack._vals[last_top--].Null();
  1890. }
  1891. }
  1892. void SQVM::RelocateOuters()
  1893. {
  1894. SQOuter *p = _openouters;
  1895. while (p) {
  1896. p->_valptr = _stack._vals + p->_idx;
  1897. p = p->_next_outer;
  1898. }
  1899. }
  1900. void SQVM::CloseOuters(SQObjectPtr *stackindex) {
  1901. SQOuter *p;
  1902. while ((p = _openouters) != NULL && p->_valptr >= stackindex) {
  1903. p->_value = *(p->_valptr);
  1904. p->_valptr = &p->_value;
  1905. _openouters = p->_next_outer;
  1906. __ObjRelease(p);
  1907. }
  1908. }
  1909. #define CALC_PSEUDO_INDEX(n) n = (n >= 0)?n + _stackbase - 1:_top + n
  1910. void SQVM::Remove(SQInteger n) {
  1911. CALC_PSEUDO_INDEX(n);
  1912. for(SQInteger i = n; i < _top; ++i){
  1913. _stack[i] = _stack[i+1];
  1914. }
  1915. _stack[_top].Null();
  1916. _top--;
  1917. }
  1918. void SQVM::Replace(SQInteger n) {
  1919. CALC_PSEUDO_INDEX(n);
  1920. _stack[n] = _stack[_top-1];
  1921. _stack[_top].Null();
  1922. _top--;
  1923. }
  1924. void SQVM::ReplaceAbs(SQInteger n) {
  1925. _stack[n] = _stack[_top-1];
  1926. _stack[_top].Null();
  1927. _top--;
  1928. }
  1929. void SQVM::Insert(SQInteger n) {
  1930. //Todo revise this to emit error message when used with pseudo-index
  1931. if(n < 0) return; //nothing to do with pseudo-index
  1932. n += _stackbase - 1;
  1933. SQObjectPtr &old_top = _stack[_top];
  1934. for(SQInteger i = _top; i > n; --i){
  1935. _stack[i] = _stack[i-1];
  1936. }
  1937. _stack[n] = old_top;
  1938. }
  1939. void SQVM::Pop() {
  1940. _stack[--_top].Null();
  1941. }
  1942. void SQVM::Pop(SQInteger n) {
  1943. for(SQInteger i = 0; i < n; i++){
  1944. _stack[--_top].Null();
  1945. }
  1946. }
  1947. void SQVM::PushNull() { _stack[_top++].Null(); }
  1948. void SQVM::Push(const SQObjectPtr &o) { _stack[_top++] = o; }
  1949. SQObjectPtr &SQVM::Top() { return _stack[_top-1]; }
  1950. SQObjectPtr &SQVM::PopGet() { return _stack[--_top]; }
  1951. SQObjectPtr &SQVM::GetUp(SQInteger n) { return _stack[_top+n]; }
  1952. SQObjectPtr &SQVM::GetAt(SQInteger n) { return _stack[n]; }
  1953. void SQVM::SetIncludePath(const SQChar *s){_include_path = SQString::Create(_ss(this), s);}
  1954. const SQChar *SQVM::GetIncludePath(){return (sq_type(_include_path) == OT_STRING) ? _stringval(_include_path) : NULL;}
  1955. bool SQVM::AddDefined(const SQChar *s){
  1956. SQObjectPtr key = SQString::Create(_ss(this), s);
  1957. SQObjectPtr value;
  1958. return _table(_ss(this)->_defined_names)->NewSlot(key, value);
  1959. };
  1960. void SQVM::RemoveDefined(const SQChar *s){
  1961. SQObjectPtr key = SQString::Create(_ss(this), s);
  1962. _table(_ss(this)->_defined_names)->Remove(key);
  1963. };
  1964. bool SQVM::IsDefined(const SQChar *s){
  1965. SQObjectPtr key = SQString::Create(_ss(this), s);
  1966. return _table(_ss(this)->_defined_names)->Exists(key);
  1967. };
  1968. #ifdef _DEBUG_DUMP
  1969. void SQVM::dumpstack(SQInteger stackbase,bool dumpall)
  1970. {
  1971. SQInteger size=dumpall?_stack.size():_top;
  1972. SQInteger n=0;
  1973. scprintf(_SC("\n>>>>stack dump<<<<\n"));
  1974. CallInfo &ci=_callsstack[_callsstacksize-1];
  1975. scprintf(_SC("IP: %p\n"),ci._ip);
  1976. scprintf(_SC("prev stack base: %d\n"),ci._prevstkbase);
  1977. scprintf(_SC("prev top: %d\n"),ci._prevtop);
  1978. for(SQInteger i=0;i<size;i++){
  1979. SQObjectPtr &obj=_stack[i];
  1980. if(stackbase==i)scprintf(_SC(">"));else scprintf(_SC(" "));
  1981. scprintf(_SC("[" _PRINT_INT_FMT "]:"),n);
  1982. switch(sq_type(obj)){
  1983. case OT_FLOAT: scprintf(_SC("FLOAT %.3f"),_float(obj));break;
  1984. case OT_INTEGER: scprintf(_SC("INTEGER " _PRINT_INT_FMT),_integer(obj));break;
  1985. case OT_BOOL: scprintf(_SC("BOOL %s"),_integer(obj)?"true":"false");break;
  1986. case OT_STRING: scprintf(_SC("STRING %s"),_stringval(obj));break;
  1987. case OT_NULL: scprintf(_SC("NULL")); break;
  1988. case OT_TABLE: scprintf(_SC("TABLE %p[%p]"),_table(obj),_table(obj)->_delegate);break;
  1989. case OT_ARRAY: scprintf(_SC("ARRAY %p"),_array(obj));break;
  1990. case OT_CLOSURE: scprintf(_SC("CLOSURE [%p]"),_closure(obj));break;
  1991. case OT_NATIVECLOSURE: scprintf(_SC("NATIVECLOSURE"));break;
  1992. case OT_USERDATA: scprintf(_SC("USERDATA %p[%p]"),_userdataval(obj),_userdata(obj)->_delegate);break;
  1993. case OT_GENERATOR: scprintf(_SC("GENERATOR %p"),_generator(obj));break;
  1994. case OT_THREAD: scprintf(_SC("THREAD [%p]"),_thread(obj));break;
  1995. case OT_USERPOINTER: scprintf(_SC("USERPOINTER %p"),_userpointer(obj));break;
  1996. case OT_CLASS: scprintf(_SC("CLASS %p"),_class(obj));break;
  1997. case OT_INSTANCE: scprintf(_SC("INSTANCE %p"),_instance(obj));break;
  1998. case OT_WEAKREF: scprintf(_SC("WEAKERF %p"),_weakref(obj));break;
  1999. default:
  2000. assert(0);
  2001. break;
  2002. };
  2003. scprintf(_SC("\n"));
  2004. ++n;
  2005. }
  2006. }
  2007. #endif