sqvm.cpp 56 KB

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