ASTCodegen.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368
  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. case BinaryOp::LeftShift:
  93. generator.emit<Bytecode::Op::LeftShift>(dst_reg, *lhs_reg, *rhs_reg);
  94. return dst_reg;
  95. case BinaryOp::RightShift:
  96. generator.emit<Bytecode::Op::RightShift>(dst_reg, *lhs_reg, *rhs_reg);
  97. return dst_reg;
  98. case BinaryOp::UnsignedRightShift:
  99. generator.emit<Bytecode::Op::UnsignedRightShift>(dst_reg, *lhs_reg, *rhs_reg);
  100. return dst_reg;
  101. default:
  102. TODO();
  103. }
  104. }
  105. Optional<Bytecode::Register> UnaryExpression::generate_bytecode(Bytecode::Generator& generator) const
  106. {
  107. auto lhs_reg = m_lhs->generate_bytecode(generator);
  108. VERIFY(lhs_reg.has_value());
  109. auto dst_reg = generator.allocate_register();
  110. switch (m_op) {
  111. case UnaryOp::BitwiseNot:
  112. generator.emit<Bytecode::Op::BitwiseNot>(dst_reg, *lhs_reg);
  113. return dst_reg;
  114. case UnaryOp::Not:
  115. generator.emit<Bytecode::Op::Not>(dst_reg, *lhs_reg);
  116. return dst_reg;
  117. case UnaryOp::Plus:
  118. generator.emit<Bytecode::Op::UnaryPlus>(dst_reg, *lhs_reg);
  119. return dst_reg;
  120. case UnaryOp::Minus:
  121. generator.emit<Bytecode::Op::UnaryMinus>(dst_reg, *lhs_reg);
  122. return dst_reg;
  123. case UnaryOp::Typeof:
  124. generator.emit<Bytecode::Op::Typeof>(dst_reg, *lhs_reg);
  125. return dst_reg;
  126. case UnaryOp::Void:
  127. generator.emit<Bytecode::Op::Load>(dst_reg, js_undefined());
  128. return dst_reg;
  129. default:
  130. TODO();
  131. }
  132. }
  133. Optional<Bytecode::Register> NumericLiteral::generate_bytecode(Bytecode::Generator& generator) const
  134. {
  135. auto dst = generator.allocate_register();
  136. generator.emit<Bytecode::Op::Load>(dst, m_value);
  137. return dst;
  138. }
  139. Optional<Bytecode::Register> BooleanLiteral::generate_bytecode(Bytecode::Generator& generator) const
  140. {
  141. auto dst = generator.allocate_register();
  142. generator.emit<Bytecode::Op::Load>(dst, Value(m_value));
  143. return dst;
  144. }
  145. Optional<Bytecode::Register> NullLiteral::generate_bytecode(Bytecode::Generator& generator) const
  146. {
  147. auto dst = generator.allocate_register();
  148. generator.emit<Bytecode::Op::Load>(dst, js_null());
  149. return dst;
  150. }
  151. Optional<Bytecode::Register> StringLiteral::generate_bytecode(Bytecode::Generator& generator) const
  152. {
  153. auto dst = generator.allocate_register();
  154. generator.emit<Bytecode::Op::NewString>(dst, m_value);
  155. return dst;
  156. }
  157. Optional<Bytecode::Register> Identifier::generate_bytecode(Bytecode::Generator& generator) const
  158. {
  159. auto reg = generator.allocate_register();
  160. generator.emit<Bytecode::Op::GetVariable>(reg, m_string);
  161. return reg;
  162. }
  163. Optional<Bytecode::Register> AssignmentExpression::generate_bytecode(Bytecode::Generator& generator) const
  164. {
  165. if (is<Identifier>(*m_lhs)) {
  166. auto& identifier = static_cast<Identifier const&>(*m_lhs);
  167. auto rhs_reg = m_rhs->generate_bytecode(generator);
  168. VERIFY(rhs_reg.has_value());
  169. if (m_op == AssignmentOp::Assignment) {
  170. generator.emit<Bytecode::Op::SetVariable>(identifier.string(), *rhs_reg);
  171. return rhs_reg;
  172. }
  173. auto lhs_reg = m_lhs->generate_bytecode(generator);
  174. auto dst_reg = generator.allocate_register();
  175. switch (m_op) {
  176. case AssignmentOp::AdditionAssignment:
  177. generator.emit<Bytecode::Op::Add>(dst_reg, *lhs_reg, *rhs_reg);
  178. break;
  179. case AssignmentOp::SubtractionAssignment:
  180. generator.emit<Bytecode::Op::Sub>(dst_reg, *lhs_reg, *rhs_reg);
  181. break;
  182. case AssignmentOp::MultiplicationAssignment:
  183. generator.emit<Bytecode::Op::Mul>(dst_reg, *lhs_reg, *rhs_reg);
  184. break;
  185. case AssignmentOp::DivisionAssignment:
  186. generator.emit<Bytecode::Op::Div>(dst_reg, *lhs_reg, *rhs_reg);
  187. break;
  188. case AssignmentOp::ModuloAssignment:
  189. generator.emit<Bytecode::Op::Mod>(dst_reg, *lhs_reg, *rhs_reg);
  190. break;
  191. case AssignmentOp::ExponentiationAssignment:
  192. generator.emit<Bytecode::Op::Exp>(dst_reg, *lhs_reg, *rhs_reg);
  193. break;
  194. case AssignmentOp::BitwiseAndAssignment:
  195. generator.emit<Bytecode::Op::BitwiseAnd>(dst_reg, *lhs_reg, *rhs_reg);
  196. break;
  197. case AssignmentOp::BitwiseOrAssignment:
  198. generator.emit<Bytecode::Op::BitwiseOr>(dst_reg, *lhs_reg, *rhs_reg);
  199. break;
  200. case AssignmentOp::BitwiseXorAssignment:
  201. generator.emit<Bytecode::Op::BitwiseXor>(dst_reg, *lhs_reg, *rhs_reg);
  202. break;
  203. default:
  204. TODO();
  205. }
  206. generator.emit<Bytecode::Op::SetVariable>(identifier.string(), dst_reg);
  207. return dst_reg;
  208. }
  209. if (is<MemberExpression>(*m_lhs)) {
  210. auto& expression = static_cast<MemberExpression const&>(*m_lhs);
  211. auto object_reg = expression.object().generate_bytecode(generator);
  212. if (expression.is_computed()) {
  213. TODO();
  214. } else {
  215. VERIFY(is<Identifier>(expression.property()));
  216. auto rhs_reg = m_rhs->generate_bytecode(generator);
  217. generator.emit<Bytecode::Op::PutById>(*object_reg, static_cast<Identifier const&>(expression.property()).string(), *rhs_reg);
  218. return rhs_reg;
  219. }
  220. }
  221. TODO();
  222. }
  223. Optional<Bytecode::Register> WhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  224. {
  225. generator.begin_continuable_scope();
  226. auto test_label = generator.make_label();
  227. auto test_result_reg = m_test->generate_bytecode(generator);
  228. VERIFY(test_result_reg.has_value());
  229. auto& test_jump = generator.emit<Bytecode::Op::JumpIfFalse>(*test_result_reg);
  230. auto body_result_reg = m_body->generate_bytecode(generator);
  231. generator.emit<Bytecode::Op::Jump>(test_label);
  232. test_jump.set_target(generator.make_label());
  233. generator.end_continuable_scope();
  234. return body_result_reg;
  235. }
  236. Optional<Bytecode::Register> DoWhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  237. {
  238. generator.begin_continuable_scope();
  239. auto head_label = generator.make_label();
  240. auto body_result_reg = m_body->generate_bytecode(generator);
  241. generator.end_continuable_scope();
  242. auto test_result_reg = m_test->generate_bytecode(generator);
  243. VERIFY(test_result_reg.has_value());
  244. generator.emit<Bytecode::Op::JumpIfTrue>(*test_result_reg, head_label);
  245. return body_result_reg;
  246. }
  247. Optional<Bytecode::Register> ObjectExpression::generate_bytecode(Bytecode::Generator& generator) const
  248. {
  249. auto reg = generator.allocate_register();
  250. generator.emit<Bytecode::Op::NewObject>(reg);
  251. if (!m_properties.is_empty()) {
  252. TODO();
  253. }
  254. return reg;
  255. }
  256. Optional<Bytecode::Register> MemberExpression::generate_bytecode(Bytecode::Generator& generator) const
  257. {
  258. auto object_reg = object().generate_bytecode(generator);
  259. if (is_computed()) {
  260. TODO();
  261. } else {
  262. VERIFY(is<Identifier>(property()));
  263. auto dst_reg = generator.allocate_register();
  264. generator.emit<Bytecode::Op::GetById>(dst_reg, *object_reg, static_cast<Identifier const&>(property()).string());
  265. return dst_reg;
  266. }
  267. }
  268. Optional<Bytecode::Register> FunctionDeclaration::generate_bytecode(Bytecode::Generator&) const
  269. {
  270. return {};
  271. }
  272. Optional<Bytecode::Register> CallExpression::generate_bytecode(Bytecode::Generator& generator) const
  273. {
  274. auto callee_reg = m_callee->generate_bytecode(generator);
  275. // FIXME: Load the correct 'this' value into 'this_reg'.
  276. auto this_reg = generator.allocate_register();
  277. generator.emit<Bytecode::Op::Load>(this_reg, js_undefined());
  278. Vector<Bytecode::Register> argument_registers;
  279. for (auto& arg : m_arguments)
  280. argument_registers.append(*arg.value->generate_bytecode(generator));
  281. auto dst_reg = generator.allocate_register();
  282. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_registers.size(), dst_reg, *callee_reg, this_reg, argument_registers);
  283. return dst_reg;
  284. }
  285. Optional<Bytecode::Register> ReturnStatement::generate_bytecode(Bytecode::Generator& generator) const
  286. {
  287. Optional<Bytecode::Register> argument_reg;
  288. if (m_argument)
  289. argument_reg = m_argument->generate_bytecode(generator);
  290. generator.emit<Bytecode::Op::Return>(argument_reg);
  291. return argument_reg;
  292. }
  293. Optional<Bytecode::Register> IfStatement::generate_bytecode(Bytecode::Generator& generator) const
  294. {
  295. auto predicate_reg = m_predicate->generate_bytecode(generator);
  296. auto& if_jump = generator.emit<Bytecode::Op::JumpIfTrue>(*predicate_reg);
  297. auto& else_jump = generator.emit<Bytecode::Op::JumpIfFalse>(*predicate_reg);
  298. if_jump.set_target(generator.make_label());
  299. (void)m_consequent->generate_bytecode(generator);
  300. auto& end_jump = generator.emit<Bytecode::Op::Jump>();
  301. else_jump.set_target(generator.make_label());
  302. if (m_alternate) {
  303. (void)m_alternate->generate_bytecode(generator);
  304. }
  305. end_jump.set_target(generator.make_label());
  306. // FIXME: Do we need IfStatement to return the consequent/alternate result value?
  307. // (That's what the AST interpreter currently does)
  308. return {};
  309. }
  310. Optional<Bytecode::Register> ContinueStatement::generate_bytecode(Bytecode::Generator& generator) const
  311. {
  312. generator.emit<Bytecode::Op::Jump>(generator.nearest_continuable_scope());
  313. return {};
  314. }
  315. Optional<Bytecode::Register> DebuggerStatement::generate_bytecode(Bytecode::Generator&) const
  316. {
  317. return {};
  318. }
  319. }