ASTCodegen.cpp 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481
  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> LogicalExpression::generate_bytecode(Bytecode::Generator& generator) const
  114. {
  115. auto result_reg = generator.allocate_register();
  116. auto lhs_reg = m_lhs->generate_bytecode(generator);
  117. Bytecode::Op::Jump* test_instr;
  118. switch (m_op) {
  119. case LogicalOp::And:
  120. test_instr = &generator.emit<Bytecode::Op::JumpIfTrue>(*lhs_reg);
  121. break;
  122. case LogicalOp::Or:
  123. test_instr = &generator.emit<Bytecode::Op::JumpIfFalse>(*lhs_reg);
  124. break;
  125. case LogicalOp::NullishCoalescing:
  126. test_instr = &generator.emit<Bytecode::Op::JumpIfNullish>(*lhs_reg);
  127. break;
  128. default:
  129. VERIFY_NOT_REACHED();
  130. }
  131. generator.emit<Bytecode::Op::LoadRegister>(result_reg, *lhs_reg);
  132. auto& end_jump = generator.emit<Bytecode::Op::Jump>();
  133. auto rhs_label = generator.make_label();
  134. test_instr->set_target(rhs_label);
  135. auto rhs_reg = m_rhs->generate_bytecode(generator);
  136. generator.emit<Bytecode::Op::LoadRegister>(result_reg, *rhs_reg);
  137. end_jump.set_target(generator.make_label());
  138. return result_reg;
  139. }
  140. Optional<Bytecode::Register> UnaryExpression::generate_bytecode(Bytecode::Generator& generator) const
  141. {
  142. auto lhs_reg = m_lhs->generate_bytecode(generator);
  143. VERIFY(lhs_reg.has_value());
  144. auto dst_reg = generator.allocate_register();
  145. switch (m_op) {
  146. case UnaryOp::BitwiseNot:
  147. generator.emit<Bytecode::Op::BitwiseNot>(dst_reg, *lhs_reg);
  148. return dst_reg;
  149. case UnaryOp::Not:
  150. generator.emit<Bytecode::Op::Not>(dst_reg, *lhs_reg);
  151. return dst_reg;
  152. case UnaryOp::Plus:
  153. generator.emit<Bytecode::Op::UnaryPlus>(dst_reg, *lhs_reg);
  154. return dst_reg;
  155. case UnaryOp::Minus:
  156. generator.emit<Bytecode::Op::UnaryMinus>(dst_reg, *lhs_reg);
  157. return dst_reg;
  158. case UnaryOp::Typeof:
  159. generator.emit<Bytecode::Op::Typeof>(dst_reg, *lhs_reg);
  160. return dst_reg;
  161. case UnaryOp::Void:
  162. generator.emit<Bytecode::Op::Load>(dst_reg, js_undefined());
  163. return dst_reg;
  164. default:
  165. TODO();
  166. }
  167. }
  168. Optional<Bytecode::Register> NumericLiteral::generate_bytecode(Bytecode::Generator& generator) const
  169. {
  170. auto dst = generator.allocate_register();
  171. generator.emit<Bytecode::Op::Load>(dst, m_value);
  172. return dst;
  173. }
  174. Optional<Bytecode::Register> BooleanLiteral::generate_bytecode(Bytecode::Generator& generator) const
  175. {
  176. auto dst = generator.allocate_register();
  177. generator.emit<Bytecode::Op::Load>(dst, Value(m_value));
  178. return dst;
  179. }
  180. Optional<Bytecode::Register> NullLiteral::generate_bytecode(Bytecode::Generator& generator) const
  181. {
  182. auto dst = generator.allocate_register();
  183. generator.emit<Bytecode::Op::Load>(dst, js_null());
  184. return dst;
  185. }
  186. Optional<Bytecode::Register> BigIntLiteral::generate_bytecode(Bytecode::Generator& generator) const
  187. {
  188. auto dst = generator.allocate_register();
  189. generator.emit<Bytecode::Op::NewBigInt>(dst, Crypto::SignedBigInteger::from_base10(m_value.substring(0, m_value.length() - 1)));
  190. return dst;
  191. }
  192. Optional<Bytecode::Register> StringLiteral::generate_bytecode(Bytecode::Generator& generator) const
  193. {
  194. auto dst = generator.allocate_register();
  195. generator.emit<Bytecode::Op::NewString>(dst, m_value);
  196. return dst;
  197. }
  198. Optional<Bytecode::Register> Identifier::generate_bytecode(Bytecode::Generator& generator) const
  199. {
  200. auto reg = generator.allocate_register();
  201. generator.emit<Bytecode::Op::GetVariable>(reg, m_string);
  202. return reg;
  203. }
  204. Optional<Bytecode::Register> AssignmentExpression::generate_bytecode(Bytecode::Generator& generator) const
  205. {
  206. if (is<Identifier>(*m_lhs)) {
  207. auto& identifier = static_cast<Identifier const&>(*m_lhs);
  208. auto rhs_reg = m_rhs->generate_bytecode(generator);
  209. VERIFY(rhs_reg.has_value());
  210. if (m_op == AssignmentOp::Assignment) {
  211. generator.emit<Bytecode::Op::SetVariable>(identifier.string(), *rhs_reg);
  212. return rhs_reg;
  213. }
  214. auto lhs_reg = m_lhs->generate_bytecode(generator);
  215. auto dst_reg = generator.allocate_register();
  216. switch (m_op) {
  217. case AssignmentOp::AdditionAssignment:
  218. generator.emit<Bytecode::Op::Add>(dst_reg, *lhs_reg, *rhs_reg);
  219. break;
  220. case AssignmentOp::SubtractionAssignment:
  221. generator.emit<Bytecode::Op::Sub>(dst_reg, *lhs_reg, *rhs_reg);
  222. break;
  223. case AssignmentOp::MultiplicationAssignment:
  224. generator.emit<Bytecode::Op::Mul>(dst_reg, *lhs_reg, *rhs_reg);
  225. break;
  226. case AssignmentOp::DivisionAssignment:
  227. generator.emit<Bytecode::Op::Div>(dst_reg, *lhs_reg, *rhs_reg);
  228. break;
  229. case AssignmentOp::ModuloAssignment:
  230. generator.emit<Bytecode::Op::Mod>(dst_reg, *lhs_reg, *rhs_reg);
  231. break;
  232. case AssignmentOp::ExponentiationAssignment:
  233. generator.emit<Bytecode::Op::Exp>(dst_reg, *lhs_reg, *rhs_reg);
  234. break;
  235. case AssignmentOp::BitwiseAndAssignment:
  236. generator.emit<Bytecode::Op::BitwiseAnd>(dst_reg, *lhs_reg, *rhs_reg);
  237. break;
  238. case AssignmentOp::BitwiseOrAssignment:
  239. generator.emit<Bytecode::Op::BitwiseOr>(dst_reg, *lhs_reg, *rhs_reg);
  240. break;
  241. case AssignmentOp::BitwiseXorAssignment:
  242. generator.emit<Bytecode::Op::BitwiseXor>(dst_reg, *lhs_reg, *rhs_reg);
  243. break;
  244. case AssignmentOp::LeftShiftAssignment:
  245. generator.emit<Bytecode::Op::LeftShift>(dst_reg, *lhs_reg, *rhs_reg);
  246. break;
  247. case AssignmentOp::RightShiftAssignment:
  248. generator.emit<Bytecode::Op::RightShift>(dst_reg, *lhs_reg, *rhs_reg);
  249. break;
  250. case AssignmentOp::UnsignedRightShiftAssignment:
  251. generator.emit<Bytecode::Op::UnsignedRightShift>(dst_reg, *lhs_reg, *rhs_reg);
  252. break;
  253. default:
  254. TODO();
  255. }
  256. generator.emit<Bytecode::Op::SetVariable>(identifier.string(), dst_reg);
  257. return dst_reg;
  258. }
  259. if (is<MemberExpression>(*m_lhs)) {
  260. auto& expression = static_cast<MemberExpression const&>(*m_lhs);
  261. auto object_reg = expression.object().generate_bytecode(generator);
  262. if (expression.is_computed()) {
  263. TODO();
  264. } else {
  265. VERIFY(is<Identifier>(expression.property()));
  266. auto rhs_reg = m_rhs->generate_bytecode(generator);
  267. generator.emit<Bytecode::Op::PutById>(*object_reg, static_cast<Identifier const&>(expression.property()).string(), *rhs_reg);
  268. return rhs_reg;
  269. }
  270. }
  271. TODO();
  272. }
  273. Optional<Bytecode::Register> WhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  274. {
  275. generator.begin_continuable_scope();
  276. auto test_label = generator.make_label();
  277. auto test_result_reg = m_test->generate_bytecode(generator);
  278. VERIFY(test_result_reg.has_value());
  279. auto& test_jump = generator.emit<Bytecode::Op::JumpIfFalse>(*test_result_reg);
  280. auto body_result_reg = m_body->generate_bytecode(generator);
  281. generator.emit<Bytecode::Op::Jump>(test_label);
  282. test_jump.set_target(generator.make_label());
  283. generator.end_continuable_scope();
  284. return body_result_reg;
  285. }
  286. Optional<Bytecode::Register> DoWhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  287. {
  288. generator.begin_continuable_scope();
  289. auto head_label = generator.make_label();
  290. auto body_result_reg = m_body->generate_bytecode(generator);
  291. generator.end_continuable_scope();
  292. auto test_result_reg = m_test->generate_bytecode(generator);
  293. VERIFY(test_result_reg.has_value());
  294. generator.emit<Bytecode::Op::JumpIfTrue>(*test_result_reg, head_label);
  295. return body_result_reg;
  296. }
  297. Optional<Bytecode::Register> ForStatement::generate_bytecode(Bytecode::Generator& generator) const
  298. {
  299. Bytecode::Op::Jump* test_jump { nullptr };
  300. if (m_init) {
  301. [[maybe_unused]] auto init_result_reg = m_init->generate_bytecode(generator);
  302. }
  303. generator.begin_continuable_scope();
  304. auto jump_label = generator.make_label();
  305. if (m_test) {
  306. auto test_result_reg = m_test->generate_bytecode(generator);
  307. VERIFY(test_result_reg.has_value());
  308. test_jump = &generator.emit<Bytecode::Op::JumpIfFalse>(*test_result_reg);
  309. }
  310. auto body_result_reg = m_body->generate_bytecode(generator);
  311. if (m_update) {
  312. [[maybe_unused]] auto update_result_reg = m_update->generate_bytecode(generator);
  313. }
  314. generator.emit<Bytecode::Op::Jump>(jump_label);
  315. if (m_test)
  316. test_jump->set_target(generator.make_label());
  317. generator.end_continuable_scope();
  318. return body_result_reg;
  319. }
  320. Optional<Bytecode::Register> ObjectExpression::generate_bytecode(Bytecode::Generator& generator) const
  321. {
  322. auto reg = generator.allocate_register();
  323. generator.emit<Bytecode::Op::NewObject>(reg);
  324. if (!m_properties.is_empty()) {
  325. TODO();
  326. }
  327. return reg;
  328. }
  329. Optional<Bytecode::Register> MemberExpression::generate_bytecode(Bytecode::Generator& generator) const
  330. {
  331. auto object_reg = object().generate_bytecode(generator);
  332. if (is_computed()) {
  333. TODO();
  334. } else {
  335. VERIFY(is<Identifier>(property()));
  336. auto dst_reg = generator.allocate_register();
  337. generator.emit<Bytecode::Op::GetById>(dst_reg, *object_reg, static_cast<Identifier const&>(property()).string());
  338. return dst_reg;
  339. }
  340. }
  341. Optional<Bytecode::Register> FunctionDeclaration::generate_bytecode(Bytecode::Generator&) const
  342. {
  343. return {};
  344. }
  345. Optional<Bytecode::Register> CallExpression::generate_bytecode(Bytecode::Generator& generator) const
  346. {
  347. auto callee_reg = m_callee->generate_bytecode(generator);
  348. // FIXME: Load the correct 'this' value into 'this_reg'.
  349. auto this_reg = generator.allocate_register();
  350. generator.emit<Bytecode::Op::Load>(this_reg, js_undefined());
  351. Vector<Bytecode::Register> argument_registers;
  352. for (auto& arg : m_arguments)
  353. argument_registers.append(*arg.value->generate_bytecode(generator));
  354. auto dst_reg = generator.allocate_register();
  355. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_registers.size(), dst_reg, *callee_reg, this_reg, argument_registers);
  356. return dst_reg;
  357. }
  358. Optional<Bytecode::Register> ReturnStatement::generate_bytecode(Bytecode::Generator& generator) const
  359. {
  360. Optional<Bytecode::Register> argument_reg;
  361. if (m_argument)
  362. argument_reg = m_argument->generate_bytecode(generator);
  363. generator.emit<Bytecode::Op::Return>(argument_reg);
  364. return argument_reg;
  365. }
  366. Optional<Bytecode::Register> IfStatement::generate_bytecode(Bytecode::Generator& generator) const
  367. {
  368. auto result_reg = generator.allocate_register();
  369. auto predicate_reg = m_predicate->generate_bytecode(generator);
  370. auto& else_jump = generator.emit<Bytecode::Op::JumpIfFalse>(*predicate_reg);
  371. auto consequent_reg = m_consequent->generate_bytecode(generator);
  372. generator.emit<Bytecode::Op::LoadRegister>(result_reg, *consequent_reg);
  373. auto& end_jump = generator.emit<Bytecode::Op::Jump>();
  374. else_jump.set_target(generator.make_label());
  375. if (m_alternate) {
  376. auto alternative_reg = m_alternate->generate_bytecode(generator);
  377. generator.emit<Bytecode::Op::LoadRegister>(result_reg, *alternative_reg);
  378. } else {
  379. generator.emit<Bytecode::Op::Load>(result_reg, js_undefined());
  380. }
  381. end_jump.set_target(generator.make_label());
  382. return result_reg;
  383. }
  384. Optional<Bytecode::Register> ContinueStatement::generate_bytecode(Bytecode::Generator& generator) const
  385. {
  386. generator.emit<Bytecode::Op::Jump>(generator.nearest_continuable_scope());
  387. return {};
  388. }
  389. Optional<Bytecode::Register> DebuggerStatement::generate_bytecode(Bytecode::Generator&) const
  390. {
  391. return {};
  392. }
  393. Optional<Bytecode::Register> ConditionalExpression::generate_bytecode(Bytecode::Generator& generator) const
  394. {
  395. auto result_reg = generator.allocate_register();
  396. auto test_reg = m_test->generate_bytecode(generator);
  397. auto& alternate_jump = generator.emit<Bytecode::Op::JumpIfFalse>(*test_reg);
  398. auto consequent_reg = m_consequent->generate_bytecode(generator);
  399. generator.emit<Bytecode::Op::LoadRegister>(result_reg, *consequent_reg);
  400. auto& end_jump = generator.emit<Bytecode::Op::Jump>();
  401. alternate_jump.set_target(generator.make_label());
  402. auto alternative_reg = m_alternate->generate_bytecode(generator);
  403. generator.emit<Bytecode::Op::LoadRegister>(result_reg, *alternative_reg);
  404. end_jump.set_target(generator.make_label());
  405. return result_reg;
  406. }
  407. Optional<Bytecode::Register> SequenceExpression::generate_bytecode(Bytecode::Generator& generator) const
  408. {
  409. Optional<Bytecode::Register> last_reg;
  410. for (auto& expression : m_expressions)
  411. last_reg = expression.generate_bytecode(generator);
  412. return last_reg;
  413. }
  414. }