gd_compiler.cpp 51 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678
  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-2014 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. index=codegen.get_name_map_pos(static_cast<GDParser::IdentifierNode*>(on->arguments[1])->name);
  417. } else {
  418. if (on->arguments[1]->type==GDParser::Node::TYPE_CONSTANT && static_cast<const GDParser::ConstantNode*>(on->arguments[1])->value.get_type()==Variant::STRING) {
  419. //also, somehow, named (speed up anyway)
  420. StringName name = static_cast<const GDParser::ConstantNode*>(on->arguments[1])->value;
  421. index=codegen.get_name_map_pos(name);
  422. named=true;
  423. } else {
  424. //regular indexing
  425. if (from&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  426. slevel++;
  427. codegen.alloc_stack(slevel);
  428. }
  429. index = _parse_expression(codegen,on->arguments[1],slevel);
  430. if (index<0)
  431. return index;
  432. }
  433. }
  434. codegen.opcodes.push_back(named?GDFunction::OPCODE_GET_NAMED:GDFunction::OPCODE_GET); // perform operator
  435. codegen.opcodes.push_back(from); // argument 1
  436. codegen.opcodes.push_back(index); // argument 2 (unary only takes one parameter)
  437. } break;
  438. case GDParser::OperatorNode::OP_AND: {
  439. // AND operator with early out on failure
  440. int res = _parse_expression(codegen,on->arguments[0],p_stack_level);
  441. if (res<0)
  442. return res;
  443. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_IF_NOT);
  444. codegen.opcodes.push_back(res);
  445. int jump_fail_pos=codegen.opcodes.size();
  446. codegen.opcodes.push_back(0);
  447. res = _parse_expression(codegen,on->arguments[1],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_pos2=codegen.opcodes.size();
  453. codegen.opcodes.push_back(0);
  454. codegen.alloc_stack(p_stack_level); //it will be used..
  455. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN_TRUE);
  456. codegen.opcodes.push_back(p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  457. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  458. codegen.opcodes.push_back(codegen.opcodes.size()+3);
  459. codegen.opcodes[jump_fail_pos]=codegen.opcodes.size();
  460. codegen.opcodes[jump_fail_pos2]=codegen.opcodes.size();
  461. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN_FALSE);
  462. codegen.opcodes.push_back(p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  463. return p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS;
  464. } break;
  465. case GDParser::OperatorNode::OP_OR: {
  466. // OR operator with early out on success
  467. int res = _parse_expression(codegen,on->arguments[0],p_stack_level);
  468. if (res<0)
  469. return res;
  470. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_IF);
  471. codegen.opcodes.push_back(res);
  472. int jump_success_pos=codegen.opcodes.size();
  473. codegen.opcodes.push_back(0);
  474. res = _parse_expression(codegen,on->arguments[1],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_pos2=codegen.opcodes.size();
  480. codegen.opcodes.push_back(0);
  481. codegen.alloc_stack(p_stack_level); //it will be used..
  482. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN_FALSE);
  483. codegen.opcodes.push_back(p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  484. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  485. codegen.opcodes.push_back(codegen.opcodes.size()+3);
  486. codegen.opcodes[jump_success_pos]=codegen.opcodes.size();
  487. codegen.opcodes[jump_success_pos2]=codegen.opcodes.size();
  488. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN_TRUE);
  489. codegen.opcodes.push_back(p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  490. return p_stack_level|GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS;
  491. } break;
  492. //unary operators
  493. case GDParser::OperatorNode::OP_NEG: { if (!_create_unary_operator(codegen,on,Variant::OP_NEGATE,p_stack_level)) return -1;} break;
  494. case GDParser::OperatorNode::OP_NOT: { if (!_create_unary_operator(codegen,on,Variant::OP_NOT,p_stack_level)) return -1;} break;
  495. case GDParser::OperatorNode::OP_BIT_INVERT: { if (!_create_unary_operator(codegen,on,Variant::OP_BIT_NEGATE,p_stack_level)) return -1;} break;
  496. case GDParser::OperatorNode::OP_PREINC: { } break; //?
  497. case GDParser::OperatorNode::OP_PREDEC: { } break;
  498. case GDParser::OperatorNode::OP_INC: { } break;
  499. case GDParser::OperatorNode::OP_DEC: { } break;
  500. //binary operators (in precedence order)
  501. case GDParser::OperatorNode::OP_IN: { if (!_create_binary_operator(codegen,on,Variant::OP_IN,p_stack_level)) return -1;} break;
  502. case GDParser::OperatorNode::OP_EQUAL: { if (!_create_binary_operator(codegen,on,Variant::OP_EQUAL,p_stack_level)) return -1;} break;
  503. case GDParser::OperatorNode::OP_NOT_EQUAL: { if (!_create_binary_operator(codegen,on,Variant::OP_NOT_EQUAL,p_stack_level)) return -1;} break;
  504. case GDParser::OperatorNode::OP_LESS: { if (!_create_binary_operator(codegen,on,Variant::OP_LESS,p_stack_level)) return -1;} break;
  505. case GDParser::OperatorNode::OP_LESS_EQUAL: { if (!_create_binary_operator(codegen,on,Variant::OP_LESS_EQUAL,p_stack_level)) return -1;} break;
  506. case GDParser::OperatorNode::OP_GREATER: { if (!_create_binary_operator(codegen,on,Variant::OP_GREATER,p_stack_level)) return -1;} break;
  507. case GDParser::OperatorNode::OP_GREATER_EQUAL: { if (!_create_binary_operator(codegen,on,Variant::OP_GREATER_EQUAL,p_stack_level)) return -1;} break;
  508. case GDParser::OperatorNode::OP_ADD: { if (!_create_binary_operator(codegen,on,Variant::OP_ADD,p_stack_level)) return -1;} break;
  509. case GDParser::OperatorNode::OP_SUB: { if (!_create_binary_operator(codegen,on,Variant::OP_SUBSTRACT,p_stack_level)) return -1;} break;
  510. case GDParser::OperatorNode::OP_MUL: { if (!_create_binary_operator(codegen,on,Variant::OP_MULTIPLY,p_stack_level)) return -1;} break;
  511. case GDParser::OperatorNode::OP_DIV: { if (!_create_binary_operator(codegen,on,Variant::OP_DIVIDE,p_stack_level)) return -1;} break;
  512. case GDParser::OperatorNode::OP_MOD: { if (!_create_binary_operator(codegen,on,Variant::OP_MODULE,p_stack_level)) return -1;} break;
  513. //case GDParser::OperatorNode::OP_SHIFT_LEFT: { if (!_create_binary_operator(codegen,on,Variant::OP_SHIFT_LEFT,p_stack_level)) return -1;} break;
  514. //case GDParser::OperatorNode::OP_SHIFT_RIGHT: { if (!_create_binary_operator(codegen,on,Variant::OP_SHIFT_RIGHT,p_stack_level)) return -1;} break;
  515. case GDParser::OperatorNode::OP_BIT_AND: { if (!_create_binary_operator(codegen,on,Variant::OP_BIT_AND,p_stack_level)) return -1;} break;
  516. case GDParser::OperatorNode::OP_BIT_OR: { if (!_create_binary_operator(codegen,on,Variant::OP_BIT_OR,p_stack_level)) return -1;} break;
  517. case GDParser::OperatorNode::OP_BIT_XOR: { if (!_create_binary_operator(codegen,on,Variant::OP_BIT_XOR,p_stack_level)) return -1;} break;
  518. //shift
  519. case GDParser::OperatorNode::OP_SHIFT_LEFT: { if (!_create_binary_operator(codegen,on,Variant::OP_SHIFT_LEFT,p_stack_level)) return -1;} break;
  520. case GDParser::OperatorNode::OP_SHIFT_RIGHT: { if (!_create_binary_operator(codegen,on,Variant::OP_SHIFT_RIGHT,p_stack_level)) return -1;} break;
  521. //assignment operators
  522. case GDParser::OperatorNode::OP_ASSIGN_ADD:
  523. case GDParser::OperatorNode::OP_ASSIGN_SUB:
  524. case GDParser::OperatorNode::OP_ASSIGN_MUL:
  525. case GDParser::OperatorNode::OP_ASSIGN_DIV:
  526. case GDParser::OperatorNode::OP_ASSIGN_MOD:
  527. case GDParser::OperatorNode::OP_ASSIGN_SHIFT_LEFT:
  528. case GDParser::OperatorNode::OP_ASSIGN_SHIFT_RIGHT:
  529. case GDParser::OperatorNode::OP_ASSIGN_BIT_AND:
  530. case GDParser::OperatorNode::OP_ASSIGN_BIT_OR:
  531. case GDParser::OperatorNode::OP_ASSIGN_BIT_XOR:
  532. case GDParser::OperatorNode::OP_INIT_ASSIGN:
  533. case GDParser::OperatorNode::OP_ASSIGN: {
  534. ERR_FAIL_COND_V(on->arguments.size()!=2,-1);
  535. 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)) {
  536. //SET (chained) MODE!!
  537. int slevel=p_stack_level;
  538. GDParser::OperatorNode* op = static_cast<GDParser::OperatorNode*>(on->arguments[0]);
  539. /* Find chain of sets */
  540. List<GDParser::OperatorNode*> chain;
  541. {
  542. //create get/set chain
  543. GDParser::OperatorNode* n=op;
  544. while(true) {
  545. chain.push_back(n);
  546. if (n->arguments[0]->type!=GDParser::Node::TYPE_OPERATOR)
  547. break;
  548. n = static_cast<GDParser::OperatorNode*>(n->arguments[0]);
  549. if (n->op!=GDParser::OperatorNode::OP_INDEX && n->op!=GDParser::OperatorNode::OP_INDEX_NAMED)
  550. break;
  551. }
  552. }
  553. /* Chain of gets */
  554. //get at (potential) root stack pos, so it can be returned
  555. int prev_pos = _parse_expression(codegen,chain.back()->get()->arguments[0],slevel);
  556. if (prev_pos<0)
  557. return prev_pos;
  558. int retval=prev_pos;
  559. //print_line("retval: "+itos(retval));
  560. if (retval&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  561. slevel++;
  562. codegen.alloc_stack(slevel);
  563. }
  564. Vector<int> setchain;
  565. int prev_key_idx=-1;
  566. for(List<GDParser::OperatorNode*>::Element *E=chain.back();E;E=E->prev()) {
  567. if (E==chain.front()) //ignore first
  568. break;
  569. bool named = E->get()->op==GDParser::OperatorNode::OP_INDEX_NAMED;
  570. int key_idx;
  571. if (named) {
  572. key_idx = codegen.get_name_map_pos(static_cast<const GDParser::IdentifierNode*>(E->get()->arguments[1])->name);
  573. //printf("named key %x\n",key_idx);
  574. } else {
  575. if (prev_pos&(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)) {
  576. slevel++;
  577. codegen.alloc_stack(slevel);
  578. }
  579. GDParser::Node *key = E->get()->arguments[1];
  580. key_idx = _parse_expression(codegen,key,slevel);
  581. //printf("expr key %x\n",key_idx);
  582. //stack was raised here if retval was stack but..
  583. }
  584. if (key_idx<0)
  585. return key_idx;
  586. codegen.opcodes.push_back(named ? GDFunction::OPCODE_GET_NAMED : GDFunction::OPCODE_GET);
  587. codegen.opcodes.push_back(prev_pos);
  588. codegen.opcodes.push_back(key_idx);
  589. slevel++;
  590. codegen.alloc_stack(slevel);
  591. int dst_pos = (GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)|slevel;
  592. codegen.opcodes.push_back(dst_pos);
  593. //add in reverse order, since it will be reverted
  594. setchain.push_back(dst_pos);
  595. setchain.push_back(key_idx);
  596. setchain.push_back(prev_pos);
  597. setchain.push_back(named ? GDFunction::OPCODE_SET_NAMED : GDFunction::OPCODE_SET);
  598. prev_pos=dst_pos;
  599. prev_key_idx=key_idx;
  600. }
  601. setchain.invert();
  602. int set_index;
  603. bool named=false;
  604. if (static_cast<const GDParser::OperatorNode*>(op)->op==GDParser::OperatorNode::OP_INDEX_NAMED) {
  605. set_index=codegen.get_name_map_pos(static_cast<const GDParser::IdentifierNode*>(op->arguments[1])->name);
  606. named=true;
  607. } else {
  608. set_index = _parse_expression(codegen,op->arguments[1],slevel+1);
  609. named=false;
  610. }
  611. if (set_index<0)
  612. return set_index;
  613. if (set_index&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  614. slevel++;
  615. codegen.alloc_stack(slevel);
  616. }
  617. int set_value = _parse_assign_right_expression(codegen,on,slevel+1);
  618. if (set_value<0)
  619. return set_value;
  620. codegen.opcodes.push_back(named?GDFunction::OPCODE_SET_NAMED:GDFunction::OPCODE_SET);
  621. codegen.opcodes.push_back(prev_pos);
  622. codegen.opcodes.push_back(set_index);
  623. codegen.opcodes.push_back(set_value);
  624. for(int i=0;i<setchain.size();i+=4) {
  625. codegen.opcodes.push_back(setchain[i+0]);
  626. codegen.opcodes.push_back(setchain[i+1]);
  627. codegen.opcodes.push_back(setchain[i+2]);
  628. codegen.opcodes.push_back(setchain[i+3]);
  629. }
  630. return retval;
  631. } else {
  632. //ASSIGNMENT MODE!!
  633. int slevel = p_stack_level;
  634. int dst_address_a = _parse_expression(codegen,on->arguments[0],slevel,false,on->op==GDParser::OperatorNode::OP_INIT_ASSIGN);
  635. if (dst_address_a<0)
  636. return -1;
  637. if (dst_address_a&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS) {
  638. slevel++;
  639. codegen.alloc_stack(slevel);
  640. }
  641. int src_address_b = _parse_assign_right_expression(codegen,on,slevel);
  642. if (src_address_b<0)
  643. return -1;
  644. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN); // perform operator
  645. codegen.opcodes.push_back(dst_address_a); // argument 1
  646. codegen.opcodes.push_back(src_address_b); // argument 2 (unary only takes one parameter)
  647. return dst_address_a; //if anything, returns wathever was assigned or correct stack position
  648. }
  649. } break;
  650. case GDParser::OperatorNode::OP_EXTENDS: {
  651. ERR_FAIL_COND_V(on->arguments.size()!=2,false);
  652. int slevel = p_stack_level;
  653. int src_address_a = _parse_expression(codegen,on->arguments[0],slevel);
  654. if (src_address_a<0)
  655. return -1;
  656. if (src_address_a&GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)
  657. slevel++; //uses stack for return, increase stack
  658. int src_address_b = _parse_expression(codegen,on->arguments[1],slevel);
  659. if (src_address_b<0)
  660. return -1;
  661. codegen.opcodes.push_back(GDFunction::OPCODE_EXTENDS_TEST); // perform operator
  662. codegen.opcodes.push_back(src_address_a); // argument 1
  663. codegen.opcodes.push_back(src_address_b); // argument 2 (unary only takes one parameter)
  664. } break;
  665. default: {
  666. ERR_EXPLAIN("Bug in bytecode compiler, unexpected operator #"+itos(on->op)+" in parse tree while parsing expression.");
  667. ERR_FAIL_V(0); //unreachable code
  668. } break;
  669. }
  670. int dst_addr=(p_stack_level)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  671. codegen.opcodes.push_back(dst_addr); // append the stack level as destination address of the opcode
  672. codegen.alloc_stack(p_stack_level);
  673. return dst_addr;
  674. } break;
  675. //TYPE_TYPE,
  676. default: {
  677. ERR_EXPLAIN("Bug in bytecode compiler, unexpected node in parse tree while parsing expression.");
  678. ERR_FAIL_V(-1); //unreachable code
  679. } break;
  680. }
  681. ERR_FAIL_V(-1); //unreachable code
  682. }
  683. Error GDCompiler::_parse_block(CodeGen& codegen,const GDParser::BlockNode *p_block,int p_stack_level,int p_break_addr,int p_continue_addr) {
  684. codegen.push_stack_identifiers();
  685. int new_identifiers=0;
  686. codegen.current_line=p_block->line;
  687. for(int i=0;i<p_block->statements.size();i++) {
  688. const GDParser::Node *s = p_block->statements[i];
  689. switch(s->type) {
  690. case GDParser::Node::TYPE_NEWLINE: {
  691. const GDParser::NewLineNode *nl = static_cast<const GDParser::NewLineNode*>(s);
  692. codegen.opcodes.push_back(GDFunction::OPCODE_LINE);
  693. codegen.opcodes.push_back(nl->line);
  694. codegen.current_line=nl->line;
  695. } break;
  696. case GDParser::Node::TYPE_CONTROL_FLOW: {
  697. // try subblocks
  698. const GDParser::ControlFlowNode *cf = static_cast<const GDParser::ControlFlowNode*>(s);
  699. switch(cf->cf_type) {
  700. case GDParser::ControlFlowNode::CF_IF: {
  701. #ifdef DEBUG_ENABLED
  702. codegen.opcodes.push_back(GDFunction::OPCODE_LINE);
  703. codegen.opcodes.push_back(cf->line);
  704. codegen.current_line=cf->line;
  705. #endif
  706. int ret = _parse_expression(codegen,cf->arguments[0],p_stack_level,false);
  707. if (ret<0)
  708. return ERR_PARSE_ERROR;
  709. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_IF_NOT);
  710. codegen.opcodes.push_back(ret);
  711. int else_addr=codegen.opcodes.size();
  712. codegen.opcodes.push_back(0); //temporary
  713. Error err = _parse_block(codegen,cf->body,p_stack_level,p_break_addr,p_continue_addr);
  714. if (err)
  715. return err;
  716. if (cf->body_else) {
  717. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  718. int end_addr=codegen.opcodes.size();
  719. codegen.opcodes.push_back(0);
  720. codegen.opcodes[else_addr]=codegen.opcodes.size();
  721. Error err = _parse_block(codegen,cf->body_else,p_stack_level,p_break_addr,p_continue_addr);
  722. if (err)
  723. return err;
  724. codegen.opcodes[end_addr]=codegen.opcodes.size();
  725. } else {
  726. //end without else
  727. codegen.opcodes[else_addr]=codegen.opcodes.size();
  728. }
  729. } break;
  730. case GDParser::ControlFlowNode::CF_FOR: {
  731. int slevel=p_stack_level;
  732. int iter_stack_pos=slevel;
  733. int iterator_pos = (slevel++)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  734. int counter_pos = (slevel++)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  735. int container_pos = (slevel++)|(GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS);
  736. codegen.alloc_stack(slevel);
  737. codegen.push_stack_identifiers();
  738. codegen.add_stack_identifier(static_cast<const GDParser::IdentifierNode*>(cf->arguments[0])->name,iter_stack_pos);
  739. int ret = _parse_expression(codegen,cf->arguments[1],slevel,false);
  740. if (ret<0)
  741. return ERR_COMPILATION_FAILED;
  742. //assign container
  743. codegen.opcodes.push_back(GDFunction::OPCODE_ASSIGN);
  744. codegen.opcodes.push_back(container_pos);
  745. codegen.opcodes.push_back(ret);
  746. //begin loop
  747. codegen.opcodes.push_back(GDFunction::OPCODE_ITERATE_BEGIN);
  748. codegen.opcodes.push_back(counter_pos);
  749. codegen.opcodes.push_back(container_pos);
  750. codegen.opcodes.push_back(codegen.opcodes.size()+4);
  751. codegen.opcodes.push_back(iterator_pos);
  752. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP); //skip code for next
  753. codegen.opcodes.push_back(codegen.opcodes.size()+8);
  754. //break loop
  755. int break_pos=codegen.opcodes.size();
  756. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP); //skip code for next
  757. codegen.opcodes.push_back(0); //skip code for next
  758. //next loop
  759. int continue_pos=codegen.opcodes.size();
  760. codegen.opcodes.push_back(GDFunction::OPCODE_ITERATE);
  761. codegen.opcodes.push_back(counter_pos);
  762. codegen.opcodes.push_back(container_pos);
  763. codegen.opcodes.push_back(break_pos);
  764. codegen.opcodes.push_back(iterator_pos);
  765. Error err = _parse_block(codegen,cf->body,slevel,break_pos,continue_pos);
  766. if (err)
  767. return err;
  768. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  769. codegen.opcodes.push_back(continue_pos);
  770. codegen.opcodes[break_pos+1]=codegen.opcodes.size();
  771. codegen.pop_stack_identifiers();
  772. } break;
  773. case GDParser::ControlFlowNode::CF_WHILE: {
  774. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  775. codegen.opcodes.push_back(codegen.opcodes.size()+3);
  776. int break_addr=codegen.opcodes.size();
  777. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  778. codegen.opcodes.push_back(0);
  779. int continue_addr=codegen.opcodes.size();
  780. int ret = _parse_expression(codegen,cf->arguments[0],p_stack_level,false);
  781. if (ret<0)
  782. return ERR_PARSE_ERROR;
  783. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_IF_NOT);
  784. codegen.opcodes.push_back(ret);
  785. codegen.opcodes.push_back(break_addr);
  786. Error err = _parse_block(codegen,cf->body,p_stack_level,break_addr,continue_addr);
  787. if (err)
  788. return err;
  789. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  790. codegen.opcodes.push_back(continue_addr);
  791. codegen.opcodes[break_addr+1]=codegen.opcodes.size();
  792. } break;
  793. case GDParser::ControlFlowNode::CF_SWITCH: {
  794. } break;
  795. case GDParser::ControlFlowNode::CF_BREAK: {
  796. if (p_break_addr<0) {
  797. _set_error("'break'' not within loop",cf);
  798. return ERR_COMPILATION_FAILED;
  799. }
  800. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  801. codegen.opcodes.push_back(p_break_addr);
  802. } break;
  803. case GDParser::ControlFlowNode::CF_CONTINUE: {
  804. if (p_continue_addr<0) {
  805. _set_error("'continue' not within loop",cf);
  806. return ERR_COMPILATION_FAILED;
  807. }
  808. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP);
  809. codegen.opcodes.push_back(p_continue_addr);
  810. } break;
  811. case GDParser::ControlFlowNode::CF_RETURN: {
  812. int ret;
  813. if (cf->arguments.size()) {
  814. ret = _parse_expression(codegen,cf->arguments[0],p_stack_level,false);
  815. if (ret<0)
  816. return ERR_PARSE_ERROR;
  817. } else {
  818. ret=GDFunction::ADDR_TYPE_NIL << GDFunction::ADDR_BITS;
  819. }
  820. codegen.opcodes.push_back(GDFunction::OPCODE_RETURN);
  821. codegen.opcodes.push_back(ret);
  822. } break;
  823. }
  824. } break;
  825. case GDParser::Node::TYPE_ASSERT: {
  826. // try subblocks
  827. const GDParser::AssertNode *as = static_cast<const GDParser::AssertNode*>(s);
  828. int ret = _parse_expression(codegen,as->condition,p_stack_level,false);
  829. if (ret<0)
  830. return ERR_PARSE_ERROR;
  831. codegen.opcodes.push_back(GDFunction::OPCODE_ASSERT);
  832. codegen.opcodes.push_back(ret);
  833. } break;
  834. case GDParser::Node::TYPE_LOCAL_VAR: {
  835. const GDParser::LocalVarNode *lv = static_cast<const GDParser::LocalVarNode*>(s);
  836. codegen.add_stack_identifier(lv->name,p_stack_level++);
  837. codegen.alloc_stack(p_stack_level);
  838. new_identifiers++;
  839. } break;
  840. default: {
  841. //expression
  842. int ret = _parse_expression(codegen,s,p_stack_level,true);
  843. if (ret<0)
  844. return ERR_PARSE_ERROR;
  845. } break;
  846. }
  847. }
  848. codegen.pop_stack_identifiers();
  849. return OK;
  850. }
  851. Error GDCompiler::_parse_function(GDScript *p_script,const GDParser::ClassNode *p_class,const GDParser::FunctionNode *p_func) {
  852. Vector<int> bytecode;
  853. CodeGen codegen;
  854. codegen.class_node=p_class;
  855. codegen.script=p_script;
  856. codegen.function_node=p_func;
  857. codegen.stack_max=0;
  858. codegen.current_line=0;
  859. codegen.call_max=0;
  860. codegen.debug_stack=ScriptDebugger::get_singleton()!=NULL;
  861. Vector<StringName> argnames;
  862. int stack_level=0;
  863. if (p_func) {
  864. for(int i=0;i<p_func->arguments.size();i++) {
  865. int idx = i;
  866. codegen.add_stack_identifier(p_func->arguments[i],i);
  867. #ifdef TOOLS_ENABLED
  868. argnames.push_back(p_func->arguments[i]);
  869. #endif
  870. }
  871. stack_level=p_func->arguments.size();
  872. }
  873. codegen.alloc_stack(stack_level);
  874. /* Parse initializer -if applies- */
  875. bool is_initializer=false || !p_func;
  876. if (!p_func || String(p_func->name)=="_init") {
  877. //parse initializer for class members
  878. if (!p_func && p_class->extends_used && p_script->native.is_null()){
  879. //call implicit parent constructor
  880. codegen.opcodes.push_back(GDFunction::OPCODE_CALL_SELF_BASE);
  881. codegen.opcodes.push_back(codegen.get_name_map_pos("_init"));
  882. codegen.opcodes.push_back(0);
  883. codegen.opcodes.push_back((GDFunction::ADDR_TYPE_STACK<<GDFunction::ADDR_BITS)|0);
  884. }
  885. Error err = _parse_block(codegen,p_class->initializer,stack_level);
  886. if (err)
  887. return err;
  888. is_initializer=true;
  889. }
  890. /* Parse default argument code -if applies- */
  891. Vector<int> defarg_addr;
  892. StringName func_name;
  893. if (p_func) {
  894. if (p_func->default_values.size()) {
  895. codegen.opcodes.push_back(GDFunction::OPCODE_JUMP_TO_DEF_ARGUMENT);
  896. defarg_addr.push_back(codegen.opcodes.size());
  897. for(int i=0;i<p_func->default_values.size();i++) {
  898. _parse_expression(codegen,p_func->default_values[i],stack_level,true);
  899. defarg_addr.push_back(codegen.opcodes.size());
  900. }
  901. defarg_addr.invert();
  902. }
  903. Error err = _parse_block(codegen,p_func->body,stack_level);
  904. if (err)
  905. return err;
  906. func_name=p_func->name;
  907. } else {
  908. func_name="_init";
  909. }
  910. codegen.opcodes.push_back(GDFunction::OPCODE_END);
  911. GDFunction *gdfunc=NULL;
  912. //if (String(p_func->name)=="") { //initializer func
  913. // gdfunc = &p_script->initializer;
  914. //} else { //regular func
  915. p_script->member_functions[func_name]=GDFunction();
  916. gdfunc = &p_script->member_functions[func_name];
  917. //}
  918. if (p_func)
  919. gdfunc->_static=p_func->_static;
  920. #ifdef TOOLS_ENABLED
  921. gdfunc->arg_names=argnames;
  922. #endif
  923. //constants
  924. if (codegen.constant_map.size()) {
  925. gdfunc->_constant_count=codegen.constant_map.size();
  926. gdfunc->constants.resize(codegen.constant_map.size());
  927. gdfunc->_constants_ptr=&gdfunc->constants[0];
  928. const Variant *K=NULL;
  929. while((K=codegen.constant_map.next(K))) {
  930. int idx = codegen.constant_map[*K];
  931. gdfunc->constants[idx]=*K;
  932. }
  933. } else {
  934. gdfunc->_constants_ptr=NULL;
  935. gdfunc->_constant_count=0;
  936. }
  937. //global names
  938. if (codegen.name_map.size()) {
  939. gdfunc->global_names.resize(codegen.name_map.size());
  940. gdfunc->_global_names_ptr = &gdfunc->global_names[0];
  941. for(Map<StringName,int>::Element *E=codegen.name_map.front();E;E=E->next()) {
  942. gdfunc->global_names[E->get()]=E->key();
  943. }
  944. gdfunc->_global_names_count=gdfunc->global_names.size();
  945. } else {
  946. gdfunc->_global_names_ptr = NULL;
  947. gdfunc->_global_names_count =0;
  948. }
  949. if (codegen.opcodes.size()) {
  950. gdfunc->code=codegen.opcodes;
  951. gdfunc->_code_ptr=&gdfunc->code[0];
  952. gdfunc->_code_size=codegen.opcodes.size();
  953. } else {
  954. gdfunc->_code_ptr=NULL;
  955. gdfunc->_code_size=0;
  956. }
  957. if (defarg_addr.size()) {
  958. gdfunc->default_arguments=defarg_addr;
  959. gdfunc->_default_arg_count=defarg_addr.size();
  960. gdfunc->_default_arg_ptr=&gdfunc->default_arguments[0];
  961. } else {
  962. gdfunc->_default_arg_count=0;
  963. gdfunc->_default_arg_ptr=NULL;
  964. }
  965. gdfunc->_argument_count=p_func ? p_func->arguments.size() : 0;
  966. gdfunc->_stack_size=codegen.stack_max;
  967. gdfunc->_call_size=codegen.call_max;
  968. gdfunc->name=func_name;
  969. gdfunc->_script=p_script;
  970. gdfunc->source=source;
  971. #ifdef DEBUG_ENABLED
  972. {
  973. gdfunc->func_cname=(String(source)+" - "+String(func_name)).utf8();
  974. gdfunc->_func_cname=gdfunc->func_cname.get_data();
  975. }
  976. #endif
  977. if (p_func) {
  978. gdfunc->_initial_line=p_func->line;
  979. } else {
  980. gdfunc->_initial_line=0;
  981. }
  982. if (codegen.debug_stack)
  983. gdfunc->stack_debug=codegen.stack_debug;
  984. if (is_initializer)
  985. p_script->initializer=gdfunc;
  986. return OK;
  987. }
  988. Error GDCompiler::_parse_class(GDScript *p_script,GDScript *p_owner,const GDParser::ClassNode *p_class) {
  989. p_script->native=Ref<GDNativeClass>();
  990. p_script->base=Ref<GDScript>();
  991. p_script->_base=NULL;
  992. p_script->members.clear();
  993. p_script->constants.clear();
  994. p_script->member_functions.clear();
  995. p_script->member_indices.clear();
  996. p_script->member_info.clear();
  997. p_script->initializer=NULL;
  998. p_script->subclasses.clear();
  999. p_script->_owner=p_owner;
  1000. p_script->tool=p_class->tool;
  1001. p_script->name=p_class->name;
  1002. int index_from=0;
  1003. if (p_class->extends_used) {
  1004. //do inheritance
  1005. String path = p_class->extends_file;
  1006. Ref<GDScript> script;
  1007. Ref<GDNativeClass> native;
  1008. if (path!="") {
  1009. //path (and optionally subclasses)
  1010. if (path.is_rel_path()) {
  1011. String base = p_script->get_path();
  1012. if (base=="" || base.is_rel_path()) {
  1013. _set_error("Could not resolve relative path for parent class: "+path,p_class);
  1014. return ERR_FILE_NOT_FOUND;
  1015. }
  1016. path=base.get_base_dir().plus_file(path);
  1017. }
  1018. script = ResourceLoader::load(path);
  1019. if (script.is_null()) {
  1020. _set_error("Could not load base class: "+path,p_class);
  1021. return ERR_FILE_NOT_FOUND;
  1022. }
  1023. if (!script->valid) {
  1024. _set_error("Script not fully loaded (cyclic preload?): "+path,p_class);
  1025. return ERR_BUSY;
  1026. }
  1027. //print_line("EXTENDS PATH: "+path+" script is "+itos(script.is_valid())+" indices is "+itos(script->member_indices.size())+" valid? "+itos(script->valid));
  1028. if (p_class->extends_class.size()) {
  1029. for(int i=0;i<p_class->extends_class.size();i++) {
  1030. String sub = p_class->extends_class[i];
  1031. if (script->subclasses.has(sub)) {
  1032. script=script->subclasses[sub];
  1033. } else {
  1034. _set_error("Could not find subclass: "+sub,p_class);
  1035. return ERR_FILE_NOT_FOUND;
  1036. }
  1037. }
  1038. }
  1039. } else {
  1040. ERR_FAIL_COND_V(p_class->extends_class.size()==0,ERR_BUG);
  1041. //look around for the subclasses
  1042. String base=p_class->extends_class[0];
  1043. GDScript *p = p_owner;
  1044. Ref<GDScript> base_class;
  1045. while(p) {
  1046. if (p->subclasses.has(base)) {
  1047. base_class=p->subclasses[base];
  1048. break;
  1049. }
  1050. p=p->_owner;
  1051. }
  1052. if (base_class.is_valid()) {
  1053. for(int i=1;i<p_class->extends_class.size();i++) {
  1054. String subclass=p_class->extends_class[i];
  1055. if (base_class->subclasses.has(subclass)) {
  1056. base_class=base_class->subclasses[subclass];
  1057. } else {
  1058. _set_error("Could not find subclass: "+subclass,p_class);
  1059. return ERR_FILE_NOT_FOUND;
  1060. }
  1061. }
  1062. script=base_class;
  1063. } else {
  1064. if (p_class->extends_class.size()>1) {
  1065. _set_error("Invalid inheritance (unknown class+subclasses)",p_class);
  1066. return ERR_FILE_NOT_FOUND;
  1067. }
  1068. //if not found, try engine classes
  1069. if (!GDScriptLanguage::get_singleton()->get_global_map().has(base)) {
  1070. _set_error("Unknown class: '"+base+"'",p_class);
  1071. return ERR_FILE_NOT_FOUND;
  1072. }
  1073. int base_idx = GDScriptLanguage::get_singleton()->get_global_map()[base];
  1074. native = GDScriptLanguage::get_singleton()->get_global_array()[base_idx];
  1075. if (!native.is_valid()) {
  1076. _set_error("Global not a class: '"+base+"'",p_class);
  1077. return ERR_FILE_NOT_FOUND;
  1078. }
  1079. }
  1080. }
  1081. if (script.is_valid()) {
  1082. p_script->base=script;
  1083. p_script->_base=p_script->base.ptr();
  1084. p_script->member_indices=script->member_indices;
  1085. } else if (native.is_valid()) {
  1086. p_script->native=native;
  1087. } else {
  1088. _set_error("Could not determine inheritance",p_class);
  1089. return ERR_FILE_NOT_FOUND;
  1090. }
  1091. }
  1092. //print_line("Script: "+p_script->get_path()+" indices: "+itos(p_script->member_indices.size()));
  1093. for(int i=0;i<p_class->variables.size();i++) {
  1094. StringName name = p_class->variables[i].identifier;
  1095. if (p_script->member_indices.has(name)) {
  1096. _set_error("Member '"+name+"' already exists (in current or parent class)",p_class);
  1097. return ERR_ALREADY_EXISTS;
  1098. }
  1099. if (p_class->variables[i]._export.type!=Variant::NIL) {
  1100. p_script->member_info[name]=p_class->variables[i]._export;
  1101. #ifdef TOOLS_ENABLED
  1102. if (p_class->variables[i].default_value.get_type()!=Variant::NIL) {
  1103. p_script->member_default_values[name]=p_class->variables[i].default_value;
  1104. }
  1105. #endif
  1106. }
  1107. //int new_idx = p_script->member_indices.size();
  1108. GDScript::MemberInfo minfo;
  1109. minfo.index = p_script->member_indices.size();
  1110. minfo.setter = p_class->variables[i].setter;
  1111. minfo.getter = p_class->variables[i].getter;
  1112. p_script->member_indices[name]=minfo;
  1113. p_script->members.insert(name);
  1114. }
  1115. for(int i=0;i<p_class->constant_expressions.size();i++) {
  1116. StringName name = p_class->constant_expressions[i].identifier;
  1117. ERR_CONTINUE( p_class->constant_expressions[i].expression->type!=GDParser::Node::TYPE_CONSTANT );
  1118. GDParser::ConstantNode *constant = static_cast<GDParser::ConstantNode*>(p_class->constant_expressions[i].expression);
  1119. p_script->constants.insert(name,constant->value);
  1120. //p_script->constants[constant->value].make_const();
  1121. }
  1122. //parse sub-classes
  1123. for(int i=0;i<p_class->subclasses.size();i++) {
  1124. StringName name = p_class->subclasses[i]->name;
  1125. Ref<GDScript> subclass = memnew( GDScript );
  1126. Error err = _parse_class(subclass.ptr(),p_script,p_class->subclasses[i]);
  1127. if (err)
  1128. return err;
  1129. p_script->constants.insert(name,subclass); //once parsed, goes to the list of constants
  1130. p_script->subclasses.insert(name,subclass);
  1131. }
  1132. //parse methods
  1133. bool has_initializer=false;
  1134. for(int i=0;i<p_class->functions.size();i++) {
  1135. if (!has_initializer && p_class->functions[i]->name=="_init")
  1136. has_initializer=true;
  1137. Error err = _parse_function(p_script,p_class,p_class->functions[i]);
  1138. if (err)
  1139. return err;
  1140. }
  1141. //parse static methods
  1142. for(int i=0;i<p_class->static_functions.size();i++) {
  1143. Error err = _parse_function(p_script,p_class,p_class->static_functions[i]);
  1144. if (err)
  1145. return err;
  1146. }
  1147. if (!has_initializer) {
  1148. //create a constructor
  1149. Error err = _parse_function(p_script,p_class,NULL);
  1150. if (err)
  1151. return err;
  1152. }
  1153. #ifdef DEBUG_ENABLED
  1154. //validate setters/getters if debug is enabled
  1155. for(int i=0;i<p_class->variables.size();i++) {
  1156. if (p_class->variables[i].setter) {
  1157. const Map<StringName,GDFunction>::Element *E=p_script->get_member_functions().find(p_class->variables[i].setter);
  1158. if (!E) {
  1159. _set_error("Setter function '"+String(p_class->variables[i].setter)+"' not found in class.",NULL);
  1160. err_line=p_class->variables[i].line;
  1161. err_column=0;
  1162. return ERR_PARSE_ERROR;
  1163. }
  1164. if (E->get().is_static()) {
  1165. _set_error("Setter function '"+String(p_class->variables[i].setter)+"' is static.",NULL);
  1166. err_line=p_class->variables[i].line;
  1167. err_column=0;
  1168. return ERR_PARSE_ERROR;
  1169. }
  1170. }
  1171. if (p_class->variables[i].getter) {
  1172. const Map<StringName,GDFunction>::Element *E=p_script->get_member_functions().find(p_class->variables[i].getter);
  1173. if (!E) {
  1174. _set_error("Getter function '"+String(p_class->variables[i].getter)+"' not found in class.",NULL);
  1175. err_line=p_class->variables[i].line;
  1176. err_column=0;
  1177. return ERR_PARSE_ERROR;
  1178. }
  1179. if (E->get().is_static()) {
  1180. _set_error("Getter function '"+String(p_class->variables[i].getter)+"' is static.",NULL);
  1181. err_line=p_class->variables[i].line;
  1182. err_column=0;
  1183. return ERR_PARSE_ERROR;
  1184. }
  1185. }
  1186. }
  1187. #endif
  1188. return OK;
  1189. }
  1190. Error GDCompiler::compile(const GDParser *p_parser,GDScript *p_script) {
  1191. err_line=-1;
  1192. err_column=-1;
  1193. error="";
  1194. parser=p_parser;
  1195. const GDParser::Node* root = parser->get_parse_tree();
  1196. ERR_FAIL_COND_V(root->type!=GDParser::Node::TYPE_CLASS,ERR_INVALID_DATA);
  1197. source=p_script->get_path();
  1198. Error err = _parse_class(p_script,NULL,static_cast<const GDParser::ClassNode*>(root));
  1199. if (err)
  1200. return err;
  1201. return OK;
  1202. }
  1203. String GDCompiler::get_error() const {
  1204. return error;
  1205. }
  1206. int GDCompiler::get_error_line() const{
  1207. return err_line;
  1208. }
  1209. int GDCompiler::get_error_column() const{
  1210. return err_column;
  1211. }
  1212. GDCompiler::GDCompiler()
  1213. {
  1214. }