gd_compiler.cpp 57 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878
  1. /*************************************************************************/
  2. /* gd_compiler.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* http://www.godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2016 Juan Linietsky, Ariel Manzur. */
  9. /* */
  10. /* Permission is hereby granted, free of charge, to any person obtaining */
  11. /* a copy of this software and associated documentation files (the */
  12. /* "Software"), to deal in the Software without restriction, including */
  13. /* without limitation the rights to use, copy, modify, merge, publish, */
  14. /* distribute, sublicense, and/or sell copies of the Software, and to */
  15. /* permit persons to whom the Software is furnished to do so, subject to */
  16. /* the following conditions: */
  17. /* */
  18. /* The above copyright notice and this permission notice shall be */
  19. /* included in all copies or substantial portions of the Software. */
  20. /* */
  21. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  22. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  23. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  24. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  25. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  26. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  27. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  28. /*************************************************************************/
  29. #include "gd_compiler.h"
  30. #include "gd_script.h"
  31. void GDCompiler::_set_error(const String& p_error,const GDParser::Node *p_node) {
  32. if (error!="")
  33. return;
  34. error=p_error;
  35. if (p_node) {
  36. err_line=p_node->line;
  37. err_column=p_node->column;
  38. } else {
  39. err_line=0;
  40. err_column=0;
  41. }
  42. }
  43. bool GDCompiler::_create_unary_operator(CodeGen& codegen,const GDParser::OperatorNode *on,Variant::Operator op, int p_stack_level) {
  44. ERR_FAIL_COND_V(on->arguments.size()!=1,false);
  45. int src_address_a = _parse_expression(codegen,on->arguments[0],p_stack_level);
  46. if (src_address_a<0)
  47. return false;
  48. codegen.opcodes.push_back(GDFunction::OPCODE_OPERATOR); // perform operator
  49. codegen.opcodes.push_back(op); //which operator
  50. codegen.opcodes.push_back(src_address_a); // argument 1
  51. codegen.opcodes.push_back(src_address_a); // argument 2 (repeated)
  52. //codegen.opcodes.push_back(GDFunction::ADDR_TYPE_NIL); // argument 2 (unary only takes one parameter)
  53. return true;
  54. }
  55. bool GDCompiler::_create_binary_operator(CodeGen& codegen,const GDParser::OperatorNode *on,Variant::Operator op, int p_stack_level,bool p_initializer) {
  56. ERR_FAIL_COND_V(on->arguments.size()!=2,false);
  57. int src_address_a = _parse_expression(codegen,on->arguments[0],p_stack_level,false,p_initializer);
  58. if (src_address_a<0)
  59. return false;
  60. if (src_address_a&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)
  61. p_stack_level++; //uses stack for return, increase stack
  62. int src_address_b = _parse_expression(codegen,on->arguments[1],p_stack_level,false,p_initializer);
  63. if (src_address_b<0)
  64. return false;
  65. codegen.opcodes.push_back(GDFunction::OPCODE_OPERATOR); // perform operator
  66. codegen.opcodes.push_back(op); //which operator
  67. codegen.opcodes.push_back(src_address_a); // argument 1
  68. codegen.opcodes.push_back(src_address_b); // argument 2 (unary only takes one parameter)
  69. return true;
  70. }
  71. /*
  72. int GDCompiler::_parse_subexpression(CodeGen& codegen,const GDParser::Node *p_expression) {
  73. int ret = _parse_expression(codegen,p_expression);
  74. if (ret<0)
  75. return ret;
  76. if (ret&(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)) {
  77. codegen.stack_level++;
  78. codegen.check_max_stack_level();
  79. //stack was used, keep value
  80. }
  81. return ret;
  82. }
  83. */
  84. int GDCompiler::_parse_assign_right_expression(CodeGen& codegen,const GDParser::OperatorNode *p_expression, int p_stack_level) {
  85. Variant::Operator var_op=Variant::OP_MAX;
  86. switch(p_expression->op) {
  87. case GDParser::OperatorNode::OP_ASSIGN_ADD: var_op=Variant::OP_ADD; break;
  88. case GDParser::OperatorNode::OP_ASSIGN_SUB: var_op=Variant::OP_SUBSTRACT; break;
  89. case GDParser::OperatorNode::OP_ASSIGN_MUL: var_op=Variant::OP_MULTIPLY; break;
  90. case GDParser::OperatorNode::OP_ASSIGN_DIV: var_op=Variant::OP_DIVIDE; break;
  91. case GDParser::OperatorNode::OP_ASSIGN_MOD: var_op=Variant::OP_MODULE; break;
  92. case GDParser::OperatorNode::OP_ASSIGN_SHIFT_LEFT: var_op=Variant::OP_SHIFT_LEFT; break;
  93. case GDParser::OperatorNode::OP_ASSIGN_SHIFT_RIGHT: var_op=Variant::OP_SHIFT_RIGHT; break;
  94. case GDParser::OperatorNode::OP_ASSIGN_BIT_AND: var_op=Variant::OP_BIT_AND; break;
  95. case GDParser::OperatorNode::OP_ASSIGN_BIT_OR: var_op=Variant::OP_BIT_OR; break;
  96. case GDParser::OperatorNode::OP_ASSIGN_BIT_XOR: var_op=Variant::OP_BIT_XOR; break;
  97. case GDParser::OperatorNode::OP_INIT_ASSIGN:
  98. case GDParser::OperatorNode::OP_ASSIGN: {
  99. //none
  100. } break;
  101. default: {
  102. ERR_FAIL_V(-1);
  103. }
  104. }
  105. bool initializer = p_expression->op==GDParser::OperatorNode::OP_INIT_ASSIGN;
  106. if (var_op==Variant::OP_MAX) {
  107. return _parse_expression(codegen,p_expression->arguments[1],p_stack_level,false,initializer);
  108. }
  109. if (!_create_binary_operator(codegen,p_expression,var_op,p_stack_level,initializer))
  110. return -1;
  111. int dst_addr=(p_stack_level)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  112. codegen.opcodes.push_back(dst_addr); // append the stack level as destination address of the opcode
  113. codegen.alloc_stack(p_stack_level);
  114. return dst_addr;
  115. }
  116. int GDCompiler::_parse_expression(CodeGen& codegen,const GDParser::Node *p_expression, int p_stack_level,bool p_root,bool p_initializer) {
  117. switch(p_expression->type) {
  118. //should parse variable declaration and adjust stack accordingly...
  119. case GDParser::Node::TYPE_IDENTIFIER: {
  120. //return identifier
  121. //wait, identifier could be a local variable or something else... careful here, must reference properly
  122. //as stack may be more interesting to work with
  123. //This could be made much simpler by just indexing "self", but done this way (with custom self-addressing modes) increases peformance a lot.
  124. const GDParser::IdentifierNode *in = static_cast<const GDParser::IdentifierNode*>(p_expression);
  125. StringName identifier = in->name;
  126. // TRY STACK!
  127. if (!p_initializer && codegen.stack_identifiers.has(identifier)) {
  128. int pos = codegen.stack_identifiers[identifier];
  129. return pos|(GDFunction::ADDR_TYPE_STACK_VARIABLE<<GDFunction::ADDR_BITS);
  130. }
  131. //TRY MEMBERS!
  132. if (!codegen.function_node || !codegen.function_node->_static) {
  133. // TRY MEMBER VARIABLES!
  134. //static function
  135. if (codegen.script->member_indices.has(identifier)) {
  136. int idx = codegen.script->member_indices[identifier].index;
  137. return idx|(GDFunction::ADDR_TYPE_MEMBER<<GDFunction::ADDR_BITS); //argument (stack root)
  138. }
  139. }
  140. //TRY CLASS CONSTANTS
  141. GDScript *owner = codegen.script;
  142. while (owner) {
  143. GDScript *scr = owner;
  144. GDNativeClass *nc=NULL;
  145. while(scr) {
  146. if (scr->constants.has(identifier)) {
  147. //int idx=scr->constants[identifier];
  148. int idx = codegen.get_name_map_pos(identifier);
  149. return idx|(GDFunction::ADDR_TYPE_CLASS_CONSTANT<<GDFunction::ADDR_BITS); //argument (stack root)
  150. }
  151. if (scr->native.is_valid())
  152. nc=scr->native.ptr();
  153. scr=scr->_base;
  154. }
  155. // CLASS C++ Integer Constant
  156. if (nc) {
  157. bool success=false;
  158. int constant = ObjectTypeDB::get_integer_constant(nc->get_name(),identifier,&success);
  159. if (success) {
  160. Variant key=constant;
  161. int idx;
  162. if (!codegen.constant_map.has(key)) {
  163. idx=codegen.constant_map.size();
  164. codegen.constant_map[key]=idx;
  165. } else {
  166. idx=codegen.constant_map[key];
  167. }
  168. return idx|(GDFunction::ADDR_TYPE_LOCAL_CONSTANT<<GDFunction::ADDR_BITS); //make it a local constant (faster access)
  169. }
  170. }
  171. owner=owner->_owner;
  172. }
  173. /*
  174. handled in constants now
  175. if (codegen.script->subclasses.has(identifier)) {
  176. //same with a subclass, make it a local constant.
  177. int idx = codegen.get_constant_pos(codegen.script->subclasses[identifier]);
  178. return idx|(GDFunction::ADDR_TYPE_LOCAL_CONSTANT<<GDFunction::ADDR_BITS); //make it a local constant (faster access)
  179. }*/
  180. if (GDScriptLanguage::get_singleton()->get_global_map().has(identifier)) {
  181. int idx = GDScriptLanguage::get_singleton()->get_global_map()[identifier];
  182. return idx|(GDFunction::ADDR_TYPE_GLOBAL<<GDFunction::ADDR_BITS); //argument (stack root)
  183. }
  184. //not found, error
  185. _set_error("Identifier not found: "+String(identifier),p_expression);
  186. return -1;
  187. } break;
  188. case GDParser::Node::TYPE_CONSTANT: {
  189. //return constant
  190. const GDParser::ConstantNode *cn = static_cast<const GDParser::ConstantNode*>(p_expression);
  191. int idx;
  192. if (!codegen.constant_map.has(cn->value)) {
  193. idx=codegen.constant_map.size();
  194. codegen.constant_map[cn->value]=idx;
  195. } else {
  196. idx=codegen.constant_map[cn->value];
  197. }
  198. return idx|(GDFunction::ADDR_TYPE_LOCAL_CONSTANT<<GDFunction::ADDR_BITS); //argument (stack root)
  199. } break;
  200. case GDParser::Node::TYPE_SELF: {
  201. //return constant
  202. if (codegen.function_node && codegen.function_node->_static) {
  203. _set_error("'self' not present in static function!",p_expression);
  204. return -1;
  205. }
  206. return (GDFunction::ADDR_TYPE_SELF<<GDFunction::ADDR_BITS);
  207. } break;
  208. case GDParser::Node::TYPE_ARRAY: {
  209. const GDParser::ArrayNode *an = static_cast<const GDParser::ArrayNode*>(p_expression);
  210. Vector<int> values;
  211. int slevel=p_stack_level;
  212. for(int i=0;i<an->elements.size();i++) {
  213. int ret = _parse_expression(codegen,an->elements[i],slevel);
  214. if (ret<0)
  215. return ret;
  216. if (ret&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  217. slevel++;
  218. codegen.alloc_stack(slevel);
  219. }
  220. values.push_back(ret);
  221. }
  222. codegen.opcodes.push_back(GDFunction::OPCODE_CONSTRUCT_ARRAY);
  223. codegen.opcodes.push_back(values.size());
  224. for(int i=0;i<values.size();i++)
  225. codegen.opcodes.push_back(values[i]);
  226. int dst_addr=(p_stack_level)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  227. codegen.opcodes.push_back(dst_addr); // append the stack level as destination address of the opcode
  228. codegen.alloc_stack(p_stack_level);
  229. return dst_addr;
  230. } break;
  231. case GDParser::Node::TYPE_DICTIONARY: {
  232. const GDParser::DictionaryNode *dn = static_cast<const GDParser::DictionaryNode*>(p_expression);
  233. Vector<int> values;
  234. int slevel=p_stack_level;
  235. for(int i=0;i<dn->elements.size();i++) {
  236. int ret = _parse_expression(codegen,dn->elements[i].key,slevel);
  237. if (ret<0)
  238. return ret;
  239. if (ret&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  240. slevel++;
  241. codegen.alloc_stack(slevel);
  242. }
  243. values.push_back(ret);
  244. ret = _parse_expression(codegen,dn->elements[i].value,slevel);
  245. if (ret<0)
  246. return ret;
  247. if (ret&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  248. slevel++;
  249. codegen.alloc_stack(slevel);
  250. }
  251. values.push_back(ret);
  252. }
  253. codegen.opcodes.push_back(GDFunction::OPCODE_CONSTRUCT_DICTIONARY);
  254. codegen.opcodes.push_back(dn->elements.size());
  255. for(int i=0;i<values.size();i++)
  256. codegen.opcodes.push_back(values[i]);
  257. int dst_addr=(p_stack_level)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  258. codegen.opcodes.push_back(dst_addr); // append the stack level as destination address of the opcode
  259. codegen.alloc_stack(p_stack_level);
  260. return dst_addr;
  261. } break;
  262. case GDParser::Node::TYPE_OPERATOR: {
  263. //hell breaks loose
  264. const GDParser::OperatorNode *on = static_cast<const GDParser::OperatorNode*>(p_expression);
  265. switch(on->op) {
  266. //call/constructor operator
  267. case GDParser::OperatorNode::OP_PARENT_CALL: {
  268. ERR_FAIL_COND_V(on->arguments.size()<1,-1);
  269. const GDParser::IdentifierNode *in = (const GDParser::IdentifierNode *)on->arguments[0];
  270. Vector<int> arguments;
  271. int slevel = p_stack_level;
  272. for(int i=1;i<on->arguments.size();i++) {
  273. int ret = _parse_expression(codegen,on->arguments[i],slevel);
  274. if (ret<0)
  275. return ret;
  276. if (ret&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  277. slevel++;
  278. codegen.alloc_stack(slevel);
  279. }
  280. arguments.push_back(ret);
  281. }
  282. //push call bytecode
  283. codegen.opcodes.push_back(GDFunction::OPCODE_CALL_SELF_BASE); // basic type constructor
  284. codegen.opcodes.push_back(codegen.get_name_map_pos(in->name)); //instance
  285. codegen.opcodes.push_back(arguments.size()); //argument count
  286. codegen.alloc_call(arguments.size());
  287. for(int i=0;i<arguments.size();i++)
  288. codegen.opcodes.push_back(arguments[i]); //arguments
  289. } break;
  290. case GDParser::OperatorNode::OP_CALL: {
  291. if (on->arguments[0]->type==GDParser::Node::TYPE_TYPE) {
  292. //construct a basic type
  293. ERR_FAIL_COND_V(on->arguments.size()<1,-1);
  294. const GDParser::TypeNode *tn = (const GDParser::TypeNode *)on->arguments[0];
  295. int vtype = tn->vtype;
  296. Vector<int> arguments;
  297. int slevel = p_stack_level;
  298. for(int i=1;i<on->arguments.size();i++) {
  299. int ret = _parse_expression(codegen,on->arguments[i],slevel);
  300. if (ret<0)
  301. return ret;
  302. if (ret&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  303. slevel++;
  304. codegen.alloc_stack(slevel);
  305. }
  306. arguments.push_back(ret);
  307. }
  308. //push call bytecode
  309. codegen.opcodes.push_back(GDFunction::OPCODE_CONSTRUCT); // basic type constructor
  310. codegen.opcodes.push_back(vtype); //instance
  311. codegen.opcodes.push_back(arguments.size()); //argument count
  312. codegen.alloc_call(arguments.size());
  313. for(int i=0;i<arguments.size();i++)
  314. codegen.opcodes.push_back(arguments[i]); //arguments
  315. } else if (on->arguments[0]->type==GDParser::Node::TYPE_BUILT_IN_FUNCTION) {
  316. //built in function
  317. ERR_FAIL_COND_V(on->arguments.size()<1,-1);
  318. Vector<int> arguments;
  319. int slevel = p_stack_level;
  320. for(int i=1;i<on->arguments.size();i++) {
  321. int ret = _parse_expression(codegen,on->arguments[i],slevel);
  322. if (ret<0)
  323. return ret;
  324. if (ret&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  325. slevel++;
  326. codegen.alloc_stack(slevel);
  327. }
  328. arguments.push_back(ret);
  329. }
  330. codegen.opcodes.push_back(GDFunction::OPCODE_CALL_BUILT_IN);
  331. codegen.opcodes.push_back(static_cast<const GDParser::BuiltInFunctionNode*>(on->arguments[0])->function);
  332. codegen.opcodes.push_back(on->arguments.size()-1);
  333. codegen.alloc_call(on->arguments.size()-1);
  334. for(int i=0;i<arguments.size();i++)
  335. codegen.opcodes.push_back(arguments[i]);
  336. } else {
  337. //regular function
  338. ERR_FAIL_COND_V(on->arguments.size()<2,-1);
  339. const GDParser::Node *instance = on->arguments[0];
  340. bool in_static=false;
  341. if (instance->type==GDParser::Node::TYPE_SELF) {
  342. //room for optimization
  343. }
  344. Vector<int> arguments;
  345. int slevel = p_stack_level;
  346. for(int i=0;i<on->arguments.size();i++) {
  347. int ret;
  348. if (i==0 && on->arguments[i]->type==GDParser::Node::TYPE_SELF && codegen.function_node && codegen.function_node->_static) {
  349. //static call to self
  350. ret=(GDFunction::ADDR_TYPE_CLASS<<GDFunction::ADDR_BITS);
  351. } else if (i==1) {
  352. if (on->arguments[i]->type!=GDParser::Node::TYPE_IDENTIFIER) {
  353. _set_error("Attempt to call a non-identifier.",on);
  354. return -1;
  355. }
  356. GDParser::IdentifierNode *id = static_cast<GDParser::IdentifierNode*>(on->arguments[i]);
  357. ret=codegen.get_name_map_pos(id->name);
  358. } else {
  359. ret = _parse_expression(codegen,on->arguments[i],slevel);
  360. if (ret<0)
  361. return ret;
  362. if (ret&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  363. slevel++;
  364. codegen.alloc_stack(slevel);
  365. }
  366. }
  367. arguments.push_back(ret);
  368. }
  369. codegen.opcodes.push_back(p_root?GDFunction::OPCODE_CALL:GDFunction::OPCODE_CALL_RETURN); // perform operator
  370. codegen.opcodes.push_back(on->arguments.size()-2);
  371. codegen.alloc_call(on->arguments.size()-2);
  372. for(int i=0;i<arguments.size();i++)
  373. codegen.opcodes.push_back(arguments[i]);
  374. }
  375. } break;
  376. case GDParser::OperatorNode::OP_YIELD: {
  377. ERR_FAIL_COND_V(on->arguments.size() && on->arguments.size()!=2,-1);
  378. Vector<int> arguments;
  379. int slevel = p_stack_level;
  380. for(int i=0;i<on->arguments.size();i++) {
  381. int ret = _parse_expression(codegen,on->arguments[i],slevel);
  382. if (ret<0)
  383. return ret;
  384. if (ret&(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)) {
  385. slevel++;
  386. codegen.alloc_stack(slevel);
  387. }
  388. arguments.push_back(ret);
  389. }
  390. //push call bytecode
  391. codegen.opcodes.push_back(arguments.size()==0?GDFunction::OPCODE_YIELD:GDFunction::OPCODE_YIELD_SIGNAL); // basic type constructor
  392. for(int i=0;i<arguments.size();i++)
  393. codegen.opcodes.push_back(arguments[i]); //arguments
  394. codegen.opcodes.push_back(GDFunction::OPCODE_YIELD_RESUME);
  395. //next will be where to place the result :)
  396. } break;
  397. //indexing operator
  398. case GDParser::OperatorNode::OP_INDEX:
  399. case GDParser::OperatorNode::OP_INDEX_NAMED: {
  400. ERR_FAIL_COND_V(on->arguments.size()!=2,-1);
  401. int slevel = p_stack_level;
  402. bool named=(on->op==GDParser::OperatorNode::OP_INDEX_NAMED);
  403. int from = _parse_expression(codegen,on->arguments[0],slevel);
  404. if (from<0)
  405. return from;
  406. int index;
  407. if (named) {
  408. if (on->arguments[0]->type==GDParser::Node::TYPE_SELF && codegen.script && codegen.function_node && !codegen.function_node->_static) {
  409. GDParser::IdentifierNode* identifier = static_cast<GDParser::IdentifierNode*>(on->arguments[1]);
  410. const Map<StringName,GDScript::MemberInfo>::Element *MI = codegen.script->member_indices.find(identifier->name);
  411. #ifdef DEBUG_ENABLED
  412. if (MI && MI->get().getter==codegen.function_node->name) {
  413. String n = static_cast<GDParser::IdentifierNode*>(on->arguments[1])->name;
  414. _set_error("Must use '"+n+"' instead of 'self."+n+"' in getter.",on);
  415. return -1;
  416. }
  417. #endif
  418. if (MI && MI->get().getter=="") {
  419. // Faster than indexing self (as if no self. had been used)
  420. return (MI->get().index)|(GDFunction::ADDR_TYPE_MEMBER<<GDFunction::ADDR_BITS);
  421. }
  422. }
  423. index=codegen.get_name_map_pos(static_cast<GDParser::IdentifierNode*>(on->arguments[1])->name);
  424. } else {
  425. if (on->arguments[1]->type==GDParser::Node::TYPE_CONSTANT && static_cast<const GDParser::ConstantNode*>(on->arguments[1])->value.get_type()==Variant::STRING) {
  426. //also, somehow, named (speed up anyway)
  427. StringName name = static_cast<const GDParser::ConstantNode*>(on->arguments[1])->value;
  428. index=codegen.get_name_map_pos(name);
  429. named=true;
  430. } else {
  431. //regular indexing
  432. if (from&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  433. slevel++;
  434. codegen.alloc_stack(slevel);
  435. }
  436. index = _parse_expression(codegen,on->arguments[1],slevel);
  437. if (index<0)
  438. return index;
  439. }
  440. }
  441. codegen.opcodes.push_back(named?GDFunction::OPCODE_GET_NAMED:GDFunction::OPCODE_GET); // perform operator
  442. codegen.opcodes.push_back(from); // argument 1
  443. codegen.opcodes.push_back(index); // argument 2 (unary only takes one parameter)
  444. } break;
  445. case GDParser::OperatorNode::OP_AND: {
  446. // AND operator with early out on failure
  447. int res = _parse_expression(codegen,on->arguments[0],p_stack_level);
  448. if (res<0)
  449. return res;
  450. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_IF_NOT);
  451. codegen.opcodes.push_back(res);
  452. int jump_fail_pos=codegen.opcodes.size();
  453. codegen.opcodes.push_back(0);
  454. res = _parse_expression(codegen,on->arguments[1],p_stack_level);
  455. if (res<0)
  456. return res;
  457. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_IF_NOT);
  458. codegen.opcodes.push_back(res);
  459. int jump_fail_pos2=codegen.opcodes.size();
  460. codegen.opcodes.push_back(0);
  461. codegen.alloc_stack(p_stack_level); //it will be used..
  462. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN_TRUE);
  463. codegen.opcodes.push_back(p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  464. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  465. codegen.opcodes.push_back(codegen.opcodes.size()+3);
  466. codegen.opcodes[jump_fail_pos]=codegen.opcodes.size();
  467. codegen.opcodes[jump_fail_pos2]=codegen.opcodes.size();
  468. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN_FALSE);
  469. codegen.opcodes.push_back(p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  470. return p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS;
  471. } break;
  472. case GDParser::OperatorNode::OP_OR: {
  473. // OR operator with early out on success
  474. int res = _parse_expression(codegen,on->arguments[0],p_stack_level);
  475. if (res<0)
  476. return res;
  477. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_IF);
  478. codegen.opcodes.push_back(res);
  479. int jump_success_pos=codegen.opcodes.size();
  480. codegen.opcodes.push_back(0);
  481. res = _parse_expression(codegen,on->arguments[1],p_stack_level);
  482. if (res<0)
  483. return res;
  484. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_IF);
  485. codegen.opcodes.push_back(res);
  486. int jump_success_pos2=codegen.opcodes.size();
  487. codegen.opcodes.push_back(0);
  488. codegen.alloc_stack(p_stack_level); //it will be used..
  489. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN_FALSE);
  490. codegen.opcodes.push_back(p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  491. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  492. codegen.opcodes.push_back(codegen.opcodes.size()+3);
  493. codegen.opcodes[jump_success_pos]=codegen.opcodes.size();
  494. codegen.opcodes[jump_success_pos2]=codegen.opcodes.size();
  495. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN_TRUE);
  496. codegen.opcodes.push_back(p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  497. return p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS;
  498. } break;
  499. //unary operators
  500. case GDParser::OperatorNode::OP_NEG: { if (!_create_unary_operator(codegen,on,Variant::OP_NEGATE,p_stack_level)) return -1;} break;
  501. case GDParser::OperatorNode::OP_NOT: { if (!_create_unary_operator(codegen,on,Variant::OP_NOT,p_stack_level)) return -1;} break;
  502. case GDParser::OperatorNode::OP_BIT_INVERT: { if (!_create_unary_operator(codegen,on,Variant::OP_BIT_NEGATE,p_stack_level)) return -1;} break;
  503. case GDParser::OperatorNode::OP_PREINC: { } break; //?
  504. case GDParser::OperatorNode::OP_PREDEC: { } break;
  505. case GDParser::OperatorNode::OP_INC: { } break;
  506. case GDParser::OperatorNode::OP_DEC: { } break;
  507. //binary operators (in precedence order)
  508. case GDParser::OperatorNode::OP_IN: { if (!_create_binary_operator(codegen,on,Variant::OP_IN,p_stack_level)) return -1;} break;
  509. case GDParser::OperatorNode::OP_EQUAL: { if (!_create_binary_operator(codegen,on,Variant::OP_EQUAL,p_stack_level)) return -1;} break;
  510. case GDParser::OperatorNode::OP_NOT_EQUAL: { if (!_create_binary_operator(codegen,on,Variant::OP_NOT_EQUAL,p_stack_level)) return -1;} break;
  511. case GDParser::OperatorNode::OP_LESS: { if (!_create_binary_operator(codegen,on,Variant::OP_LESS,p_stack_level)) return -1;} break;
  512. case GDParser::OperatorNode::OP_LESS_EQUAL: { if (!_create_binary_operator(codegen,on,Variant::OP_LESS_EQUAL,p_stack_level)) return -1;} break;
  513. case GDParser::OperatorNode::OP_GREATER: { if (!_create_binary_operator(codegen,on,Variant::OP_GREATER,p_stack_level)) return -1;} break;
  514. case GDParser::OperatorNode::OP_GREATER_EQUAL: { if (!_create_binary_operator(codegen,on,Variant::OP_GREATER_EQUAL,p_stack_level)) return -1;} break;
  515. case GDParser::OperatorNode::OP_ADD: { if (!_create_binary_operator(codegen,on,Variant::OP_ADD,p_stack_level)) return -1;} break;
  516. case GDParser::OperatorNode::OP_SUB: { if (!_create_binary_operator(codegen,on,Variant::OP_SUBSTRACT,p_stack_level)) return -1;} break;
  517. case GDParser::OperatorNode::OP_MUL: { if (!_create_binary_operator(codegen,on,Variant::OP_MULTIPLY,p_stack_level)) return -1;} break;
  518. case GDParser::OperatorNode::OP_DIV: { if (!_create_binary_operator(codegen,on,Variant::OP_DIVIDE,p_stack_level)) return -1;} break;
  519. case GDParser::OperatorNode::OP_MOD: { if (!_create_binary_operator(codegen,on,Variant::OP_MODULE,p_stack_level)) return -1;} break;
  520. //case GDParser::OperatorNode::OP_SHIFT_LEFT: { if (!_create_binary_operator(codegen,on,Variant::OP_SHIFT_LEFT,p_stack_level)) return -1;} break;
  521. //case GDParser::OperatorNode::OP_SHIFT_RIGHT: { if (!_create_binary_operator(codegen,on,Variant::OP_SHIFT_RIGHT,p_stack_level)) return -1;} break;
  522. case GDParser::OperatorNode::OP_BIT_AND: { if (!_create_binary_operator(codegen,on,Variant::OP_BIT_AND,p_stack_level)) return -1;} break;
  523. case GDParser::OperatorNode::OP_BIT_OR: { if (!_create_binary_operator(codegen,on,Variant::OP_BIT_OR,p_stack_level)) return -1;} break;
  524. case GDParser::OperatorNode::OP_BIT_XOR: { if (!_create_binary_operator(codegen,on,Variant::OP_BIT_XOR,p_stack_level)) return -1;} break;
  525. //shift
  526. case GDParser::OperatorNode::OP_SHIFT_LEFT: { if (!_create_binary_operator(codegen,on,Variant::OP_SHIFT_LEFT,p_stack_level)) return -1;} break;
  527. case GDParser::OperatorNode::OP_SHIFT_RIGHT: { if (!_create_binary_operator(codegen,on,Variant::OP_SHIFT_RIGHT,p_stack_level)) return -1;} break;
  528. //assignment operators
  529. case GDParser::OperatorNode::OP_ASSIGN_ADD:
  530. case GDParser::OperatorNode::OP_ASSIGN_SUB:
  531. case GDParser::OperatorNode::OP_ASSIGN_MUL:
  532. case GDParser::OperatorNode::OP_ASSIGN_DIV:
  533. case GDParser::OperatorNode::OP_ASSIGN_MOD:
  534. case GDParser::OperatorNode::OP_ASSIGN_SHIFT_LEFT:
  535. case GDParser::OperatorNode::OP_ASSIGN_SHIFT_RIGHT:
  536. case GDParser::OperatorNode::OP_ASSIGN_BIT_AND:
  537. case GDParser::OperatorNode::OP_ASSIGN_BIT_OR:
  538. case GDParser::OperatorNode::OP_ASSIGN_BIT_XOR:
  539. case GDParser::OperatorNode::OP_INIT_ASSIGN:
  540. case GDParser::OperatorNode::OP_ASSIGN: {
  541. ERR_FAIL_COND_V(on->arguments.size()!=2,-1);
  542. if (on->arguments[0]->type==GDParser::Node::TYPE_OPERATOR && (static_cast<GDParser::OperatorNode*>(on->arguments[0])->op==GDParser::OperatorNode::OP_INDEX || static_cast<GDParser::OperatorNode*>(on->arguments[0])->op==GDParser::OperatorNode::OP_INDEX_NAMED)) {
  543. //SET (chained) MODE!!
  544. #ifdef DEBUG_ENABLED
  545. if (static_cast<GDParser::OperatorNode*>(on->arguments[0])->op==GDParser::OperatorNode::OP_INDEX_NAMED) {
  546. const GDParser::OperatorNode* inon = static_cast<GDParser::OperatorNode*>(on->arguments[0]);
  547. if (inon->arguments[0]->type==GDParser::Node::TYPE_SELF && codegen.script && codegen.function_node && !codegen.function_node->_static) {
  548. const Map<StringName,GDScript::MemberInfo>::Element *MI = codegen.script->member_indices.find(static_cast<GDParser::IdentifierNode*>(inon->arguments[1])->name);
  549. if (MI && MI->get().setter==codegen.function_node->name) {
  550. String n = static_cast<GDParser::IdentifierNode*>(inon->arguments[1])->name;
  551. _set_error("Must use '"+n+"' instead of 'self."+n+"' in setter.",inon);
  552. return -1;
  553. }
  554. }
  555. }
  556. #endif
  557. int slevel=p_stack_level;
  558. GDParser::OperatorNode* op = static_cast<GDParser::OperatorNode*>(on->arguments[0]);
  559. /* Find chain of sets */
  560. List<GDParser::OperatorNode*> chain;
  561. {
  562. //create get/set chain
  563. GDParser::OperatorNode* n=op;
  564. while(true) {
  565. chain.push_back(n);
  566. if (n->arguments[0]->type!=GDParser::Node::TYPE_OPERATOR)
  567. break;
  568. n = static_cast<GDParser::OperatorNode*>(n->arguments[0]);
  569. if (n->op!=GDParser::OperatorNode::OP_INDEX && n->op!=GDParser::OperatorNode::OP_INDEX_NAMED)
  570. break;
  571. }
  572. }
  573. /* Chain of gets */
  574. //get at (potential) root stack pos, so it can be returned
  575. int prev_pos = _parse_expression(codegen,chain.back()->get()->arguments[0],slevel);
  576. if (prev_pos<0)
  577. return prev_pos;
  578. int retval=prev_pos;
  579. //print_line("retval: "+itos(retval));
  580. if (retval&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  581. slevel++;
  582. codegen.alloc_stack(slevel);
  583. }
  584. Vector<int> setchain;
  585. int prev_key_idx=-1;
  586. for(List<GDParser::OperatorNode*>::Element *E=chain.back();E;E=E->prev()) {
  587. if (E==chain.front()) //ignore first
  588. break;
  589. bool named = E->get()->op==GDParser::OperatorNode::OP_INDEX_NAMED;
  590. int key_idx;
  591. if (named) {
  592. key_idx = codegen.get_name_map_pos(static_cast<const GDParser::IdentifierNode*>(E->get()->arguments[1])->name);
  593. //printf("named key %x\n",key_idx);
  594. } else {
  595. if (prev_pos&(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)) {
  596. slevel++;
  597. codegen.alloc_stack(slevel);
  598. }
  599. GDParser::Node *key = E->get()->arguments[1];
  600. key_idx = _parse_expression(codegen,key,slevel);
  601. //printf("expr key %x\n",key_idx);
  602. //stack was raised here if retval was stack but..
  603. }
  604. if (key_idx<0)
  605. return key_idx;
  606. codegen.opcodes.push_back(named ? GDFunction::OPCODE_GET_NAMED : GDFunction::OPCODE_GET);
  607. codegen.opcodes.push_back(prev_pos);
  608. codegen.opcodes.push_back(key_idx);
  609. slevel++;
  610. codegen.alloc_stack(slevel);
  611. int dst_pos = (GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)|slevel;
  612. codegen.opcodes.push_back(dst_pos);
  613. //add in reverse order, since it will be reverted
  614. setchain.push_back(dst_pos);
  615. setchain.push_back(key_idx);
  616. setchain.push_back(prev_pos);
  617. setchain.push_back(named ? GDFunction::OPCODE_SET_NAMED : GDFunction::OPCODE_SET);
  618. prev_pos=dst_pos;
  619. prev_key_idx=key_idx;
  620. }
  621. setchain.invert();
  622. int set_index;
  623. bool named=false;
  624. if (static_cast<const GDParser::OperatorNode*>(op)->op==GDParser::OperatorNode::OP_INDEX_NAMED) {
  625. set_index=codegen.get_name_map_pos(static_cast<const GDParser::IdentifierNode*>(op->arguments[1])->name);
  626. named=true;
  627. } else {
  628. set_index = _parse_expression(codegen,op->arguments[1],slevel+1);
  629. named=false;
  630. }
  631. if (set_index<0)
  632. return set_index;
  633. if (set_index&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  634. slevel++;
  635. codegen.alloc_stack(slevel);
  636. }
  637. int set_value = _parse_assign_right_expression(codegen,on,slevel+1);
  638. if (set_value<0)
  639. return set_value;
  640. codegen.opcodes.push_back(named?GDFunction::OPCODE_SET_NAMED:GDFunction::OPCODE_SET);
  641. codegen.opcodes.push_back(prev_pos);
  642. codegen.opcodes.push_back(set_index);
  643. codegen.opcodes.push_back(set_value);
  644. for(int i=0;i<setchain.size();i+=4) {
  645. codegen.opcodes.push_back(setchain[i+0]);
  646. codegen.opcodes.push_back(setchain[i+1]);
  647. codegen.opcodes.push_back(setchain[i+2]);
  648. codegen.opcodes.push_back(setchain[i+3]);
  649. }
  650. return retval;
  651. } else {
  652. //ASSIGNMENT MODE!!
  653. int slevel = p_stack_level;
  654. int dst_address_a = _parse_expression(codegen,on->arguments[0],slevel,false,on->op==GDParser::OperatorNode::OP_INIT_ASSIGN);
  655. if (dst_address_a<0)
  656. return -1;
  657. if (dst_address_a&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  658. slevel++;
  659. codegen.alloc_stack(slevel);
  660. }
  661. int src_address_b = _parse_assign_right_expression(codegen,on,slevel);
  662. if (src_address_b<0)
  663. return -1;
  664. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN); // perform operator
  665. codegen.opcodes.push_back(dst_address_a); // argument 1
  666. codegen.opcodes.push_back(src_address_b); // argument 2 (unary only takes one parameter)
  667. return dst_address_a; //if anything, returns wathever was assigned or correct stack position
  668. }
  669. } break;
  670. case GDParser::OperatorNode::OP_EXTENDS: {
  671. ERR_FAIL_COND_V(on->arguments.size()!=2,false);
  672. int slevel = p_stack_level;
  673. int src_address_a = _parse_expression(codegen,on->arguments[0],slevel);
  674. if (src_address_a<0)
  675. return -1;
  676. if (src_address_a&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)
  677. slevel++; //uses stack for return, increase stack
  678. int src_address_b = _parse_expression(codegen,on->arguments[1],slevel);
  679. if (src_address_b<0)
  680. return -1;
  681. codegen.opcodes.push_back(GDFunction::OPCODE_EXTENDS_TEST); // perform operator
  682. codegen.opcodes.push_back(src_address_a); // argument 1
  683. codegen.opcodes.push_back(src_address_b); // argument 2 (unary only takes one parameter)
  684. } break;
  685. default: {
  686. ERR_EXPLAIN("Bug in bytecode compiler, unexpected operator #"+itos(on->op)+" in parse tree while parsing expression.");
  687. ERR_FAIL_V(0); //unreachable code
  688. } break;
  689. }
  690. int dst_addr=(p_stack_level)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  691. codegen.opcodes.push_back(dst_addr); // append the stack level as destination address of the opcode
  692. codegen.alloc_stack(p_stack_level);
  693. return dst_addr;
  694. } break;
  695. //TYPE_TYPE,
  696. default: {
  697. ERR_EXPLAIN("Bug in bytecode compiler, unexpected node in parse tree while parsing expression.");
  698. ERR_FAIL_V(-1); //unreachable code
  699. } break;
  700. }
  701. ERR_FAIL_V(-1); //unreachable code
  702. }
  703. Error GDCompiler::_parse_block(CodeGen& codegen,const GDParser::BlockNode *p_block,int p_stack_level,int p_break_addr,int p_continue_addr) {
  704. codegen.push_stack_identifiers();
  705. int new_identifiers=0;
  706. codegen.current_line=p_block->line;
  707. for(int i=0;i<p_block->statements.size();i++) {
  708. const GDParser::Node *s = p_block->statements[i];
  709. switch(s->type) {
  710. case GDParser::Node::TYPE_NEWLINE: {
  711. const GDParser::NewLineNode *nl = static_cast<const GDParser::NewLineNode*>(s);
  712. codegen.opcodes.push_back(GDFunction::OPCODE_LINE);
  713. codegen.opcodes.push_back(nl->line);
  714. codegen.current_line=nl->line;
  715. } break;
  716. case GDParser::Node::TYPE_CONTROL_FLOW: {
  717. // try subblocks
  718. const GDParser::ControlFlowNode *cf = static_cast<const GDParser::ControlFlowNode*>(s);
  719. switch(cf->cf_type) {
  720. case GDParser::ControlFlowNode::CF_IF: {
  721. #ifdef DEBUG_ENABLED
  722. codegen.opcodes.push_back(GDFunction::OPCODE_LINE);
  723. codegen.opcodes.push_back(cf->line);
  724. codegen.current_line=cf->line;
  725. #endif
  726. int ret = _parse_expression(codegen,cf->arguments[0],p_stack_level,false);
  727. if (ret<0)
  728. return ERR_PARSE_ERROR;
  729. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_IF_NOT);
  730. codegen.opcodes.push_back(ret);
  731. int else_addr=codegen.opcodes.size();
  732. codegen.opcodes.push_back(0); //temporary
  733. Error err = _parse_block(codegen,cf->body,p_stack_level,p_break_addr,p_continue_addr);
  734. if (err)
  735. return err;
  736. if (cf->body_else) {
  737. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  738. int end_addr=codegen.opcodes.size();
  739. codegen.opcodes.push_back(0);
  740. codegen.opcodes[else_addr]=codegen.opcodes.size();
  741. Error err = _parse_block(codegen,cf->body_else,p_stack_level,p_break_addr,p_continue_addr);
  742. if (err)
  743. return err;
  744. codegen.opcodes[end_addr]=codegen.opcodes.size();
  745. } else {
  746. //end without else
  747. codegen.opcodes[else_addr]=codegen.opcodes.size();
  748. }
  749. } break;
  750. case GDParser::ControlFlowNode::CF_FOR: {
  751. int slevel=p_stack_level;
  752. int iter_stack_pos=slevel;
  753. int iterator_pos = (slevel++)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  754. int counter_pos = (slevel++)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  755. int container_pos = (slevel++)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  756. codegen.alloc_stack(slevel);
  757. codegen.push_stack_identifiers();
  758. codegen.add_stack_identifier(static_cast<const GDParser::IdentifierNode*>(cf->arguments[0])->name,iter_stack_pos);
  759. int ret = _parse_expression(codegen,cf->arguments[1],slevel,false);
  760. if (ret<0)
  761. return ERR_COMPILATION_FAILED;
  762. //assign container
  763. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN);
  764. codegen.opcodes.push_back(container_pos);
  765. codegen.opcodes.push_back(ret);
  766. //begin loop
  767. codegen.opcodes.push_back(GDFunction::OPCODE_ITERATE_BEGIN);
  768. codegen.opcodes.push_back(counter_pos);
  769. codegen.opcodes.push_back(container_pos);
  770. codegen.opcodes.push_back(codegen.opcodes.size()+4);
  771. codegen.opcodes.push_back(iterator_pos);
  772. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP); //skip code for next
  773. codegen.opcodes.push_back(codegen.opcodes.size()+8);
  774. //break loop
  775. int break_pos=codegen.opcodes.size();
  776. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP); //skip code for next
  777. codegen.opcodes.push_back(0); //skip code for next
  778. //next loop
  779. int continue_pos=codegen.opcodes.size();
  780. codegen.opcodes.push_back(GDFunction::OPCODE_ITERATE);
  781. codegen.opcodes.push_back(counter_pos);
  782. codegen.opcodes.push_back(container_pos);
  783. codegen.opcodes.push_back(break_pos);
  784. codegen.opcodes.push_back(iterator_pos);
  785. Error err = _parse_block(codegen,cf->body,slevel,break_pos,continue_pos);
  786. if (err)
  787. return err;
  788. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  789. codegen.opcodes.push_back(continue_pos);
  790. codegen.opcodes[break_pos+1]=codegen.opcodes.size();
  791. codegen.pop_stack_identifiers();
  792. } break;
  793. case GDParser::ControlFlowNode::CF_WHILE: {
  794. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  795. codegen.opcodes.push_back(codegen.opcodes.size()+3);
  796. int break_addr=codegen.opcodes.size();
  797. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  798. codegen.opcodes.push_back(0);
  799. int continue_addr=codegen.opcodes.size();
  800. int ret = _parse_expression(codegen,cf->arguments[0],p_stack_level,false);
  801. if (ret<0)
  802. return ERR_PARSE_ERROR;
  803. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_IF_NOT);
  804. codegen.opcodes.push_back(ret);
  805. codegen.opcodes.push_back(break_addr);
  806. Error err = _parse_block(codegen,cf->body,p_stack_level,break_addr,continue_addr);
  807. if (err)
  808. return err;
  809. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  810. codegen.opcodes.push_back(continue_addr);
  811. codegen.opcodes[break_addr+1]=codegen.opcodes.size();
  812. } break;
  813. case GDParser::ControlFlowNode::CF_SWITCH: {
  814. } break;
  815. case GDParser::ControlFlowNode::CF_BREAK: {
  816. if (p_break_addr<0) {
  817. _set_error("'break'' not within loop",cf);
  818. return ERR_COMPILATION_FAILED;
  819. }
  820. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  821. codegen.opcodes.push_back(p_break_addr);
  822. } break;
  823. case GDParser::ControlFlowNode::CF_CONTINUE: {
  824. if (p_continue_addr<0) {
  825. _set_error("'continue' not within loop",cf);
  826. return ERR_COMPILATION_FAILED;
  827. }
  828. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  829. codegen.opcodes.push_back(p_continue_addr);
  830. } break;
  831. case GDParser::ControlFlowNode::CF_RETURN: {
  832. int ret;
  833. if (cf->arguments.size()) {
  834. ret = _parse_expression(codegen,cf->arguments[0],p_stack_level,false);
  835. if (ret<0)
  836. return ERR_PARSE_ERROR;
  837. } else {
  838. ret=GDFunction::ADDR_TYPE_NIL << GDFunction::ADDR_BITS;
  839. }
  840. codegen.opcodes.push_back(GDFunction::OPCODE_RETURN);
  841. codegen.opcodes.push_back(ret);
  842. } break;
  843. }
  844. } break;
  845. case GDParser::Node::TYPE_ASSERT: {
  846. // try subblocks
  847. const GDParser::AssertNode *as = static_cast<const GDParser::AssertNode*>(s);
  848. int ret = _parse_expression(codegen,as->condition,p_stack_level,false);
  849. if (ret<0)
  850. return ERR_PARSE_ERROR;
  851. codegen.opcodes.push_back(GDFunction::OPCODE_ASSERT);
  852. codegen.opcodes.push_back(ret);
  853. } break;
  854. case GDParser::Node::TYPE_BREAKPOINT: {
  855. // try subblocks
  856. codegen.opcodes.push_back(GDFunction::OPCODE_BREAKPOINT);
  857. } break;
  858. case GDParser::Node::TYPE_LOCAL_VAR: {
  859. const GDParser::LocalVarNode *lv = static_cast<const GDParser::LocalVarNode*>(s);
  860. codegen.add_stack_identifier(lv->name,p_stack_level++);
  861. codegen.alloc_stack(p_stack_level);
  862. new_identifiers++;
  863. } break;
  864. default: {
  865. //expression
  866. int ret = _parse_expression(codegen,s,p_stack_level,true);
  867. if (ret<0)
  868. return ERR_PARSE_ERROR;
  869. } break;
  870. }
  871. }
  872. codegen.pop_stack_identifiers();
  873. return OK;
  874. }
  875. Error GDCompiler::_parse_function(GDScript *p_script,const GDParser::ClassNode *p_class,const GDParser::FunctionNode *p_func,bool p_for_ready) {
  876. Vector<int> bytecode;
  877. CodeGen codegen;
  878. codegen.class_node=p_class;
  879. codegen.script=p_script;
  880. codegen.function_node=p_func;
  881. codegen.stack_max=0;
  882. codegen.current_line=0;
  883. codegen.call_max=0;
  884. codegen.debug_stack=ScriptDebugger::get_singleton()!=NULL;
  885. Vector<StringName> argnames;
  886. int stack_level=0;
  887. if (p_func) {
  888. for(int i=0;i<p_func->arguments.size();i++) {
  889. int idx = i;
  890. codegen.add_stack_identifier(p_func->arguments[i],i);
  891. #ifdef TOOLS_ENABLED
  892. argnames.push_back(p_func->arguments[i]);
  893. #endif
  894. }
  895. stack_level=p_func->arguments.size();
  896. }
  897. codegen.alloc_stack(stack_level);
  898. /* Parse initializer -if applies- */
  899. bool is_initializer=!p_for_ready && !p_func;
  900. if (is_initializer || (p_func && String(p_func->name)=="_init")) {
  901. //parse initializer for class members
  902. if (!p_func && p_class->extends_used && p_script->native.is_null()){
  903. //call implicit parent constructor
  904. codegen.opcodes.push_back(GDFunction::OPCODE_CALL_SELF_BASE);
  905. codegen.opcodes.push_back(codegen.get_name_map_pos("_init"));
  906. codegen.opcodes.push_back(0);
  907. codegen.opcodes.push_back((GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)|0);
  908. }
  909. Error err = _parse_block(codegen,p_class->initializer,stack_level);
  910. if (err)
  911. return err;
  912. is_initializer=true;
  913. }
  914. if (p_for_ready || (p_func && String(p_func->name)=="_ready")) {
  915. //parse initializer for class members
  916. if (p_class->ready->statements.size()) {
  917. Error err = _parse_block(codegen,p_class->ready,stack_level);
  918. if (err)
  919. return err;
  920. }
  921. }
  922. /* Parse default argument code -if applies- */
  923. Vector<int> defarg_addr;
  924. StringName func_name;
  925. if (p_func) {
  926. if (p_func->default_values.size()) {
  927. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_TO_DEF_ARGUMENT);
  928. defarg_addr.push_back(codegen.opcodes.size());
  929. for(int i=0;i<p_func->default_values.size();i++) {
  930. _parse_expression(codegen,p_func->default_values[i],stack_level,true);
  931. defarg_addr.push_back(codegen.opcodes.size());
  932. }
  933. defarg_addr.invert();
  934. }
  935. Error err = _parse_block(codegen,p_func->body,stack_level);
  936. if (err)
  937. return err;
  938. func_name=p_func->name;
  939. } else {
  940. if (p_for_ready)
  941. func_name="_ready";
  942. else
  943. func_name="_init";
  944. }
  945. codegen.opcodes.push_back(GDFunction::OPCODE_END);
  946. GDFunction *gdfunc=NULL;
  947. //if (String(p_func->name)=="") { //initializer func
  948. // gdfunc = &p_script->initializer;
  949. //} else { //regular func
  950. p_script->member_functions[func_name]=memnew(GDFunction);
  951. gdfunc = p_script->member_functions[func_name];
  952. //}
  953. if (p_func)
  954. gdfunc->_static=p_func->_static;
  955. #ifdef TOOLS_ENABLED
  956. gdfunc->arg_names=argnames;
  957. #endif
  958. //constants
  959. if (codegen.constant_map.size()) {
  960. gdfunc->_constant_count=codegen.constant_map.size();
  961. gdfunc->constants.resize(codegen.constant_map.size());
  962. gdfunc->_constants_ptr=&gdfunc->constants[0];
  963. const Variant *K=NULL;
  964. while((K=codegen.constant_map.next(K))) {
  965. int idx = codegen.constant_map[*K];
  966. gdfunc->constants[idx]=*K;
  967. }
  968. } else {
  969. gdfunc->_constants_ptr=NULL;
  970. gdfunc->_constant_count=0;
  971. }
  972. //global names
  973. if (codegen.name_map.size()) {
  974. gdfunc->global_names.resize(codegen.name_map.size());
  975. gdfunc->_global_names_ptr = &gdfunc->global_names[0];
  976. for(Map<StringName,int>::Element *E=codegen.name_map.front();E;E=E->next()) {
  977. gdfunc->global_names[E->get()]=E->key();
  978. }
  979. gdfunc->_global_names_count=gdfunc->global_names.size();
  980. } else {
  981. gdfunc->_global_names_ptr = NULL;
  982. gdfunc->_global_names_count =0;
  983. }
  984. if (codegen.opcodes.size()) {
  985. gdfunc->code=codegen.opcodes;
  986. gdfunc->_code_ptr=&gdfunc->code[0];
  987. gdfunc->_code_size=codegen.opcodes.size();
  988. } else {
  989. gdfunc->_code_ptr=NULL;
  990. gdfunc->_code_size=0;
  991. }
  992. if (defarg_addr.size()) {
  993. gdfunc->default_arguments=defarg_addr;
  994. gdfunc->_default_arg_count=defarg_addr.size()-1;
  995. gdfunc->_default_arg_ptr=&gdfunc->default_arguments[0];
  996. } else {
  997. gdfunc->_default_arg_count=0;
  998. gdfunc->_default_arg_ptr=NULL;
  999. }
  1000. gdfunc->_argument_count=p_func ? p_func->arguments.size() : 0;
  1001. gdfunc->_stack_size=codegen.stack_max;
  1002. gdfunc->_call_size=codegen.call_max;
  1003. gdfunc->name=func_name;
  1004. #ifdef DEBUG_ENABLED
  1005. if (ScriptDebugger::get_singleton()){
  1006. String signature;
  1007. //path
  1008. if (p_script->get_path()!=String())
  1009. signature+=p_script->get_path();
  1010. //loc
  1011. if (p_func) {
  1012. signature+="::"+itos(p_func->body->line);
  1013. } else {
  1014. signature+="::0";
  1015. }
  1016. //funciton and class
  1017. if (p_class->name) {
  1018. signature+="::"+String(p_class->name)+"."+String(func_name);;
  1019. } else {
  1020. signature+="::"+String(func_name);
  1021. }
  1022. gdfunc->profile.signature=signature;
  1023. }
  1024. #endif
  1025. gdfunc->_script=p_script;
  1026. gdfunc->source=source;
  1027. #ifdef DEBUG_ENABLED
  1028. {
  1029. gdfunc->func_cname=(String(source)+" - "+String(func_name)).utf8();
  1030. gdfunc->_func_cname=gdfunc->func_cname.get_data();
  1031. }
  1032. #endif
  1033. if (p_func) {
  1034. gdfunc->_initial_line=p_func->line;
  1035. } else {
  1036. gdfunc->_initial_line=0;
  1037. }
  1038. if (codegen.debug_stack)
  1039. gdfunc->stack_debug=codegen.stack_debug;
  1040. if (is_initializer)
  1041. p_script->initializer=gdfunc;
  1042. return OK;
  1043. }
  1044. Error GDCompiler::_parse_class(GDScript *p_script, GDScript *p_owner, const GDParser::ClassNode *p_class, bool p_keep_state) {
  1045. Map<StringName,Ref<GDScript> > old_subclasses;
  1046. if (p_keep_state) {
  1047. old_subclasses=p_script->subclasses;
  1048. }
  1049. p_script->native=Ref<GDNativeClass>();
  1050. p_script->base=Ref<GDScript>();
  1051. p_script->_base=NULL;
  1052. p_script->members.clear();
  1053. p_script->constants.clear();
  1054. for (Map<StringName,GDFunction*>::Element *E=p_script->member_functions.front();E;E=E->next()) {
  1055. memdelete(E->get());
  1056. }
  1057. p_script->member_functions.clear();
  1058. p_script->member_indices.clear();
  1059. p_script->member_info.clear();
  1060. p_script->initializer=NULL;
  1061. p_script->subclasses.clear();
  1062. p_script->_owner=p_owner;
  1063. p_script->tool=p_class->tool;
  1064. p_script->name=p_class->name;
  1065. int index_from=0;
  1066. Ref<GDNativeClass> native;
  1067. if (p_class->extends_used) {
  1068. //do inheritance
  1069. String path = p_class->extends_file;
  1070. Ref<GDScript> script;
  1071. if (path!="") {
  1072. //path (and optionally subclasses)
  1073. if (path.is_rel_path()) {
  1074. String base;
  1075. if (p_owner) {
  1076. GDScript *current_class = p_owner;
  1077. while (current_class != NULL) {
  1078. base=current_class->get_path();
  1079. if (base=="")
  1080. current_class = current_class->_owner;
  1081. else
  1082. break;
  1083. }
  1084. }
  1085. else {
  1086. base = p_script->get_path();
  1087. }
  1088. if (base=="" || base.is_rel_path()) {
  1089. _set_error("Could not resolve relative path for parent class: "+path,p_class);
  1090. return ERR_FILE_NOT_FOUND;
  1091. }
  1092. path=base.get_base_dir().plus_file(path).simplify_path();
  1093. }
  1094. script = ResourceLoader::load(path);
  1095. if (script.is_null()) {
  1096. _set_error("Could not load base class: "+path,p_class);
  1097. return ERR_FILE_NOT_FOUND;
  1098. }
  1099. if (!script->valid) {
  1100. _set_error("Script not fully loaded (cyclic preload?): "+path,p_class);
  1101. return ERR_BUSY;
  1102. }
  1103. //print_line("EXTENDS PATH: "+path+" script is "+itos(script.is_valid())+" indices is "+itos(script->member_indices.size())+" valid? "+itos(script->valid));
  1104. if (p_class->extends_class.size()) {
  1105. for(int i=0;i<p_class->extends_class.size();i++) {
  1106. String sub = p_class->extends_class[i];
  1107. if (script->subclasses.has(sub)) {
  1108. script=script->subclasses[sub];
  1109. } else {
  1110. _set_error("Could not find subclass: "+sub,p_class);
  1111. return ERR_FILE_NOT_FOUND;
  1112. }
  1113. }
  1114. }
  1115. } else {
  1116. ERR_FAIL_COND_V(p_class->extends_class.size()==0,ERR_BUG);
  1117. //look around for the subclasses
  1118. String base=p_class->extends_class[0];
  1119. GDScript *p = p_owner;
  1120. Ref<GDScript> base_class;
  1121. while(p) {
  1122. if (p->subclasses.has(base)) {
  1123. base_class=p->subclasses[base];
  1124. break;
  1125. }
  1126. p=p->_owner;
  1127. }
  1128. if (base_class.is_valid()) {
  1129. for(int i=1;i<p_class->extends_class.size();i++) {
  1130. String subclass=p_class->extends_class[i];
  1131. if (base_class->subclasses.has(subclass)) {
  1132. base_class=base_class->subclasses[subclass];
  1133. } else {
  1134. _set_error("Could not find subclass: "+subclass,p_class);
  1135. return ERR_FILE_NOT_FOUND;
  1136. }
  1137. }
  1138. script=base_class;
  1139. } else {
  1140. if (p_class->extends_class.size()>1) {
  1141. _set_error("Invalid inheritance (unknown class+subclasses)",p_class);
  1142. return ERR_FILE_NOT_FOUND;
  1143. }
  1144. //if not found, try engine classes
  1145. if (!GDScriptLanguage::get_singleton()->get_global_map().has(base)) {
  1146. _set_error("Unknown class: '"+base+"'",p_class);
  1147. return ERR_FILE_NOT_FOUND;
  1148. }
  1149. int base_idx = GDScriptLanguage::get_singleton()->get_global_map()[base];
  1150. native = GDScriptLanguage::get_singleton()->get_global_array()[base_idx];
  1151. if (!native.is_valid()) {
  1152. _set_error("Global not a class: '"+base+"'",p_class);
  1153. return ERR_FILE_NOT_FOUND;
  1154. }
  1155. }
  1156. }
  1157. if (script.is_valid()) {
  1158. p_script->base=script;
  1159. p_script->_base=p_script->base.ptr();
  1160. p_script->member_indices=script->member_indices;
  1161. } else if (native.is_valid()) {
  1162. p_script->native=native;
  1163. } else {
  1164. _set_error("Could not determine inheritance",p_class);
  1165. return ERR_FILE_NOT_FOUND;
  1166. }
  1167. }
  1168. //print_line("Script: "+p_script->get_path()+" indices: "+itos(p_script->member_indices.size()));
  1169. for(int i=0;i<p_class->variables.size();i++) {
  1170. StringName name = p_class->variables[i].identifier;
  1171. if (p_script->member_indices.has(name)) {
  1172. _set_error("Member '"+name+"' already exists (in current or parent class)",p_class);
  1173. return ERR_ALREADY_EXISTS;
  1174. }
  1175. if (p_class->variables[i]._export.type!=Variant::NIL) {
  1176. p_script->member_info[name]=p_class->variables[i]._export;
  1177. #ifdef TOOLS_ENABLED
  1178. if (p_class->variables[i].default_value.get_type()!=Variant::NIL) {
  1179. p_script->member_default_values[name]=p_class->variables[i].default_value;
  1180. }
  1181. #endif
  1182. } else {
  1183. p_script->member_info[name]=PropertyInfo(Variant::NIL,name,PROPERTY_HINT_NONE,"",PROPERTY_USAGE_SCRIPT_VARIABLE);
  1184. }
  1185. //int new_idx = p_script->member_indices.size();
  1186. GDScript::MemberInfo minfo;
  1187. minfo.index = p_script->member_indices.size();
  1188. minfo.setter = p_class->variables[i].setter;
  1189. minfo.getter = p_class->variables[i].getter;
  1190. p_script->member_indices[name]=minfo;
  1191. p_script->members.insert(name);
  1192. }
  1193. for(int i=0;i<p_class->constant_expressions.size();i++) {
  1194. StringName name = p_class->constant_expressions[i].identifier;
  1195. ERR_CONTINUE( p_class->constant_expressions[i].expression->type!=GDParser::Node::TYPE_CONSTANT );
  1196. GDParser::ConstantNode *constant = static_cast<GDParser::ConstantNode*>(p_class->constant_expressions[i].expression);
  1197. p_script->constants.insert(name,constant->value);
  1198. //p_script->constants[constant->value].make_const();
  1199. }
  1200. for(int i=0;i<p_class->_signals.size();i++) {
  1201. StringName name = p_class->_signals[i].name;
  1202. GDScript *c = p_script;
  1203. while(c) {
  1204. if (c->_signals.has(name)) {
  1205. _set_error("Signal '"+name+"' redefined (in current or parent class)",p_class);
  1206. return ERR_ALREADY_EXISTS;
  1207. }
  1208. if (c->base.is_valid()) {
  1209. c=c->base.ptr();
  1210. } else {
  1211. c=NULL;
  1212. }
  1213. }
  1214. if (native.is_valid()) {
  1215. if (ObjectTypeDB::has_signal(native->get_name(),name)) {
  1216. _set_error("Signal '"+name+"' redefined (original in native class '"+String(native->get_name())+"')",p_class);
  1217. return ERR_ALREADY_EXISTS;
  1218. }
  1219. }
  1220. p_script->_signals[name]=p_class->_signals[i].arguments;
  1221. }
  1222. //parse sub-classes
  1223. for(int i=0;i<p_class->subclasses.size();i++) {
  1224. StringName name = p_class->subclasses[i]->name;
  1225. Ref<GDScript> subclass;
  1226. if (old_subclasses.has(name)) {
  1227. subclass=old_subclasses[name];
  1228. } else {
  1229. subclass.instance();
  1230. }
  1231. Error err = _parse_class(subclass.ptr(),p_script,p_class->subclasses[i],p_keep_state);
  1232. if (err)
  1233. return err;
  1234. p_script->constants.insert(name,subclass); //once parsed, goes to the list of constants
  1235. p_script->subclasses.insert(name,subclass);
  1236. }
  1237. //parse methods
  1238. bool has_initializer=false;
  1239. bool has_ready=false;
  1240. for(int i=0;i<p_class->functions.size();i++) {
  1241. if (!has_initializer && p_class->functions[i]->name=="_init")
  1242. has_initializer=true;
  1243. if (!has_ready && p_class->functions[i]->name=="_ready")
  1244. has_ready=true;
  1245. Error err = _parse_function(p_script,p_class,p_class->functions[i]);
  1246. if (err)
  1247. return err;
  1248. }
  1249. //parse static methods
  1250. for(int i=0;i<p_class->static_functions.size();i++) {
  1251. Error err = _parse_function(p_script,p_class,p_class->static_functions[i]);
  1252. if (err)
  1253. return err;
  1254. }
  1255. if (!has_initializer) {
  1256. //create a constructor
  1257. Error err = _parse_function(p_script,p_class,NULL);
  1258. if (err)
  1259. return err;
  1260. }
  1261. if (!has_ready && p_class->ready->statements.size()) {
  1262. //create a constructor
  1263. Error err = _parse_function(p_script,p_class,NULL,true);
  1264. if (err)
  1265. return err;
  1266. }
  1267. #ifdef DEBUG_ENABLED
  1268. //validate setters/getters if debug is enabled
  1269. for(int i=0;i<p_class->variables.size();i++) {
  1270. if (p_class->variables[i].setter) {
  1271. const Map<StringName,GDFunction*>::Element *E=p_script->get_member_functions().find(p_class->variables[i].setter);
  1272. if (!E) {
  1273. _set_error("Setter function '"+String(p_class->variables[i].setter)+"' not found in class.",NULL);
  1274. err_line=p_class->variables[i].line;
  1275. err_column=0;
  1276. return ERR_PARSE_ERROR;
  1277. }
  1278. if (E->get()->is_static()) {
  1279. _set_error("Setter function '"+String(p_class->variables[i].setter)+"' is static.",NULL);
  1280. err_line=p_class->variables[i].line;
  1281. err_column=0;
  1282. return ERR_PARSE_ERROR;
  1283. }
  1284. }
  1285. if (p_class->variables[i].getter) {
  1286. const Map<StringName,GDFunction*>::Element *E=p_script->get_member_functions().find(p_class->variables[i].getter);
  1287. if (!E) {
  1288. _set_error("Getter function '"+String(p_class->variables[i].getter)+"' not found in class.",NULL);
  1289. err_line=p_class->variables[i].line;
  1290. err_column=0;
  1291. return ERR_PARSE_ERROR;
  1292. }
  1293. if (E->get()->is_static()) {
  1294. _set_error("Getter function '"+String(p_class->variables[i].getter)+"' is static.",NULL);
  1295. err_line=p_class->variables[i].line;
  1296. err_column=0;
  1297. return ERR_PARSE_ERROR;
  1298. }
  1299. }
  1300. }
  1301. //validate instances if keeping state
  1302. if (p_keep_state) {
  1303. print_line("RELOAD KEEP "+p_script->path);
  1304. for (Set<Object*>::Element *E=p_script->instances.front();E;) {
  1305. Set<Object*>::Element *N = E->next();
  1306. ScriptInstance *si = E->get()->get_script_instance();
  1307. if (si->is_placeholder()) {
  1308. #ifdef TOOLS_ENABLED
  1309. PlaceHolderScriptInstance *psi = static_cast<PlaceHolderScriptInstance*>(si);
  1310. if (p_script->is_tool()) {
  1311. //re-create as an instance
  1312. p_script->placeholders.erase(psi); //remove placeholder
  1313. GDInstance* instance = memnew( GDInstance );
  1314. instance->base_ref=E->get()->cast_to<Reference>();
  1315. instance->members.resize(p_script->member_indices.size());
  1316. instance->script=Ref<GDScript>(p_script);
  1317. instance->owner=E->get();
  1318. //needed for hot reloading
  1319. for(Map<StringName,GDScript::MemberInfo>::Element *E=p_script->member_indices.front();E;E=E->next()) {
  1320. instance->member_indices_cache[E->key()]=E->get().index;
  1321. }
  1322. instance->owner->set_script_instance(instance);
  1323. /* STEP 2, INITIALIZE AND CONSRTUCT */
  1324. Variant::CallError ce;
  1325. p_script->initializer->call(instance,NULL,0,ce);
  1326. if (ce.error!=Variant::CallError::CALL_OK) {
  1327. //well, tough luck, not goinna do anything here
  1328. }
  1329. }
  1330. #endif
  1331. } else {
  1332. GDInstance *gi = static_cast<GDInstance*>(si);
  1333. gi->reload_members();
  1334. }
  1335. E=N;
  1336. }
  1337. }
  1338. #endif
  1339. p_script->valid=true;
  1340. return OK;
  1341. }
  1342. Error GDCompiler::compile(const GDParser *p_parser,GDScript *p_script,bool p_keep_state) {
  1343. err_line=-1;
  1344. err_column=-1;
  1345. error="";
  1346. parser=p_parser;
  1347. const GDParser::Node* root = parser->get_parse_tree();
  1348. ERR_FAIL_COND_V(root->type!=GDParser::Node::TYPE_CLASS,ERR_INVALID_DATA);
  1349. source=p_script->get_path();
  1350. Error err = _parse_class(p_script,NULL,static_cast<const GDParser::ClassNode*>(root),p_keep_state);
  1351. if (err)
  1352. return err;
  1353. return OK;
  1354. }
  1355. String GDCompiler::get_error() const {
  1356. return error;
  1357. }
  1358. int GDCompiler::get_error_line() const{
  1359. return err_line;
  1360. }
  1361. int GDCompiler::get_error_column() const{
  1362. return err_column;
  1363. }
  1364. GDCompiler::GDCompiler()
  1365. {
  1366. }