sqfuncstate.cpp 17 KB

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