sqfuncstate.cpp 17 KB

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