sqvm.cpp 57 KB

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