sqvm.cpp 55 KB

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