ASTCodegen.cpp 11 KB

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