sqfuncstate.cpp 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677
  1. /*
  2. see copyright notice in squirrel.h
  3. */
  4. #include "sqpcheader.h"
  5. #ifndef NO_COMPILER
  6. #include "sqcompiler.h"
  7. #include "sqstring.h"
  8. #include "sqfuncproto.h"
  9. #include "sqtable.h"
  10. #include "sqopcodes.h"
  11. #include "sqfuncstate.h"
  12. #if __cplusplus >= 201103L
  13. #include <utility>
  14. #define SQCPPMOVE(x) std::move(x)
  15. #else
  16. #define SQCPPMOVE(x) (x)
  17. #endif
  18. #ifdef _DEBUG_DUMP
  19. #define ENUM_OP(a,b) {_SC(#a)},
  20. SQInstructionDesc g_InstrDesc[]={
  21. SQ_OP_CODE_LIST()
  22. };
  23. #undef ENUM_OP
  24. #endif
  25. void SQDumpLiteral(SQObjectPtr &o)
  26. {
  27. switch(sq_type(o)){
  28. case OT_STRING_UTF8:
  29. case OT_STRING: {
  30. int i, len, buf_idx = 0;
  31. #define BUF_SIZE 64
  32. SQChar buf[BUF_SIZE];
  33. SQChar *str = _stringval(o);
  34. scprintf(_SC("\""));
  35. for(i=0, len=_string(o)->_len; i < len; ++i, ++buf_idx) {
  36. if(buf_idx == (BUF_SIZE-1)) {
  37. scprintf(_SC("%*.s"), buf_idx, buf);
  38. buf_idx = 0;
  39. }
  40. switch(str[i])
  41. {
  42. case _SC('\a'):
  43. case _SC('\b'):
  44. case _SC('\t'):
  45. case _SC('\n'):
  46. case _SC('\v'):
  47. case _SC('\f'):
  48. case _SC('\r'):
  49. case _SC('\\'):
  50. case _SC('\"'):
  51. buf[buf_idx++] = _SC('\\');
  52. //falthrough
  53. default:
  54. buf[buf_idx++] = str[i];
  55. }
  56. }
  57. if(buf_idx > 0) scprintf(_SC("%*.s"), buf_idx, buf);
  58. scprintf(_SC("\""));
  59. #undef BUF_SIZE
  60. }
  61. break;
  62. case OT_FLOAT: scprintf(_SC("{%f}"),_float(o));break;
  63. case OT_INTEGER: scprintf(_SC("{") _PRINT_INT_FMT _SC("}"),_integer(o));break;
  64. case OT_BOOL: scprintf(_SC("%s"),_integer(o)?_SC("true"):_SC("false"));break;
  65. default: scprintf(_SC("(%s %p)"),GetTypeName(o),(void*)_rawval(o));break; //shut up compiler
  66. }
  67. }
  68. SQFuncState::SQFuncState(SQSharedState *ss,SQFuncState *parent,CompilerErrorFunc efunc,void *ed):
  69. _returnexp(0),_stacksize(0),_nliterals(0),_parent(parent),_lastline(0),_traps(0),
  70. _outers(0),_optimization(true),_varparams(false),_bgenerator(false),_sharedstate(ss),
  71. _errfunc(efunc),_errtarget(ed),_ss(ss)
  72. {
  73. _literals = SQTable::Create(ss,0);
  74. _strings = SQTable::Create(ss,0);
  75. }
  76. void SQFuncState::Error(const SQChar *err)
  77. {
  78. _errfunc(_errtarget,err);
  79. }
  80. #ifdef _DEBUG_DUMP
  81. void SQFuncState::Dump(SQFunctionProto *func)
  82. {
  83. SQUnsignedInteger n=0,i;
  84. SQInteger si;
  85. scprintf(_SC("SQInstruction sizeof %d\n"),(SQInt32)sizeof(SQInstruction));
  86. scprintf(_SC("SQObject sizeof %d\n"),(SQInt32)sizeof(SQObject));
  87. scprintf(_SC("--------------------------------------------------------------------\n"));
  88. scprintf(_SC("*****FUNCTION [%s]\n"),sq_type(func->_name)==OT_STRING?_stringval(func->_name):_SC("unknown"));
  89. scprintf(_SC("-----LITERALS\n"));
  90. SQObjectPtr refidx,key,val;
  91. SQInteger idx;
  92. SQObjectPtrVec templiterals;
  93. templiterals.resize(_nliterals);
  94. while((idx=_table(_literals)->Next(false,refidx,key,val))!=-1) {
  95. refidx=idx;
  96. templiterals[_integer(val)]=key;
  97. }
  98. for(i=0;i<templiterals.size();i++){
  99. scprintf(_SC("[%d] "),(SQInt32)n);
  100. SQDumpLiteral(templiterals[i]);
  101. scprintf(_SC("\n"));
  102. n++;
  103. }
  104. scprintf(_SC("-----PARAMS\n"));
  105. if(_varparams)
  106. scprintf(_SC("<<VARPARAMS>>\n"));
  107. n=0;
  108. for(i=0;i<_parameters.size();i++){
  109. scprintf(_SC("[%d] "),(SQInt32)n);
  110. SQDumpLiteral(_parameters[i]);
  111. scprintf(_SC("\n"));
  112. n++;
  113. }
  114. scprintf(_SC("-----LOCALS\n"));
  115. for(si=0;si<func->_nlocalvarinfos;si++){
  116. SQLocalVarInfo lvi=func->_localvarinfos[si];
  117. scprintf(_SC("[%d] %s \t%d %d\n"),(SQInt32)lvi._pos,_stringval(lvi._name),(SQInt32)lvi._start_op,(SQInt32)lvi._end_op);
  118. n++;
  119. }
  120. scprintf(_SC("-----LINE INFO\n"));
  121. for(i=0;i<_lineinfos.size();i++){
  122. SQLineInfo li=_lineinfos[i];
  123. scprintf(_SC("op [%d] line [%d] \n"),(SQInt32)li._op,(SQInt32)li._line);
  124. n++;
  125. }
  126. scprintf(_SC("-----dump\n"));
  127. n=0;
  128. for(i=0;i<_instructions.size();i++){
  129. SQInstruction &inst=_instructions[i];
  130. if(inst.op==_OP_LOAD || inst.op==_OP_DLOAD || inst.op==_OP_PREPCALLK || inst.op==_OP_GETK ){
  131. SQInteger lidx = inst._arg1;
  132. scprintf(_SC("[%03d] %15s %d "),(SQInt32)n,g_InstrDesc[inst.op].name,inst._arg0);
  133. if(lidx >= 0xFFFFFFFF)
  134. scprintf(_SC("null"));
  135. else {
  136. SQInteger refidx;
  137. SQObjectPtr val,key,refo;
  138. while(((refidx=_table(_literals)->Next(false,refo,key,val))!= -1) && (_integer(val) != lidx)) {
  139. refo = refidx;
  140. }
  141. SQDumpLiteral(key);
  142. }
  143. if(inst.op != _OP_DLOAD) {
  144. scprintf(_SC(" %d %d \n"),inst._arg2,inst._arg3);
  145. }
  146. else {
  147. scprintf(_SC(" %d "),inst._arg2);
  148. lidx = inst._arg3;
  149. if(lidx >= 0xFFFFFFFF)
  150. scprintf(_SC("null"));
  151. else {
  152. SQInteger refidx;
  153. SQObjectPtr val,key,refo;
  154. while(((refidx=_table(_literals)->Next(false,refo,key,val))!= -1) && (_integer(val) != lidx)) {
  155. refo = refidx;
  156. }
  157. SQDumpLiteral(key);
  158. scprintf(_SC("\n"));
  159. }
  160. }
  161. }
  162. else if(inst.op==_OP_LOADFLOAT) {
  163. scprintf(_SC("[%03d] %15s %d %f %d %d\n"),(SQInt32)n,g_InstrDesc[inst.op].name,inst._arg0,*((SQFloat*)&inst._arg1),inst._arg2,inst._arg3);
  164. }
  165. /* else if(inst.op==_OP_ARITH){
  166. scprintf(_SC("[%03d] %15s %d %d %d %c\n"),(SQInt32)n,g_InstrDesc[inst.op].name,inst._arg0,inst._arg1,inst._arg2,inst._arg3);
  167. }*/
  168. else {
  169. scprintf(_SC("[%03d] %15s %d %d %d %d\n"),(SQInt32)n,g_InstrDesc[inst.op].name,inst._arg0,inst._arg1,inst._arg2,inst._arg3);
  170. }
  171. n++;
  172. }
  173. scprintf(_SC("-----\n"));
  174. scprintf(_SC("stack size[%d]\n"),(SQInt32)func->_stacksize);
  175. scprintf(_SC("--------------------------------------------------------------------\n\n"));
  176. }
  177. #endif
  178. SQInteger SQFuncState::GetNumericConstant(const SQInteger cons)
  179. {
  180. return GetConstant(SQObjectPtr(cons));
  181. }
  182. SQInteger SQFuncState::GetNumericConstant(const SQFloat cons)
  183. {
  184. return GetConstant(SQObjectPtr(cons));
  185. }
  186. SQInteger SQFuncState::GetConstant(const SQObject &cons)
  187. {
  188. SQObjectPtr val;
  189. if(!_table(_literals)->Get(cons,val))
  190. {
  191. val = _nliterals;
  192. _table(_literals)->NewSlot(cons,val);
  193. _nliterals++;
  194. if(_nliterals > MAX_LITERALS) {
  195. val.Null();
  196. Error(_SC("internal compiler error: too many literals"));
  197. }
  198. }
  199. return _integer(val);
  200. }
  201. void SQFuncState::SetInstructionParams(SQInteger pos,SQInteger arg0,SQInteger arg1,SQInteger arg2,SQInteger arg3)
  202. {
  203. _instructions[pos]._arg0=(unsigned char)*((SQUnsignedInteger *)&arg0);
  204. _instructions[pos]._arg1=(SQInt32)*((SQUnsignedInteger *)&arg1);
  205. _instructions[pos]._arg2=(unsigned char)*((SQUnsignedInteger *)&arg2);
  206. _instructions[pos]._arg3=(unsigned char)*((SQUnsignedInteger *)&arg3);
  207. }
  208. void SQFuncState::SetInstructionParam(SQInteger pos,SQInteger arg,SQInteger val)
  209. {
  210. switch(arg){
  211. case 0:_instructions[pos]._arg0=(unsigned char)*((SQUnsignedInteger *)&val);break;
  212. case 1:case 4:_instructions[pos]._arg1=(SQInt32)*((SQUnsignedInteger *)&val);break;
  213. case 2:_instructions[pos]._arg2=(unsigned char)*((SQUnsignedInteger *)&val);break;
  214. case 3:_instructions[pos]._arg3=(unsigned char)*((SQUnsignedInteger *)&val);break;
  215. };
  216. }
  217. SQInteger SQFuncState::AllocStackPos()
  218. {
  219. SQInteger npos=_vlocals.size();
  220. _vlocals.push_back(SQLocalVarInfo());
  221. if(_vlocals.size()>((SQUnsignedInteger)_stacksize)) {
  222. if(_stacksize>MAX_FUNC_STACKSIZE) Error(_SC("internal compiler error: too many locals"));
  223. _stacksize=_vlocals.size();
  224. }
  225. return npos;
  226. }
  227. SQInteger SQFuncState::PushTarget(SQInteger n)
  228. {
  229. if(n!=-1){
  230. _targetstack.push_back(n);
  231. return n;
  232. }
  233. n=AllocStackPos();
  234. _targetstack.push_back(n);
  235. return n;
  236. }
  237. SQInteger SQFuncState::GetUpTarget(SQInteger n){
  238. return _targetstack[((_targetstack.size()-1)-n)];
  239. }
  240. SQInteger SQFuncState::TopTarget(){
  241. return _targetstack.back();
  242. }
  243. SQInteger SQFuncState::PopTarget()
  244. {
  245. SQUnsignedInteger npos=_targetstack.back();
  246. assert(npos < _vlocals.size());
  247. SQLocalVarInfo &t = _vlocals[npos];
  248. if(sq_type(t._name)==OT_NULL){
  249. _vlocals.pop_back();
  250. }
  251. _targetstack.pop_back();
  252. return npos;
  253. }
  254. SQInteger SQFuncState::GetStackSize()
  255. {
  256. return _vlocals.size();
  257. }
  258. SQInteger SQFuncState::CountOuters(SQInteger stacksize)
  259. {
  260. SQInteger outers = 0;
  261. SQInteger k = _vlocals.size() - 1;
  262. while(k >= stacksize) {
  263. SQLocalVarInfo &lvi = _vlocals[k];
  264. k--;
  265. if(lvi._end_op == UINT_MINUS_ONE) { //this means is an outer
  266. outers++;
  267. }
  268. }
  269. return outers;
  270. }
  271. void SQFuncState::SetStackSize(SQInteger n)
  272. {
  273. SQInteger size=_vlocals.size();
  274. while(size>n){
  275. size--;
  276. SQLocalVarInfo lvi = _vlocals.back();
  277. if(sq_type(lvi._name)!=OT_NULL){
  278. if(lvi._end_op == UINT_MINUS_ONE) { //this means is an outer
  279. _outers--;
  280. }
  281. lvi._end_op = GetCurrentPos();
  282. _localvarinfos.push_back(lvi);
  283. }
  284. _vlocals.pop_back();
  285. }
  286. }
  287. bool SQFuncState::IsConstant(const SQObject &name,SQObject &e)
  288. {
  289. SQObjectPtr val;
  290. if(_table(_sharedstate->_consts)->Get(name,val)) {
  291. e = val;
  292. return true;
  293. }
  294. return false;
  295. }
  296. bool SQFuncState::IsLocal(SQUnsignedInteger stkpos)
  297. {
  298. if(stkpos>=_vlocals.size())return false;
  299. else if(sq_type(_vlocals[stkpos]._name)!=OT_NULL)return true;
  300. return false;
  301. }
  302. SQInteger SQFuncState::PushLocalVariable(const SQObject &name, SQInteger scope, SQInteger type)
  303. {
  304. SQInteger pos=_vlocals.size();
  305. SQLocalVarInfo lvi;
  306. lvi._name=name;
  307. lvi._start_op=GetCurrentPos()+1;
  308. lvi._pos=_vlocals.size();
  309. lvi._scope=scope;
  310. lvi._type=type;
  311. _vlocals.push_back(lvi);
  312. if(_vlocals.size()>((SQUnsignedInteger)_stacksize))_stacksize=_vlocals.size();
  313. //printf("%d %d %d %d %d %s\n", __LINE__, scope, type, pos, lvi._start_op, _stringval(lvi._name));
  314. return pos;
  315. }
  316. SQInteger SQFuncState::GetLocalVariable(const SQObject &name)
  317. {
  318. SQInteger locals=_vlocals.size();
  319. while(locals>=1){
  320. SQLocalVarInfo &lvi = _vlocals[locals-1];
  321. if(sq_type(lvi._name)==OT_STRING && _string(lvi._name)==_string(name)){
  322. return locals-1;
  323. }
  324. locals--;
  325. }
  326. return -1;
  327. }
  328. void SQFuncState::MarkLocalAsOuter(SQInteger pos)
  329. {
  330. SQLocalVarInfo &lvi = _vlocals[pos];
  331. lvi._end_op = UINT_MINUS_ONE;
  332. _outers++;
  333. }
  334. SQInteger SQFuncState::FindOuterVariable(const SQObject &name)
  335. {
  336. SQInteger pos=-1;
  337. if(_parent) {
  338. pos = _parent->GetLocalVariable(name);
  339. if(pos == -1) {
  340. pos = _parent->FindOuterVariable(name);
  341. }
  342. }
  343. return pos;
  344. }
  345. SQInteger SQFuncState::GetOuterVariable(const SQObject &name)
  346. {
  347. SQInteger outers = _outervalues.size();
  348. for(SQInteger i = 0; i<outers; i++) {
  349. if(_string(_outervalues[i]._name) == _string(name))
  350. return i;
  351. }
  352. SQInteger pos=-1;
  353. if(_parent) {
  354. pos = _parent->GetLocalVariable(name);
  355. if(pos == -1) {
  356. pos = _parent->GetOuterVariable(name);
  357. if(pos != -1) {
  358. _outervalues.push_back(SQOuterVar(name,SQObjectPtr(SQInteger(pos)),otOUTER)); //local
  359. return _outervalues.size() - 1;
  360. }
  361. }
  362. else {
  363. _parent->MarkLocalAsOuter(pos);
  364. _outervalues.push_back(SQOuterVar(name,SQObjectPtr(SQInteger(pos)),otLOCAL)); //local
  365. return _outervalues.size() - 1;
  366. }
  367. }
  368. return -1;
  369. }
  370. SQInteger SQFuncState::AddParameter(const SQObject &name, SQInteger scope, SQInteger type)
  371. {
  372. SQInteger rc = PushLocalVariable(name, scope, type);
  373. if(rc < 0) return rc;
  374. _parameters.push_back(name);
  375. return rc;
  376. }
  377. void SQFuncState::AddParameterTypeName(const SQObject &type_name)
  378. {
  379. _vlocals.top()._type_name = type_name;
  380. }
  381. void SQFuncState::AddParameterTypeName(const SQChar *type_name)
  382. {
  383. if(type_name) AddParameterTypeName(CreateString(type_name, scstrlen(type_name)));
  384. }
  385. void SQFuncState::SetReturnTypeName(const SQChar *type_name)
  386. {
  387. if(type_name) _return_type = CreateString(type_name, scstrlen(type_name));
  388. }
  389. SQInteger SQFuncState::FindGotoTarget(const SQObject &name)
  390. {
  391. for(size_t i=0, len=_gototargets.size(); i < len; ++i){
  392. if(_string(_gototargets[i].name) == _string(name)) return i;
  393. }
  394. return -1;
  395. }
  396. bool SQFuncState::AddGotoTarget(const SQObject &name, SQInteger line, SQInteger traps, SQInteger nested)
  397. {
  398. if(FindGotoTarget(name) >= 0) return false;
  399. SQGotoLabelsInfo info;
  400. //GetConstant(name);
  401. info.name = name;
  402. info.pos = GetCurrentPos();
  403. info.line = line;
  404. info.traps = traps;
  405. info.nested = nested;
  406. _gototargets.push_back(info);
  407. return true;
  408. }
  409. void SQFuncState::AddLineInfos(SQInteger line,bool lineop,bool force)
  410. {
  411. if(_lastline!=line || force){
  412. SQLineInfo li;
  413. li._line=line;li._op=(GetCurrentPos()+1);
  414. if(lineop)AddInstruction(_OP_LINE,0,line);
  415. if(_lastline!=line) {
  416. _lineinfos.push_back(li);
  417. }
  418. _lastline=line;
  419. }
  420. }
  421. void SQFuncState::DiscardTarget()
  422. {
  423. SQInteger discardedtarget = PopTarget();
  424. SQInteger size = _instructions.size();
  425. if(size > 0 && _optimization){
  426. SQInstruction &pi = _instructions[size-1];//previous instruction
  427. switch(pi.op) {
  428. case _OP_SET:case _OP_NEWSLOT:case _OP_SETOUTER:case _OP_CALL:
  429. if(pi._arg0 == discardedtarget) {
  430. pi._arg0 = 0xFF;
  431. }
  432. }
  433. }
  434. }
  435. void SQFuncState::AddInstruction(SQInstruction &i)
  436. {
  437. SQInteger size = _instructions.size();
  438. if(size > 0 && _optimization){ //simple optimizer
  439. SQInstruction &pi = _instructions[size-1];//previous instruction
  440. switch(i.op) {
  441. case _OP_JZ:
  442. if( pi.op == _OP_CMP && pi._arg1 < 0xFF) {
  443. pi.op = _OP_JCMP;
  444. pi._arg0 = (unsigned char)pi._arg1;
  445. pi._arg1 = i._arg1;
  446. return;
  447. }
  448. break;
  449. case _OP_SET:
  450. case _OP_NEWSLOT:
  451. if(i._arg0 == i._arg3) {
  452. i._arg0 = 0xFF;
  453. }
  454. break;
  455. case _OP_SETOUTER:
  456. if(i._arg0 == i._arg2) {
  457. i._arg0 = 0xFF;
  458. }
  459. break;
  460. case _OP_RETURN:
  461. if( _parent && i._arg0 != MAX_FUNC_STACKSIZE && pi.op == _OP_CALL && _returnexp < size-1) {
  462. pi.op = _OP_TAILCALL;
  463. } else if(pi.op == _OP_CLOSE){
  464. pi = i;
  465. return;
  466. }
  467. break;
  468. case _OP_GET:
  469. if( pi.op == _OP_LOAD && pi._arg0 == i._arg2 && (!IsLocal(pi._arg0))){
  470. pi._arg2 = (unsigned char)i._arg1;
  471. pi.op = _OP_GETK;
  472. pi._arg0 = i._arg0;
  473. return;
  474. }
  475. break;
  476. case _OP_PREPCALL:
  477. if( pi.op == _OP_LOAD && pi._arg0 == i._arg1 && (!IsLocal(pi._arg0))){
  478. pi.op = _OP_PREPCALLK;
  479. pi._arg0 = i._arg0;
  480. pi._arg2 = i._arg2;
  481. pi._arg3 = i._arg3;
  482. return;
  483. }
  484. break;
  485. case _OP_APPENDARRAY: {
  486. SQInteger aat = -1;
  487. switch(pi.op) {
  488. case _OP_LOAD: aat = AAT_LITERAL; break;
  489. case _OP_LOADINT: aat = AAT_INT; break;
  490. case _OP_LOADBOOL: aat = AAT_BOOL; break;
  491. case _OP_LOADFLOAT: aat = AAT_FLOAT; break;
  492. default: break;
  493. }
  494. if(aat != -1 && pi._arg0 == i._arg1 && (!IsLocal(pi._arg0))){
  495. pi.op = _OP_APPENDARRAY;
  496. pi._arg0 = i._arg0;
  497. pi._arg2 = (unsigned char)aat;
  498. pi._arg3 = MAX_FUNC_STACKSIZE;
  499. return;
  500. }
  501. }
  502. break;
  503. case _OP_MOVE:
  504. switch(pi.op) {
  505. case _OP_GET: case _OP_ADD: case _OP_SUB: case _OP_MUL: case _OP_DIV: case _OP_MOD: case _OP_BITW:
  506. case _OP_LOADINT: case _OP_LOADFLOAT: case _OP_LOADBOOL: case _OP_LOAD:
  507. if(pi._arg0 == i._arg1)
  508. {
  509. pi._arg0 = i._arg0;
  510. _optimization = false;
  511. //_result_elimination = false;
  512. return;
  513. }
  514. }
  515. if(pi.op == _OP_MOVE)
  516. {
  517. pi.op = _OP_DMOVE;
  518. pi._arg2 = i._arg0;
  519. pi._arg3 = (unsigned char)i._arg1;
  520. return;
  521. }
  522. break;
  523. case _OP_LOAD:
  524. if(pi.op == _OP_LOAD && i._arg1 < 256) {
  525. pi.op = _OP_DLOAD;
  526. pi._arg2 = i._arg0;
  527. pi._arg3 = (unsigned char)i._arg1;
  528. return;
  529. }
  530. break;
  531. case _OP_EQ:case _OP_NE:
  532. if(pi.op == _OP_LOAD && pi._arg0 == i._arg1 && (!IsLocal(pi._arg0) ))
  533. {
  534. pi.op = i.op;
  535. pi._arg0 = i._arg0;
  536. pi._arg2 = i._arg2;
  537. pi._arg3 = MAX_FUNC_STACKSIZE;
  538. return;
  539. }
  540. break;
  541. case _OP_LOADNULLS:
  542. if((pi.op == _OP_LOADNULLS && pi._arg0+pi._arg1 == i._arg0)) {
  543. pi._arg1 = pi._arg1 + 1;
  544. pi.op = _OP_LOADNULLS;
  545. return;
  546. }
  547. break;
  548. case _OP_LINE:
  549. if(pi.op == _OP_LINE) {
  550. _instructions.pop_back();
  551. _lineinfos.pop_back();
  552. }
  553. break;
  554. }
  555. }
  556. _optimization = true;
  557. _instructions.push_back(i);
  558. }
  559. SQObject SQFuncState::CreateString(const SQChar *s,SQInteger len)
  560. {
  561. SQObjectPtr ns(SQString::Create(_sharedstate,s,len));
  562. _table(_strings)->NewSlot(ns,(SQInteger)1);
  563. return SQCPPMOVE(ns);
  564. }
  565. SQObject SQFuncState::CreateTable()
  566. {
  567. SQObjectPtr nt(SQTable::Create(_sharedstate,0));
  568. _table(_strings)->NewSlot(nt,(SQInteger)1);
  569. return SQCPPMOVE(nt);
  570. }
  571. SQFunctionProto *SQFuncState::BuildProto()
  572. {
  573. SQFunctionProto *f=SQFunctionProto::Create(_ss,_instructions.size(),
  574. _nliterals,_parameters.size(),_functions.size(),_outervalues.size(),
  575. _lineinfos.size(),_localvarinfos.size(),_defaultparams.size());
  576. SQObjectPtr refidx,key,val;
  577. SQInteger idx;
  578. f->_stacksize = _stacksize;
  579. f->_sourcename = _sourcename;
  580. f->_bgenerator = _bgenerator;
  581. f->_name = _name;
  582. f->_return_type = _return_type;
  583. while((idx=_table(_literals)->Next(false,refidx,key,val))!=-1) {
  584. f->_literals[_integer(val)]=key;
  585. refidx=idx;
  586. }
  587. for(SQUnsignedInteger nf = 0; nf < _functions.size(); nf++) f->_functions[nf] = _functions[nf];
  588. for(SQUnsignedInteger np = 0; np < _parameters.size(); np++) f->_parameters[np] = _parameters[np];
  589. for(SQUnsignedInteger np = 0; np < _parameters.size(); np++) f->_parameters_type[np] = _vlocals[np]._type_name;
  590. for(SQUnsignedInteger no = 0; no < _outervalues.size(); no++) f->_outervalues[no] = _outervalues[no];
  591. for(SQUnsignedInteger nl = 0; nl < _localvarinfos.size(); nl++) f->_localvarinfos[nl] = _localvarinfos[nl];
  592. for(SQUnsignedInteger ni = 0; ni < _lineinfos.size(); ni++) f->_lineinfos[ni] = _lineinfos[ni];
  593. for(SQUnsignedInteger nd = 0; nd < _defaultparams.size(); nd++) f->_defaultparams[nd] = _defaultparams[nd];
  594. memcpy(f->_instructions,&_instructions[0],_instructions.size()*sizeof(SQInstruction));
  595. f->_varparams = _varparams;
  596. #ifdef SQ_JIT_LLVM
  597. f->JitCompile();
  598. #endif
  599. return f;
  600. }
  601. SQFuncState *SQFuncState::PushChildState(SQSharedState *ss)
  602. {
  603. SQFuncState *child = (SQFuncState *)sq_malloc(sizeof(SQFuncState));
  604. new (child) SQFuncState(ss,this,_errfunc,_errtarget);
  605. _childstates.push_back(child);
  606. return child;
  607. }
  608. void SQFuncState::PopChildState()
  609. {
  610. SQFuncState *child = _childstates.back();
  611. sq_delete(child,SQFuncState);
  612. _childstates.pop_back();
  613. }
  614. SQFuncState::~SQFuncState()
  615. {
  616. while(_childstates.size() > 0)
  617. {
  618. PopChildState();
  619. }
  620. }
  621. #endif