gd_compiler.cpp 53 KB

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