sqfuncstate.cpp 16 KB

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