ASTCodegen.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446
  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. void ASTNode::generate_bytecode(Bytecode::Generator&) const
  14. {
  15. dbgln("Missing generate_bytecode()");
  16. TODO();
  17. }
  18. void ScopeNode::generate_bytecode(Bytecode::Generator& generator) const
  19. {
  20. generator.emit<Bytecode::Op::EnterScope>(*this);
  21. for (auto& child : children())
  22. child.generate_bytecode(generator);
  23. }
  24. void EmptyStatement::generate_bytecode(Bytecode::Generator&) const
  25. {
  26. }
  27. void ExpressionStatement::generate_bytecode(Bytecode::Generator& generator) const
  28. {
  29. m_expression->generate_bytecode(generator);
  30. }
  31. void BinaryExpression::generate_bytecode(Bytecode::Generator& generator) const
  32. {
  33. m_lhs->generate_bytecode(generator);
  34. auto lhs_reg = generator.allocate_register();
  35. generator.emit<Bytecode::Op::Store>(lhs_reg);
  36. m_rhs->generate_bytecode(generator);
  37. switch (m_op) {
  38. case BinaryOp::Addition:
  39. generator.emit<Bytecode::Op::Add>(lhs_reg);
  40. break;
  41. case BinaryOp::Subtraction:
  42. generator.emit<Bytecode::Op::Sub>(lhs_reg);
  43. break;
  44. case BinaryOp::Multiplication:
  45. generator.emit<Bytecode::Op::Mul>(lhs_reg);
  46. break;
  47. case BinaryOp::Division:
  48. generator.emit<Bytecode::Op::Div>(lhs_reg);
  49. break;
  50. case BinaryOp::Modulo:
  51. generator.emit<Bytecode::Op::Mod>(lhs_reg);
  52. break;
  53. case BinaryOp::Exponentiation:
  54. generator.emit<Bytecode::Op::Exp>(lhs_reg);
  55. break;
  56. case BinaryOp::GreaterThan:
  57. generator.emit<Bytecode::Op::GreaterThan>(lhs_reg);
  58. break;
  59. case BinaryOp::GreaterThanEquals:
  60. generator.emit<Bytecode::Op::GreaterThanEquals>(lhs_reg);
  61. break;
  62. case BinaryOp::LessThan:
  63. generator.emit<Bytecode::Op::LessThan>(lhs_reg);
  64. break;
  65. case BinaryOp::LessThanEquals:
  66. generator.emit<Bytecode::Op::LessThanEquals>(lhs_reg);
  67. break;
  68. case BinaryOp::AbstractInequals:
  69. generator.emit<Bytecode::Op::AbstractInequals>(lhs_reg);
  70. break;
  71. case BinaryOp::AbstractEquals:
  72. generator.emit<Bytecode::Op::AbstractEquals>(lhs_reg);
  73. break;
  74. case BinaryOp::TypedInequals:
  75. generator.emit<Bytecode::Op::TypedInequals>(lhs_reg);
  76. break;
  77. case BinaryOp::TypedEquals:
  78. generator.emit<Bytecode::Op::TypedEquals>(lhs_reg);
  79. break;
  80. case BinaryOp::BitwiseAnd:
  81. generator.emit<Bytecode::Op::BitwiseAnd>(lhs_reg);
  82. break;
  83. case BinaryOp::BitwiseOr:
  84. generator.emit<Bytecode::Op::BitwiseOr>(lhs_reg);
  85. break;
  86. case BinaryOp::BitwiseXor:
  87. generator.emit<Bytecode::Op::BitwiseXor>(lhs_reg);
  88. break;
  89. case BinaryOp::LeftShift:
  90. generator.emit<Bytecode::Op::LeftShift>(lhs_reg);
  91. break;
  92. case BinaryOp::RightShift:
  93. generator.emit<Bytecode::Op::RightShift>(lhs_reg);
  94. break;
  95. case BinaryOp::UnsignedRightShift:
  96. generator.emit<Bytecode::Op::UnsignedRightShift>(lhs_reg);
  97. break;
  98. case BinaryOp::In:
  99. generator.emit<Bytecode::Op::In>(lhs_reg);
  100. break;
  101. case BinaryOp::InstanceOf:
  102. generator.emit<Bytecode::Op::InstanceOf>(lhs_reg);
  103. break;
  104. default:
  105. VERIFY_NOT_REACHED();
  106. }
  107. }
  108. void LogicalExpression::generate_bytecode(Bytecode::Generator& generator) const
  109. {
  110. m_lhs->generate_bytecode(generator);
  111. Bytecode::InstructionHandle<Bytecode::Op::Jump> test_instr;
  112. switch (m_op) {
  113. case LogicalOp::And:
  114. test_instr = generator.emit<Bytecode::Op::JumpIfFalse>();
  115. break;
  116. case LogicalOp::Or:
  117. test_instr = generator.emit<Bytecode::Op::JumpIfTrue>();
  118. break;
  119. case LogicalOp::NullishCoalescing:
  120. test_instr = generator.emit<Bytecode::Op::JumpIfNotNullish>();
  121. break;
  122. default:
  123. VERIFY_NOT_REACHED();
  124. }
  125. m_rhs->generate_bytecode(generator);
  126. test_instr->set_target(generator.make_label());
  127. }
  128. void UnaryExpression::generate_bytecode(Bytecode::Generator& generator) const
  129. {
  130. m_lhs->generate_bytecode(generator);
  131. switch (m_op) {
  132. case UnaryOp::BitwiseNot:
  133. generator.emit<Bytecode::Op::BitwiseNot>();
  134. break;
  135. case UnaryOp::Not:
  136. generator.emit<Bytecode::Op::Not>();
  137. break;
  138. case UnaryOp::Plus:
  139. generator.emit<Bytecode::Op::UnaryPlus>();
  140. break;
  141. case UnaryOp::Minus:
  142. generator.emit<Bytecode::Op::UnaryMinus>();
  143. break;
  144. case UnaryOp::Typeof:
  145. generator.emit<Bytecode::Op::Typeof>();
  146. break;
  147. case UnaryOp::Void:
  148. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  149. break;
  150. default:
  151. TODO();
  152. }
  153. }
  154. void NumericLiteral::generate_bytecode(Bytecode::Generator& generator) const
  155. {
  156. generator.emit<Bytecode::Op::LoadImmediate>(m_value);
  157. }
  158. void BooleanLiteral::generate_bytecode(Bytecode::Generator& generator) const
  159. {
  160. generator.emit<Bytecode::Op::LoadImmediate>(Value(m_value));
  161. }
  162. void NullLiteral::generate_bytecode(Bytecode::Generator& generator) const
  163. {
  164. generator.emit<Bytecode::Op::LoadImmediate>(js_null());
  165. }
  166. void BigIntLiteral::generate_bytecode(Bytecode::Generator& generator) const
  167. {
  168. generator.emit<Bytecode::Op::NewBigInt>(Crypto::SignedBigInteger::from_base10(m_value.substring(0, m_value.length() - 1)));
  169. }
  170. void StringLiteral::generate_bytecode(Bytecode::Generator& generator) const
  171. {
  172. generator.emit<Bytecode::Op::NewString>(m_value);
  173. }
  174. void Identifier::generate_bytecode(Bytecode::Generator& generator) const
  175. {
  176. generator.emit<Bytecode::Op::GetVariable>(m_string);
  177. }
  178. void AssignmentExpression::generate_bytecode(Bytecode::Generator& generator) const
  179. {
  180. if (is<Identifier>(*m_lhs)) {
  181. auto& identifier = static_cast<Identifier const&>(*m_lhs);
  182. if (m_op == AssignmentOp::Assignment) {
  183. m_rhs->generate_bytecode(generator);
  184. generator.emit<Bytecode::Op::SetVariable>(identifier.string());
  185. return;
  186. }
  187. m_lhs->generate_bytecode(generator);
  188. auto lhs_reg = generator.allocate_register();
  189. generator.emit<Bytecode::Op::Store>(lhs_reg);
  190. m_rhs->generate_bytecode(generator);
  191. switch (m_op) {
  192. case AssignmentOp::AdditionAssignment:
  193. generator.emit<Bytecode::Op::Add>(lhs_reg);
  194. break;
  195. case AssignmentOp::SubtractionAssignment:
  196. generator.emit<Bytecode::Op::Sub>(lhs_reg);
  197. break;
  198. case AssignmentOp::MultiplicationAssignment:
  199. generator.emit<Bytecode::Op::Mul>(lhs_reg);
  200. break;
  201. case AssignmentOp::DivisionAssignment:
  202. generator.emit<Bytecode::Op::Div>(lhs_reg);
  203. break;
  204. case AssignmentOp::ModuloAssignment:
  205. generator.emit<Bytecode::Op::Mod>(lhs_reg);
  206. break;
  207. case AssignmentOp::ExponentiationAssignment:
  208. generator.emit<Bytecode::Op::Exp>(lhs_reg);
  209. break;
  210. case AssignmentOp::BitwiseAndAssignment:
  211. generator.emit<Bytecode::Op::BitwiseAnd>(lhs_reg);
  212. break;
  213. case AssignmentOp::BitwiseOrAssignment:
  214. generator.emit<Bytecode::Op::BitwiseOr>(lhs_reg);
  215. break;
  216. case AssignmentOp::BitwiseXorAssignment:
  217. generator.emit<Bytecode::Op::BitwiseXor>(lhs_reg);
  218. break;
  219. case AssignmentOp::LeftShiftAssignment:
  220. generator.emit<Bytecode::Op::LeftShift>(lhs_reg);
  221. break;
  222. case AssignmentOp::RightShiftAssignment:
  223. generator.emit<Bytecode::Op::RightShift>(lhs_reg);
  224. break;
  225. case AssignmentOp::UnsignedRightShiftAssignment:
  226. generator.emit<Bytecode::Op::UnsignedRightShift>(lhs_reg);
  227. break;
  228. default:
  229. TODO();
  230. }
  231. generator.emit<Bytecode::Op::SetVariable>(identifier.string());
  232. return;
  233. }
  234. if (is<MemberExpression>(*m_lhs)) {
  235. auto& expression = static_cast<MemberExpression const&>(*m_lhs);
  236. expression.object().generate_bytecode(generator);
  237. auto object_reg = generator.allocate_register();
  238. generator.emit<Bytecode::Op::Store>(object_reg);
  239. if (expression.is_computed()) {
  240. TODO();
  241. } else {
  242. VERIFY(is<Identifier>(expression.property()));
  243. m_rhs->generate_bytecode(generator);
  244. generator.emit<Bytecode::Op::PutById>(object_reg, static_cast<Identifier const&>(expression.property()).string());
  245. return;
  246. }
  247. }
  248. TODO();
  249. }
  250. void WhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  251. {
  252. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  253. generator.begin_continuable_scope();
  254. auto test_label = generator.make_label();
  255. auto result_reg = generator.allocate_register();
  256. generator.emit<Bytecode::Op::Store>(result_reg);
  257. m_test->generate_bytecode(generator);
  258. auto test_jump = generator.emit<Bytecode::Op::JumpIfFalse>();
  259. m_body->generate_bytecode(generator);
  260. generator.emit<Bytecode::Op::Jump>(test_label);
  261. test_jump->set_target(generator.make_label());
  262. generator.end_continuable_scope();
  263. generator.emit<Bytecode::Op::Load>(result_reg);
  264. }
  265. void DoWhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  266. {
  267. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  268. generator.begin_continuable_scope();
  269. auto head_label = generator.make_label();
  270. m_body->generate_bytecode(generator);
  271. generator.end_continuable_scope();
  272. auto result_reg = generator.allocate_register();
  273. generator.emit<Bytecode::Op::Store>(result_reg);
  274. m_test->generate_bytecode(generator);
  275. generator.emit<Bytecode::Op::JumpIfTrue>(head_label);
  276. generator.emit<Bytecode::Op::Load>(result_reg);
  277. }
  278. void ForStatement::generate_bytecode(Bytecode::Generator& generator) const
  279. {
  280. Bytecode::InstructionHandle<Bytecode::Op::Jump> test_jump;
  281. if (m_init)
  282. m_init->generate_bytecode(generator);
  283. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  284. generator.begin_continuable_scope();
  285. auto jump_label = generator.make_label();
  286. auto result_reg = generator.allocate_register();
  287. generator.emit<Bytecode::Op::Store>(result_reg);
  288. if (m_test) {
  289. m_test->generate_bytecode(generator);
  290. test_jump = generator.emit<Bytecode::Op::JumpIfFalse>();
  291. }
  292. m_body->generate_bytecode(generator);
  293. if (m_update)
  294. m_update->generate_bytecode(generator);
  295. generator.emit<Bytecode::Op::Jump>(jump_label);
  296. if (m_test)
  297. test_jump->set_target(generator.make_label());
  298. generator.end_continuable_scope();
  299. generator.emit<Bytecode::Op::Load>(result_reg);
  300. }
  301. void ObjectExpression::generate_bytecode(Bytecode::Generator& generator) const
  302. {
  303. generator.emit<Bytecode::Op::NewObject>();
  304. if (!m_properties.is_empty())
  305. TODO();
  306. }
  307. void MemberExpression::generate_bytecode(Bytecode::Generator& generator) const
  308. {
  309. object().generate_bytecode(generator);
  310. if (is_computed()) {
  311. TODO();
  312. } else {
  313. VERIFY(is<Identifier>(property()));
  314. generator.emit<Bytecode::Op::GetById>(static_cast<Identifier const&>(property()).string());
  315. }
  316. }
  317. void FunctionDeclaration::generate_bytecode(Bytecode::Generator&) const
  318. {
  319. }
  320. void CallExpression::generate_bytecode(Bytecode::Generator& generator) const
  321. {
  322. m_callee->generate_bytecode(generator);
  323. auto callee_reg = generator.allocate_register();
  324. generator.emit<Bytecode::Op::Store>(callee_reg);
  325. // FIXME: Load the correct 'this' value into 'this_reg'.
  326. auto this_reg = generator.allocate_register();
  327. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  328. generator.emit<Bytecode::Op::Store>(this_reg);
  329. Vector<Bytecode::Register> argument_registers;
  330. for (auto& arg : m_arguments) {
  331. arg.value->generate_bytecode(generator);
  332. auto arg_reg = generator.allocate_register();
  333. generator.emit<Bytecode::Op::Store>(arg_reg);
  334. argument_registers.append(arg_reg);
  335. }
  336. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_registers.size(), callee_reg, this_reg, argument_registers);
  337. }
  338. void ReturnStatement::generate_bytecode(Bytecode::Generator& generator) const
  339. {
  340. generator.emit<Bytecode::Op::Return>();
  341. }
  342. void IfStatement::generate_bytecode(Bytecode::Generator& generator) const
  343. {
  344. m_predicate->generate_bytecode(generator);
  345. auto else_jump = generator.emit<Bytecode::Op::JumpIfFalse>();
  346. m_consequent->generate_bytecode(generator);
  347. if (m_alternate) {
  348. auto if_jump = generator.emit<Bytecode::Op::Jump>();
  349. else_jump->set_target(generator.make_label());
  350. m_alternate->generate_bytecode(generator);
  351. if_jump->set_target(generator.make_label());
  352. } else {
  353. else_jump->set_target(generator.make_label());
  354. }
  355. }
  356. void ContinueStatement::generate_bytecode(Bytecode::Generator& generator) const
  357. {
  358. generator.emit<Bytecode::Op::Jump>(generator.nearest_continuable_scope());
  359. }
  360. void DebuggerStatement::generate_bytecode(Bytecode::Generator&) const
  361. {
  362. }
  363. void ConditionalExpression::generate_bytecode(Bytecode::Generator& generator) const
  364. {
  365. m_test->generate_bytecode(generator);
  366. auto alternate_jump = generator.emit<Bytecode::Op::JumpIfFalse>();
  367. m_consequent->generate_bytecode(generator);
  368. auto end_jump = generator.emit<Bytecode::Op::Jump>();
  369. alternate_jump->set_target(generator.make_label());
  370. m_alternate->generate_bytecode(generator);
  371. end_jump->set_target(generator.make_label());
  372. }
  373. void SequenceExpression::generate_bytecode(Bytecode::Generator& generator) const
  374. {
  375. for (auto& expression : m_expressions)
  376. expression.generate_bytecode(generator);
  377. }
  378. void TemplateLiteral::generate_bytecode(Bytecode::Generator& generator) const
  379. {
  380. auto string_reg = generator.allocate_register();
  381. for (size_t i = 0; i < m_expressions.size(); i++) {
  382. m_expressions[i].generate_bytecode(generator);
  383. if (i == 0) {
  384. generator.emit<Bytecode::Op::Store>(string_reg);
  385. } else {
  386. generator.emit<Bytecode::Op::ConcatString>(string_reg);
  387. }
  388. }
  389. }
  390. }