sqfuncstate.cpp 19 KB

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