sqvm.cpp 59 KB

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