ASTCodegen.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386
  1. /*
  2. * Copyright (c) 2021, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2021, Linus Groh <linusg@serenityos.org>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <LibJS/AST.h>
  8. #include <LibJS/Bytecode/Generator.h>
  9. #include <LibJS/Bytecode/Instruction.h>
  10. #include <LibJS/Bytecode/Op.h>
  11. #include <LibJS/Bytecode/Register.h>
  12. namespace JS {
  13. Optional<Bytecode::Register> ASTNode::generate_bytecode(Bytecode::Generator&) const
  14. {
  15. dbgln("Missing generate_bytecode()");
  16. TODO();
  17. }
  18. Optional<Bytecode::Register> ScopeNode::generate_bytecode(Bytecode::Generator& generator) const
  19. {
  20. generator.emit<Bytecode::Op::EnterScope>(*this);
  21. Optional<Bytecode::Register> last_value_reg;
  22. for (auto& child : children()) {
  23. last_value_reg = child.generate_bytecode(generator);
  24. }
  25. return last_value_reg;
  26. }
  27. Optional<Bytecode::Register> EmptyStatement::generate_bytecode(Bytecode::Generator&) const
  28. {
  29. return {};
  30. }
  31. Optional<Bytecode::Register> ExpressionStatement::generate_bytecode(Bytecode::Generator& generator) const
  32. {
  33. return m_expression->generate_bytecode(generator);
  34. }
  35. Optional<Bytecode::Register> BinaryExpression::generate_bytecode(Bytecode::Generator& generator) const
  36. {
  37. auto lhs_reg = m_lhs->generate_bytecode(generator);
  38. auto rhs_reg = m_rhs->generate_bytecode(generator);
  39. VERIFY(lhs_reg.has_value());
  40. VERIFY(rhs_reg.has_value());
  41. auto dst_reg = generator.allocate_register();
  42. switch (m_op) {
  43. case BinaryOp::Addition:
  44. generator.emit<Bytecode::Op::Add>(dst_reg, *lhs_reg, *rhs_reg);
  45. return dst_reg;
  46. case BinaryOp::Subtraction:
  47. generator.emit<Bytecode::Op::Sub>(dst_reg, *lhs_reg, *rhs_reg);
  48. return dst_reg;
  49. case BinaryOp::Multiplication:
  50. generator.emit<Bytecode::Op::Mul>(dst_reg, *lhs_reg, *rhs_reg);
  51. return dst_reg;
  52. case BinaryOp::Division:
  53. generator.emit<Bytecode::Op::Div>(dst_reg, *lhs_reg, *rhs_reg);
  54. return dst_reg;
  55. case BinaryOp::Modulo:
  56. generator.emit<Bytecode::Op::Mod>(dst_reg, *lhs_reg, *rhs_reg);
  57. return dst_reg;
  58. case BinaryOp::Exponentiation:
  59. generator.emit<Bytecode::Op::Exp>(dst_reg, *lhs_reg, *rhs_reg);
  60. return dst_reg;
  61. case BinaryOp::GreaterThan:
  62. generator.emit<Bytecode::Op::GreaterThan>(dst_reg, *lhs_reg, *rhs_reg);
  63. return dst_reg;
  64. case BinaryOp::GreaterThanEquals:
  65. generator.emit<Bytecode::Op::GreaterThanEquals>(dst_reg, *lhs_reg, *rhs_reg);
  66. return dst_reg;
  67. case BinaryOp::LessThan:
  68. generator.emit<Bytecode::Op::LessThan>(dst_reg, *lhs_reg, *rhs_reg);
  69. return dst_reg;
  70. case BinaryOp::LessThanEquals:
  71. generator.emit<Bytecode::Op::LessThanEquals>(dst_reg, *lhs_reg, *rhs_reg);
  72. return dst_reg;
  73. case BinaryOp::AbstractInequals:
  74. generator.emit<Bytecode::Op::AbstractInequals>(dst_reg, *lhs_reg, *rhs_reg);
  75. return dst_reg;
  76. case BinaryOp::AbstractEquals:
  77. generator.emit<Bytecode::Op::AbstractEquals>(dst_reg, *lhs_reg, *rhs_reg);
  78. return dst_reg;
  79. case BinaryOp::TypedInequals:
  80. generator.emit<Bytecode::Op::TypedInequals>(dst_reg, *lhs_reg, *rhs_reg);
  81. return dst_reg;
  82. case BinaryOp::TypedEquals:
  83. generator.emit<Bytecode::Op::TypedEquals>(dst_reg, *lhs_reg, *rhs_reg);
  84. return dst_reg;
  85. case BinaryOp::BitwiseAnd:
  86. generator.emit<Bytecode::Op::BitwiseAnd>(dst_reg, *lhs_reg, *rhs_reg);
  87. return dst_reg;
  88. case BinaryOp::BitwiseOr:
  89. generator.emit<Bytecode::Op::BitwiseOr>(dst_reg, *lhs_reg, *rhs_reg);
  90. return dst_reg;
  91. case BinaryOp::BitwiseXor:
  92. generator.emit<Bytecode::Op::BitwiseXor>(dst_reg, *lhs_reg, *rhs_reg);
  93. return dst_reg;
  94. case BinaryOp::LeftShift:
  95. generator.emit<Bytecode::Op::LeftShift>(dst_reg, *lhs_reg, *rhs_reg);
  96. return dst_reg;
  97. case BinaryOp::RightShift:
  98. generator.emit<Bytecode::Op::RightShift>(dst_reg, *lhs_reg, *rhs_reg);
  99. return dst_reg;
  100. case BinaryOp::UnsignedRightShift:
  101. generator.emit<Bytecode::Op::UnsignedRightShift>(dst_reg, *lhs_reg, *rhs_reg);
  102. return dst_reg;
  103. case BinaryOp::In:
  104. generator.emit<Bytecode::Op::In>(dst_reg, *lhs_reg, *rhs_reg);
  105. return dst_reg;
  106. case BinaryOp::InstanceOf:
  107. generator.emit<Bytecode::Op::InstanceOf>(dst_reg, *lhs_reg, *rhs_reg);
  108. return dst_reg;
  109. default:
  110. VERIFY_NOT_REACHED();
  111. }
  112. }
  113. Optional<Bytecode::Register> UnaryExpression::generate_bytecode(Bytecode::Generator& generator) const
  114. {
  115. auto lhs_reg = m_lhs->generate_bytecode(generator);
  116. VERIFY(lhs_reg.has_value());
  117. auto dst_reg = generator.allocate_register();
  118. switch (m_op) {
  119. case UnaryOp::BitwiseNot:
  120. generator.emit<Bytecode::Op::BitwiseNot>(dst_reg, *lhs_reg);
  121. return dst_reg;
  122. case UnaryOp::Not:
  123. generator.emit<Bytecode::Op::Not>(dst_reg, *lhs_reg);
  124. return dst_reg;
  125. case UnaryOp::Plus:
  126. generator.emit<Bytecode::Op::UnaryPlus>(dst_reg, *lhs_reg);
  127. return dst_reg;
  128. case UnaryOp::Minus:
  129. generator.emit<Bytecode::Op::UnaryMinus>(dst_reg, *lhs_reg);
  130. return dst_reg;
  131. case UnaryOp::Typeof:
  132. generator.emit<Bytecode::Op::Typeof>(dst_reg, *lhs_reg);
  133. return dst_reg;
  134. case UnaryOp::Void:
  135. generator.emit<Bytecode::Op::Load>(dst_reg, js_undefined());
  136. return dst_reg;
  137. default:
  138. TODO();
  139. }
  140. }
  141. Optional<Bytecode::Register> NumericLiteral::generate_bytecode(Bytecode::Generator& generator) const
  142. {
  143. auto dst = generator.allocate_register();
  144. generator.emit<Bytecode::Op::Load>(dst, m_value);
  145. return dst;
  146. }
  147. Optional<Bytecode::Register> BooleanLiteral::generate_bytecode(Bytecode::Generator& generator) const
  148. {
  149. auto dst = generator.allocate_register();
  150. generator.emit<Bytecode::Op::Load>(dst, Value(m_value));
  151. return dst;
  152. }
  153. Optional<Bytecode::Register> NullLiteral::generate_bytecode(Bytecode::Generator& generator) const
  154. {
  155. auto dst = generator.allocate_register();
  156. generator.emit<Bytecode::Op::Load>(dst, js_null());
  157. return dst;
  158. }
  159. Optional<Bytecode::Register> StringLiteral::generate_bytecode(Bytecode::Generator& generator) const
  160. {
  161. auto dst = generator.allocate_register();
  162. generator.emit<Bytecode::Op::NewString>(dst, m_value);
  163. return dst;
  164. }
  165. Optional<Bytecode::Register> Identifier::generate_bytecode(Bytecode::Generator& generator) const
  166. {
  167. auto reg = generator.allocate_register();
  168. generator.emit<Bytecode::Op::GetVariable>(reg, m_string);
  169. return reg;
  170. }
  171. Optional<Bytecode::Register> AssignmentExpression::generate_bytecode(Bytecode::Generator& generator) const
  172. {
  173. if (is<Identifier>(*m_lhs)) {
  174. auto& identifier = static_cast<Identifier const&>(*m_lhs);
  175. auto rhs_reg = m_rhs->generate_bytecode(generator);
  176. VERIFY(rhs_reg.has_value());
  177. if (m_op == AssignmentOp::Assignment) {
  178. generator.emit<Bytecode::Op::SetVariable>(identifier.string(), *rhs_reg);
  179. return rhs_reg;
  180. }
  181. auto lhs_reg = m_lhs->generate_bytecode(generator);
  182. auto dst_reg = generator.allocate_register();
  183. switch (m_op) {
  184. case AssignmentOp::AdditionAssignment:
  185. generator.emit<Bytecode::Op::Add>(dst_reg, *lhs_reg, *rhs_reg);
  186. break;
  187. case AssignmentOp::SubtractionAssignment:
  188. generator.emit<Bytecode::Op::Sub>(dst_reg, *lhs_reg, *rhs_reg);
  189. break;
  190. case AssignmentOp::MultiplicationAssignment:
  191. generator.emit<Bytecode::Op::Mul>(dst_reg, *lhs_reg, *rhs_reg);
  192. break;
  193. case AssignmentOp::DivisionAssignment:
  194. generator.emit<Bytecode::Op::Div>(dst_reg, *lhs_reg, *rhs_reg);
  195. break;
  196. case AssignmentOp::ModuloAssignment:
  197. generator.emit<Bytecode::Op::Mod>(dst_reg, *lhs_reg, *rhs_reg);
  198. break;
  199. case AssignmentOp::ExponentiationAssignment:
  200. generator.emit<Bytecode::Op::Exp>(dst_reg, *lhs_reg, *rhs_reg);
  201. break;
  202. case AssignmentOp::BitwiseAndAssignment:
  203. generator.emit<Bytecode::Op::BitwiseAnd>(dst_reg, *lhs_reg, *rhs_reg);
  204. break;
  205. case AssignmentOp::BitwiseOrAssignment:
  206. generator.emit<Bytecode::Op::BitwiseOr>(dst_reg, *lhs_reg, *rhs_reg);
  207. break;
  208. case AssignmentOp::BitwiseXorAssignment:
  209. generator.emit<Bytecode::Op::BitwiseXor>(dst_reg, *lhs_reg, *rhs_reg);
  210. break;
  211. case AssignmentOp::LeftShiftAssignment:
  212. generator.emit<Bytecode::Op::LeftShift>(dst_reg, *lhs_reg, *rhs_reg);
  213. break;
  214. case AssignmentOp::RightShiftAssignment:
  215. generator.emit<Bytecode::Op::RightShift>(dst_reg, *lhs_reg, *rhs_reg);
  216. break;
  217. case AssignmentOp::UnsignedRightShiftAssignment:
  218. generator.emit<Bytecode::Op::UnsignedRightShift>(dst_reg, *lhs_reg, *rhs_reg);
  219. break;
  220. default:
  221. TODO();
  222. }
  223. generator.emit<Bytecode::Op::SetVariable>(identifier.string(), dst_reg);
  224. return dst_reg;
  225. }
  226. if (is<MemberExpression>(*m_lhs)) {
  227. auto& expression = static_cast<MemberExpression const&>(*m_lhs);
  228. auto object_reg = expression.object().generate_bytecode(generator);
  229. if (expression.is_computed()) {
  230. TODO();
  231. } else {
  232. VERIFY(is<Identifier>(expression.property()));
  233. auto rhs_reg = m_rhs->generate_bytecode(generator);
  234. generator.emit<Bytecode::Op::PutById>(*object_reg, static_cast<Identifier const&>(expression.property()).string(), *rhs_reg);
  235. return rhs_reg;
  236. }
  237. }
  238. TODO();
  239. }
  240. Optional<Bytecode::Register> WhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  241. {
  242. generator.begin_continuable_scope();
  243. auto test_label = generator.make_label();
  244. auto test_result_reg = m_test->generate_bytecode(generator);
  245. VERIFY(test_result_reg.has_value());
  246. auto& test_jump = generator.emit<Bytecode::Op::JumpIfFalse>(*test_result_reg);
  247. auto body_result_reg = m_body->generate_bytecode(generator);
  248. generator.emit<Bytecode::Op::Jump>(test_label);
  249. test_jump.set_target(generator.make_label());
  250. generator.end_continuable_scope();
  251. return body_result_reg;
  252. }
  253. Optional<Bytecode::Register> DoWhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  254. {
  255. generator.begin_continuable_scope();
  256. auto head_label = generator.make_label();
  257. auto body_result_reg = m_body->generate_bytecode(generator);
  258. generator.end_continuable_scope();
  259. auto test_result_reg = m_test->generate_bytecode(generator);
  260. VERIFY(test_result_reg.has_value());
  261. generator.emit<Bytecode::Op::JumpIfTrue>(*test_result_reg, head_label);
  262. return body_result_reg;
  263. }
  264. Optional<Bytecode::Register> ObjectExpression::generate_bytecode(Bytecode::Generator& generator) const
  265. {
  266. auto reg = generator.allocate_register();
  267. generator.emit<Bytecode::Op::NewObject>(reg);
  268. if (!m_properties.is_empty()) {
  269. TODO();
  270. }
  271. return reg;
  272. }
  273. Optional<Bytecode::Register> MemberExpression::generate_bytecode(Bytecode::Generator& generator) const
  274. {
  275. auto object_reg = object().generate_bytecode(generator);
  276. if (is_computed()) {
  277. TODO();
  278. } else {
  279. VERIFY(is<Identifier>(property()));
  280. auto dst_reg = generator.allocate_register();
  281. generator.emit<Bytecode::Op::GetById>(dst_reg, *object_reg, static_cast<Identifier const&>(property()).string());
  282. return dst_reg;
  283. }
  284. }
  285. Optional<Bytecode::Register> FunctionDeclaration::generate_bytecode(Bytecode::Generator&) const
  286. {
  287. return {};
  288. }
  289. Optional<Bytecode::Register> CallExpression::generate_bytecode(Bytecode::Generator& generator) const
  290. {
  291. auto callee_reg = m_callee->generate_bytecode(generator);
  292. // FIXME: Load the correct 'this' value into 'this_reg'.
  293. auto this_reg = generator.allocate_register();
  294. generator.emit<Bytecode::Op::Load>(this_reg, js_undefined());
  295. Vector<Bytecode::Register> argument_registers;
  296. for (auto& arg : m_arguments)
  297. argument_registers.append(*arg.value->generate_bytecode(generator));
  298. auto dst_reg = generator.allocate_register();
  299. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_registers.size(), dst_reg, *callee_reg, this_reg, argument_registers);
  300. return dst_reg;
  301. }
  302. Optional<Bytecode::Register> ReturnStatement::generate_bytecode(Bytecode::Generator& generator) const
  303. {
  304. Optional<Bytecode::Register> argument_reg;
  305. if (m_argument)
  306. argument_reg = m_argument->generate_bytecode(generator);
  307. generator.emit<Bytecode::Op::Return>(argument_reg);
  308. return argument_reg;
  309. }
  310. Optional<Bytecode::Register> IfStatement::generate_bytecode(Bytecode::Generator& generator) const
  311. {
  312. auto result_reg = generator.allocate_register();
  313. auto predicate_reg = m_predicate->generate_bytecode(generator);
  314. auto& if_jump = generator.emit<Bytecode::Op::JumpIfTrue>(*predicate_reg);
  315. auto& else_jump = generator.emit<Bytecode::Op::JumpIfFalse>(*predicate_reg);
  316. if_jump.set_target(generator.make_label());
  317. auto consequent_reg = m_consequent->generate_bytecode(generator);
  318. generator.emit<Bytecode::Op::LoadRegister>(result_reg, *consequent_reg);
  319. auto& end_jump = generator.emit<Bytecode::Op::Jump>();
  320. else_jump.set_target(generator.make_label());
  321. if (m_alternate) {
  322. auto alternative_reg = m_alternate->generate_bytecode(generator);
  323. generator.emit<Bytecode::Op::LoadRegister>(result_reg, *alternative_reg);
  324. }
  325. end_jump.set_target(generator.make_label());
  326. return result_reg;
  327. }
  328. Optional<Bytecode::Register> ContinueStatement::generate_bytecode(Bytecode::Generator& generator) const
  329. {
  330. generator.emit<Bytecode::Op::Jump>(generator.nearest_continuable_scope());
  331. return {};
  332. }
  333. Optional<Bytecode::Register> DebuggerStatement::generate_bytecode(Bytecode::Generator&) const
  334. {
  335. return {};
  336. }
  337. }