sqvm.cpp 60 KB

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