ASTCodegen.cpp 37 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053
  1. /*
  2. * Copyright (c) 2021, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2021, Linus Groh <linusg@serenityos.org>
  4. * Copyright (c) 2021, Gunnar Beutner <gbeutner@serenityos.org>
  5. * Copyright (c) 2021, Marcin Gasperowicz <xnooga@gmail.com>
  6. *
  7. * SPDX-License-Identifier: BSD-2-Clause
  8. */
  9. #include <AK/Format.h>
  10. #include <LibJS/AST.h>
  11. #include <LibJS/Bytecode/Generator.h>
  12. #include <LibJS/Bytecode/Instruction.h>
  13. #include <LibJS/Bytecode/Op.h>
  14. #include <LibJS/Bytecode/Register.h>
  15. #include <LibJS/Bytecode/StringTable.h>
  16. #include <LibJS/Runtime/ScopeObject.h>
  17. namespace JS {
  18. void ASTNode::generate_bytecode(Bytecode::Generator&) const
  19. {
  20. dbgln("Missing generate_bytecode() in {}", class_name());
  21. TODO();
  22. }
  23. void ScopeNode::generate_bytecode(Bytecode::Generator& generator) const
  24. {
  25. for (auto& function : functions()) {
  26. generator.emit<Bytecode::Op::NewFunction>(function);
  27. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(function.name()));
  28. }
  29. HashMap<u32, Variable> scope_variables_with_declaration_kind;
  30. bool is_program_node = is<Program>(*this);
  31. for (auto& declaration : variables()) {
  32. for (auto& declarator : declaration.declarations()) {
  33. if (is_program_node && declaration.declaration_kind() == DeclarationKind::Var) {
  34. declarator.target().visit(
  35. [&](const NonnullRefPtr<Identifier>& id) {
  36. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  37. generator.emit<Bytecode::Op::PutById>(Bytecode::Register::global_object(), generator.intern_string(id->string()));
  38. },
  39. [&](const NonnullRefPtr<BindingPattern>& binding) {
  40. binding->for_each_assigned_name([&](const auto& name) {
  41. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  42. generator.emit<Bytecode::Op::PutById>(Bytecode::Register::global_object(), generator.intern_string(name));
  43. });
  44. });
  45. } else {
  46. declarator.target().visit(
  47. [&](const NonnullRefPtr<Identifier>& id) {
  48. scope_variables_with_declaration_kind.set((size_t)generator.intern_string(id->string()).value(), { js_undefined(), declaration.declaration_kind() });
  49. },
  50. [&](const NonnullRefPtr<BindingPattern>& binding) {
  51. binding->for_each_assigned_name([&](const auto& name) {
  52. scope_variables_with_declaration_kind.set((size_t)generator.intern_string(name).value(), { js_undefined(), declaration.declaration_kind() });
  53. });
  54. });
  55. }
  56. }
  57. }
  58. if (!scope_variables_with_declaration_kind.is_empty()) {
  59. generator.emit<Bytecode::Op::PushLexicalEnvironment>(move(scope_variables_with_declaration_kind));
  60. }
  61. for (auto& child : children()) {
  62. child.generate_bytecode(generator);
  63. if (generator.is_current_block_terminated())
  64. break;
  65. }
  66. }
  67. void EmptyStatement::generate_bytecode(Bytecode::Generator&) const
  68. {
  69. }
  70. void ExpressionStatement::generate_bytecode(Bytecode::Generator& generator) const
  71. {
  72. m_expression->generate_bytecode(generator);
  73. }
  74. void BinaryExpression::generate_bytecode(Bytecode::Generator& generator) const
  75. {
  76. m_lhs->generate_bytecode(generator);
  77. auto lhs_reg = generator.allocate_register();
  78. generator.emit<Bytecode::Op::Store>(lhs_reg);
  79. m_rhs->generate_bytecode(generator);
  80. switch (m_op) {
  81. case BinaryOp::Addition:
  82. generator.emit<Bytecode::Op::Add>(lhs_reg);
  83. break;
  84. case BinaryOp::Subtraction:
  85. generator.emit<Bytecode::Op::Sub>(lhs_reg);
  86. break;
  87. case BinaryOp::Multiplication:
  88. generator.emit<Bytecode::Op::Mul>(lhs_reg);
  89. break;
  90. case BinaryOp::Division:
  91. generator.emit<Bytecode::Op::Div>(lhs_reg);
  92. break;
  93. case BinaryOp::Modulo:
  94. generator.emit<Bytecode::Op::Mod>(lhs_reg);
  95. break;
  96. case BinaryOp::Exponentiation:
  97. generator.emit<Bytecode::Op::Exp>(lhs_reg);
  98. break;
  99. case BinaryOp::GreaterThan:
  100. generator.emit<Bytecode::Op::GreaterThan>(lhs_reg);
  101. break;
  102. case BinaryOp::GreaterThanEquals:
  103. generator.emit<Bytecode::Op::GreaterThanEquals>(lhs_reg);
  104. break;
  105. case BinaryOp::LessThan:
  106. generator.emit<Bytecode::Op::LessThan>(lhs_reg);
  107. break;
  108. case BinaryOp::LessThanEquals:
  109. generator.emit<Bytecode::Op::LessThanEquals>(lhs_reg);
  110. break;
  111. case BinaryOp::AbstractInequals:
  112. generator.emit<Bytecode::Op::AbstractInequals>(lhs_reg);
  113. break;
  114. case BinaryOp::AbstractEquals:
  115. generator.emit<Bytecode::Op::AbstractEquals>(lhs_reg);
  116. break;
  117. case BinaryOp::TypedInequals:
  118. generator.emit<Bytecode::Op::TypedInequals>(lhs_reg);
  119. break;
  120. case BinaryOp::TypedEquals:
  121. generator.emit<Bytecode::Op::TypedEquals>(lhs_reg);
  122. break;
  123. case BinaryOp::BitwiseAnd:
  124. generator.emit<Bytecode::Op::BitwiseAnd>(lhs_reg);
  125. break;
  126. case BinaryOp::BitwiseOr:
  127. generator.emit<Bytecode::Op::BitwiseOr>(lhs_reg);
  128. break;
  129. case BinaryOp::BitwiseXor:
  130. generator.emit<Bytecode::Op::BitwiseXor>(lhs_reg);
  131. break;
  132. case BinaryOp::LeftShift:
  133. generator.emit<Bytecode::Op::LeftShift>(lhs_reg);
  134. break;
  135. case BinaryOp::RightShift:
  136. generator.emit<Bytecode::Op::RightShift>(lhs_reg);
  137. break;
  138. case BinaryOp::UnsignedRightShift:
  139. generator.emit<Bytecode::Op::UnsignedRightShift>(lhs_reg);
  140. break;
  141. case BinaryOp::In:
  142. generator.emit<Bytecode::Op::In>(lhs_reg);
  143. break;
  144. case BinaryOp::InstanceOf:
  145. generator.emit<Bytecode::Op::InstanceOf>(lhs_reg);
  146. break;
  147. default:
  148. VERIFY_NOT_REACHED();
  149. }
  150. }
  151. void LogicalExpression::generate_bytecode(Bytecode::Generator& generator) const
  152. {
  153. m_lhs->generate_bytecode(generator);
  154. // lhs
  155. // jump op (true) end (false) rhs
  156. // rhs
  157. // jump always (true) end
  158. // end
  159. auto& rhs_block = generator.make_block();
  160. auto& end_block = generator.make_block();
  161. switch (m_op) {
  162. case LogicalOp::And:
  163. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  164. Bytecode::Label { rhs_block },
  165. Bytecode::Label { end_block });
  166. break;
  167. case LogicalOp::Or:
  168. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  169. Bytecode::Label { end_block },
  170. Bytecode::Label { rhs_block });
  171. break;
  172. case LogicalOp::NullishCoalescing:
  173. generator.emit<Bytecode::Op::JumpNullish>().set_targets(
  174. Bytecode::Label { rhs_block },
  175. Bytecode::Label { end_block });
  176. break;
  177. default:
  178. VERIFY_NOT_REACHED();
  179. }
  180. generator.switch_to_basic_block(rhs_block);
  181. m_rhs->generate_bytecode(generator);
  182. generator.emit<Bytecode::Op::Jump>().set_targets(
  183. Bytecode::Label { end_block },
  184. {});
  185. generator.switch_to_basic_block(end_block);
  186. }
  187. void UnaryExpression::generate_bytecode(Bytecode::Generator& generator) const
  188. {
  189. m_lhs->generate_bytecode(generator);
  190. switch (m_op) {
  191. case UnaryOp::BitwiseNot:
  192. generator.emit<Bytecode::Op::BitwiseNot>();
  193. break;
  194. case UnaryOp::Not:
  195. generator.emit<Bytecode::Op::Not>();
  196. break;
  197. case UnaryOp::Plus:
  198. generator.emit<Bytecode::Op::UnaryPlus>();
  199. break;
  200. case UnaryOp::Minus:
  201. generator.emit<Bytecode::Op::UnaryMinus>();
  202. break;
  203. case UnaryOp::Typeof:
  204. generator.emit<Bytecode::Op::Typeof>();
  205. break;
  206. case UnaryOp::Void:
  207. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  208. break;
  209. default:
  210. TODO();
  211. }
  212. }
  213. void NumericLiteral::generate_bytecode(Bytecode::Generator& generator) const
  214. {
  215. generator.emit<Bytecode::Op::LoadImmediate>(m_value);
  216. }
  217. void BooleanLiteral::generate_bytecode(Bytecode::Generator& generator) const
  218. {
  219. generator.emit<Bytecode::Op::LoadImmediate>(Value(m_value));
  220. }
  221. void NullLiteral::generate_bytecode(Bytecode::Generator& generator) const
  222. {
  223. generator.emit<Bytecode::Op::LoadImmediate>(js_null());
  224. }
  225. void BigIntLiteral::generate_bytecode(Bytecode::Generator& generator) const
  226. {
  227. generator.emit<Bytecode::Op::NewBigInt>(Crypto::SignedBigInteger::from_base10(m_value.substring(0, m_value.length() - 1)));
  228. }
  229. void StringLiteral::generate_bytecode(Bytecode::Generator& generator) const
  230. {
  231. generator.emit<Bytecode::Op::NewString>(generator.intern_string(m_value));
  232. }
  233. void Identifier::generate_bytecode(Bytecode::Generator& generator) const
  234. {
  235. generator.emit<Bytecode::Op::GetVariable>(generator.intern_string(m_string));
  236. }
  237. void AssignmentExpression::generate_bytecode(Bytecode::Generator& generator) const
  238. {
  239. if (is<Identifier>(*m_lhs)) {
  240. auto& identifier = static_cast<Identifier const&>(*m_lhs);
  241. if (m_op == AssignmentOp::Assignment) {
  242. m_rhs->generate_bytecode(generator);
  243. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier.string()));
  244. return;
  245. }
  246. m_lhs->generate_bytecode(generator);
  247. Bytecode::BasicBlock* rhs_block_ptr { nullptr };
  248. Bytecode::BasicBlock* end_block_ptr { nullptr };
  249. // Logical assignments short circuit.
  250. if (m_op == AssignmentOp::AndAssignment) { // &&=
  251. rhs_block_ptr = &generator.make_block();
  252. end_block_ptr = &generator.make_block();
  253. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  254. Bytecode::Label { *rhs_block_ptr },
  255. Bytecode::Label { *end_block_ptr });
  256. } else if (m_op == AssignmentOp::OrAssignment) { // ||=
  257. rhs_block_ptr = &generator.make_block();
  258. end_block_ptr = &generator.make_block();
  259. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  260. Bytecode::Label { *end_block_ptr },
  261. Bytecode::Label { *rhs_block_ptr });
  262. } else if (m_op == AssignmentOp::NullishAssignment) { // ??=
  263. rhs_block_ptr = &generator.make_block();
  264. end_block_ptr = &generator.make_block();
  265. generator.emit<Bytecode::Op::JumpNullish>().set_targets(
  266. Bytecode::Label { *rhs_block_ptr },
  267. Bytecode::Label { *end_block_ptr });
  268. }
  269. if (rhs_block_ptr)
  270. generator.switch_to_basic_block(*rhs_block_ptr);
  271. // lhs_reg is a part of the rhs_block because the store isn't necessary
  272. // if the logical assignment condition fails.
  273. auto lhs_reg = generator.allocate_register();
  274. generator.emit<Bytecode::Op::Store>(lhs_reg);
  275. m_rhs->generate_bytecode(generator);
  276. switch (m_op) {
  277. case AssignmentOp::AdditionAssignment:
  278. generator.emit<Bytecode::Op::Add>(lhs_reg);
  279. break;
  280. case AssignmentOp::SubtractionAssignment:
  281. generator.emit<Bytecode::Op::Sub>(lhs_reg);
  282. break;
  283. case AssignmentOp::MultiplicationAssignment:
  284. generator.emit<Bytecode::Op::Mul>(lhs_reg);
  285. break;
  286. case AssignmentOp::DivisionAssignment:
  287. generator.emit<Bytecode::Op::Div>(lhs_reg);
  288. break;
  289. case AssignmentOp::ModuloAssignment:
  290. generator.emit<Bytecode::Op::Mod>(lhs_reg);
  291. break;
  292. case AssignmentOp::ExponentiationAssignment:
  293. generator.emit<Bytecode::Op::Exp>(lhs_reg);
  294. break;
  295. case AssignmentOp::BitwiseAndAssignment:
  296. generator.emit<Bytecode::Op::BitwiseAnd>(lhs_reg);
  297. break;
  298. case AssignmentOp::BitwiseOrAssignment:
  299. generator.emit<Bytecode::Op::BitwiseOr>(lhs_reg);
  300. break;
  301. case AssignmentOp::BitwiseXorAssignment:
  302. generator.emit<Bytecode::Op::BitwiseXor>(lhs_reg);
  303. break;
  304. case AssignmentOp::LeftShiftAssignment:
  305. generator.emit<Bytecode::Op::LeftShift>(lhs_reg);
  306. break;
  307. case AssignmentOp::RightShiftAssignment:
  308. generator.emit<Bytecode::Op::RightShift>(lhs_reg);
  309. break;
  310. case AssignmentOp::UnsignedRightShiftAssignment:
  311. generator.emit<Bytecode::Op::UnsignedRightShift>(lhs_reg);
  312. break;
  313. case AssignmentOp::AndAssignment:
  314. case AssignmentOp::OrAssignment:
  315. case AssignmentOp::NullishAssignment:
  316. break; // These are handled above.
  317. default:
  318. TODO();
  319. }
  320. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier.string()));
  321. if (end_block_ptr) {
  322. generator.emit<Bytecode::Op::Jump>().set_targets(
  323. Bytecode::Label { *end_block_ptr },
  324. {});
  325. generator.switch_to_basic_block(*end_block_ptr);
  326. }
  327. return;
  328. }
  329. if (is<MemberExpression>(*m_lhs)) {
  330. auto& expression = static_cast<MemberExpression const&>(*m_lhs);
  331. expression.object().generate_bytecode(generator);
  332. auto object_reg = generator.allocate_register();
  333. generator.emit<Bytecode::Op::Store>(object_reg);
  334. if (expression.is_computed()) {
  335. expression.property().generate_bytecode(generator);
  336. auto property_reg = generator.allocate_register();
  337. generator.emit<Bytecode::Op::Store>(property_reg);
  338. m_rhs->generate_bytecode(generator);
  339. generator.emit<Bytecode::Op::PutByValue>(object_reg, property_reg);
  340. } else {
  341. VERIFY(is<Identifier>(expression.property()));
  342. m_rhs->generate_bytecode(generator);
  343. auto identifier_table_ref = generator.intern_string(static_cast<Identifier const&>(expression.property()).string());
  344. generator.emit<Bytecode::Op::PutById>(object_reg, identifier_table_ref);
  345. }
  346. return;
  347. }
  348. TODO();
  349. }
  350. void WhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  351. {
  352. // test
  353. // jump if_false (true) end (false) body
  354. // body
  355. // jump always (true) test
  356. // end
  357. auto& test_block = generator.make_block();
  358. auto& body_block = generator.make_block();
  359. auto& end_block = generator.make_block();
  360. // Init result register
  361. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  362. auto result_reg = generator.allocate_register();
  363. generator.emit<Bytecode::Op::Store>(result_reg);
  364. // jump to the test block
  365. generator.emit<Bytecode::Op::Jump>().set_targets(
  366. Bytecode::Label { test_block },
  367. {});
  368. generator.switch_to_basic_block(test_block);
  369. m_test->generate_bytecode(generator);
  370. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  371. Bytecode::Label { body_block },
  372. Bytecode::Label { end_block });
  373. generator.switch_to_basic_block(body_block);
  374. generator.begin_continuable_scope(Bytecode::Label { test_block });
  375. generator.begin_breakable_scope(Bytecode::Label { end_block });
  376. m_body->generate_bytecode(generator);
  377. if (!generator.is_current_block_terminated()) {
  378. generator.emit<Bytecode::Op::Jump>().set_targets(
  379. Bytecode::Label { test_block },
  380. {});
  381. generator.end_continuable_scope();
  382. generator.end_breakable_scope();
  383. generator.switch_to_basic_block(end_block);
  384. generator.emit<Bytecode::Op::Load>(result_reg);
  385. }
  386. }
  387. void DoWhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  388. {
  389. // jump always (true) body
  390. // test
  391. // jump if_false (true) end (false) body
  392. // body
  393. // jump always (true) test
  394. // end
  395. auto& test_block = generator.make_block();
  396. auto& body_block = generator.make_block();
  397. auto& end_block = generator.make_block();
  398. // Init result register
  399. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  400. auto result_reg = generator.allocate_register();
  401. generator.emit<Bytecode::Op::Store>(result_reg);
  402. // jump to the body block
  403. generator.emit<Bytecode::Op::Jump>().set_targets(
  404. Bytecode::Label { body_block },
  405. {});
  406. generator.switch_to_basic_block(test_block);
  407. m_test->generate_bytecode(generator);
  408. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  409. Bytecode::Label { body_block },
  410. Bytecode::Label { end_block });
  411. generator.switch_to_basic_block(body_block);
  412. generator.begin_continuable_scope(Bytecode::Label { test_block });
  413. generator.begin_breakable_scope(Bytecode::Label { end_block });
  414. m_body->generate_bytecode(generator);
  415. if (!generator.is_current_block_terminated()) {
  416. generator.emit<Bytecode::Op::Jump>().set_targets(
  417. Bytecode::Label { test_block },
  418. {});
  419. generator.end_continuable_scope();
  420. generator.end_breakable_scope();
  421. generator.switch_to_basic_block(end_block);
  422. generator.emit<Bytecode::Op::Load>(result_reg);
  423. }
  424. }
  425. void ForStatement::generate_bytecode(Bytecode::Generator& generator) const
  426. {
  427. // init
  428. // jump always (true) test
  429. // test
  430. // jump if_true (true) body (false) end
  431. // body
  432. // jump always (true) update
  433. // update
  434. // jump always (true) test
  435. // end
  436. // If 'test' is missing, fuse the 'test' and 'body' basic blocks
  437. // If 'update' is missing, fuse the 'body' and 'update' basic blocks
  438. Bytecode::BasicBlock* test_block_ptr { nullptr };
  439. Bytecode::BasicBlock* body_block_ptr { nullptr };
  440. Bytecode::BasicBlock* update_block_ptr { nullptr };
  441. auto& end_block = generator.make_block();
  442. if (m_init)
  443. m_init->generate_bytecode(generator);
  444. body_block_ptr = &generator.make_block();
  445. if (m_test)
  446. test_block_ptr = &generator.make_block();
  447. else
  448. test_block_ptr = body_block_ptr;
  449. if (m_update)
  450. update_block_ptr = &generator.make_block();
  451. else
  452. update_block_ptr = body_block_ptr;
  453. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  454. auto result_reg = generator.allocate_register();
  455. generator.emit<Bytecode::Op::Store>(result_reg);
  456. generator.emit<Bytecode::Op::Jump>().set_targets(
  457. Bytecode::Label { *test_block_ptr },
  458. {});
  459. if (m_test) {
  460. generator.switch_to_basic_block(*test_block_ptr);
  461. m_test->generate_bytecode(generator);
  462. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  463. Bytecode::Label { *body_block_ptr },
  464. Bytecode::Label { end_block });
  465. }
  466. generator.switch_to_basic_block(*body_block_ptr);
  467. generator.begin_continuable_scope(Bytecode::Label { *update_block_ptr });
  468. generator.begin_breakable_scope(Bytecode::Label { end_block });
  469. m_body->generate_bytecode(generator);
  470. generator.end_continuable_scope();
  471. if (!generator.is_current_block_terminated()) {
  472. if (m_update) {
  473. generator.emit<Bytecode::Op::Jump>().set_targets(
  474. Bytecode::Label { *update_block_ptr },
  475. {});
  476. generator.switch_to_basic_block(*update_block_ptr);
  477. m_update->generate_bytecode(generator);
  478. }
  479. generator.emit<Bytecode::Op::Jump>().set_targets(
  480. Bytecode::Label { *test_block_ptr },
  481. {});
  482. generator.end_breakable_scope();
  483. generator.switch_to_basic_block(end_block);
  484. generator.emit<Bytecode::Op::Load>(result_reg);
  485. }
  486. }
  487. void ObjectExpression::generate_bytecode(Bytecode::Generator& generator) const
  488. {
  489. generator.emit<Bytecode::Op::NewObject>();
  490. if (m_properties.is_empty())
  491. return;
  492. auto object_reg = generator.allocate_register();
  493. generator.emit<Bytecode::Op::Store>(object_reg);
  494. for (auto& property : m_properties) {
  495. if (property.type() != ObjectProperty::Type::KeyValue)
  496. TODO();
  497. if (is<StringLiteral>(property.key())) {
  498. auto& string_literal = static_cast<StringLiteral const&>(property.key());
  499. Bytecode::StringTableIndex key_name = generator.intern_string(string_literal.value());
  500. property.value().generate_bytecode(generator);
  501. generator.emit<Bytecode::Op::PutById>(object_reg, key_name);
  502. } else {
  503. property.key().generate_bytecode(generator);
  504. auto property_reg = generator.allocate_register();
  505. generator.emit<Bytecode::Op::Store>(property_reg);
  506. property.value().generate_bytecode(generator);
  507. generator.emit<Bytecode::Op::PutByValue>(object_reg, property_reg);
  508. }
  509. }
  510. generator.emit<Bytecode::Op::Load>(object_reg);
  511. }
  512. void ArrayExpression::generate_bytecode(Bytecode::Generator& generator) const
  513. {
  514. Vector<Bytecode::Register> element_regs;
  515. for (auto& element : m_elements) {
  516. if (element) {
  517. element->generate_bytecode(generator);
  518. if (is<SpreadExpression>(*element)) {
  519. TODO();
  520. continue;
  521. }
  522. } else {
  523. generator.emit<Bytecode::Op::LoadImmediate>(Value {});
  524. }
  525. auto element_reg = generator.allocate_register();
  526. generator.emit<Bytecode::Op::Store>(element_reg);
  527. element_regs.append(element_reg);
  528. }
  529. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(element_regs.size(), element_regs);
  530. }
  531. void MemberExpression::generate_bytecode(Bytecode::Generator& generator) const
  532. {
  533. object().generate_bytecode(generator);
  534. if (is_computed()) {
  535. auto object_reg = generator.allocate_register();
  536. generator.emit<Bytecode::Op::Store>(object_reg);
  537. property().generate_bytecode(generator);
  538. generator.emit<Bytecode::Op::GetByValue>(object_reg);
  539. } else {
  540. VERIFY(is<Identifier>(property()));
  541. auto identifier_table_ref = generator.intern_string(static_cast<Identifier const&>(property()).string());
  542. generator.emit<Bytecode::Op::GetById>(identifier_table_ref);
  543. }
  544. }
  545. void FunctionDeclaration::generate_bytecode(Bytecode::Generator&) const
  546. {
  547. }
  548. void FunctionExpression::generate_bytecode(Bytecode::Generator& generator) const
  549. {
  550. generator.emit<Bytecode::Op::NewFunction>(*this);
  551. }
  552. void VariableDeclaration::generate_bytecode(Bytecode::Generator& generator) const
  553. {
  554. for (auto& declarator : m_declarations) {
  555. if (declarator.init())
  556. declarator.init()->generate_bytecode(generator);
  557. else
  558. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  559. declarator.target().visit(
  560. [&](const NonnullRefPtr<Identifier>& id) {
  561. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(id->string()));
  562. },
  563. [&](const NonnullRefPtr<BindingPattern>&) {
  564. TODO();
  565. });
  566. }
  567. }
  568. void CallExpression::generate_bytecode(Bytecode::Generator& generator) const
  569. {
  570. auto callee_reg = generator.allocate_register();
  571. auto this_reg = generator.allocate_register();
  572. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  573. generator.emit<Bytecode::Op::Store>(this_reg);
  574. if (is<NewExpression>(this)) {
  575. m_callee->generate_bytecode(generator);
  576. generator.emit<Bytecode::Op::Store>(callee_reg);
  577. } else if (is<SuperExpression>(*m_callee)) {
  578. TODO();
  579. } else if (is<MemberExpression>(*m_callee)) {
  580. auto& member_expression = static_cast<const MemberExpression&>(*m_callee);
  581. if (is<SuperExpression>(member_expression.object())) {
  582. TODO();
  583. } else {
  584. member_expression.object().generate_bytecode(generator);
  585. generator.emit<Bytecode::Op::Store>(this_reg);
  586. // FIXME: Don't copy this logic here, make MemberExpression generate it.
  587. if (!is<Identifier>(member_expression.property()))
  588. TODO();
  589. auto identifier_table_ref = generator.intern_string(static_cast<Identifier const&>(member_expression.property()).string());
  590. generator.emit<Bytecode::Op::GetById>(identifier_table_ref);
  591. generator.emit<Bytecode::Op::Store>(callee_reg);
  592. }
  593. } else {
  594. // FIXME: this = global object in sloppy mode.
  595. m_callee->generate_bytecode(generator);
  596. generator.emit<Bytecode::Op::Store>(callee_reg);
  597. }
  598. Vector<Bytecode::Register> argument_registers;
  599. for (auto& arg : m_arguments) {
  600. arg.value->generate_bytecode(generator);
  601. auto arg_reg = generator.allocate_register();
  602. generator.emit<Bytecode::Op::Store>(arg_reg);
  603. argument_registers.append(arg_reg);
  604. }
  605. Bytecode::Op::Call::CallType call_type;
  606. if (is<NewExpression>(*this)) {
  607. call_type = Bytecode::Op::Call::CallType::Construct;
  608. } else {
  609. call_type = Bytecode::Op::Call::CallType::Call;
  610. }
  611. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_registers.size(), call_type, callee_reg, this_reg, argument_registers);
  612. }
  613. void ReturnStatement::generate_bytecode(Bytecode::Generator& generator) const
  614. {
  615. if (m_argument)
  616. m_argument->generate_bytecode(generator);
  617. if (generator.is_in_generator_function())
  618. generator.emit<Bytecode::Op::Yield>(nullptr);
  619. else
  620. generator.emit<Bytecode::Op::Return>();
  621. }
  622. void YieldExpression::generate_bytecode(Bytecode::Generator& generator) const
  623. {
  624. VERIFY(generator.is_in_generator_function());
  625. if (m_argument)
  626. m_argument->generate_bytecode(generator);
  627. auto& continuation_block = generator.make_block();
  628. generator.emit<Bytecode::Op::Yield>(Bytecode::Label { continuation_block });
  629. generator.switch_to_basic_block(continuation_block);
  630. }
  631. void IfStatement::generate_bytecode(Bytecode::Generator& generator) const
  632. {
  633. // test
  634. // jump if_true (true) true (false) false
  635. // true
  636. // jump always (true) end
  637. // false
  638. // jump always (true) end
  639. // end
  640. // If the 'false' branch doesn't exist, we're just gonna substitute it for 'end' and elide the last two entries above.
  641. auto& true_block = generator.make_block();
  642. auto& false_block = generator.make_block();
  643. m_predicate->generate_bytecode(generator);
  644. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  645. Bytecode::Label { true_block },
  646. Bytecode::Label { false_block });
  647. Bytecode::Op::Jump* true_block_jump { nullptr };
  648. generator.switch_to_basic_block(true_block);
  649. m_consequent->generate_bytecode(generator);
  650. if (!generator.is_current_block_terminated())
  651. true_block_jump = &generator.emit<Bytecode::Op::Jump>();
  652. generator.switch_to_basic_block(false_block);
  653. if (m_alternate) {
  654. auto& end_block = generator.make_block();
  655. m_alternate->generate_bytecode(generator);
  656. if (!generator.is_current_block_terminated())
  657. generator.emit<Bytecode::Op::Jump>().set_targets(
  658. Bytecode::Label { end_block },
  659. {});
  660. if (true_block_jump)
  661. true_block_jump->set_targets(
  662. Bytecode::Label { end_block },
  663. {});
  664. generator.switch_to_basic_block(end_block);
  665. } else {
  666. if (true_block_jump)
  667. true_block_jump->set_targets(
  668. Bytecode::Label { false_block },
  669. {});
  670. }
  671. }
  672. void ContinueStatement::generate_bytecode(Bytecode::Generator& generator) const
  673. {
  674. generator.emit<Bytecode::Op::Jump>().set_targets(
  675. generator.nearest_continuable_scope(),
  676. {});
  677. }
  678. void DebuggerStatement::generate_bytecode(Bytecode::Generator&) const
  679. {
  680. }
  681. void ConditionalExpression::generate_bytecode(Bytecode::Generator& generator) const
  682. {
  683. // test
  684. // jump if_true (true) true (false) false
  685. // true
  686. // jump always (true) end
  687. // false
  688. // jump always (true) end
  689. // end
  690. auto& true_block = generator.make_block();
  691. auto& false_block = generator.make_block();
  692. auto& end_block = generator.make_block();
  693. m_test->generate_bytecode(generator);
  694. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  695. Bytecode::Label { true_block },
  696. Bytecode::Label { false_block });
  697. generator.switch_to_basic_block(true_block);
  698. m_consequent->generate_bytecode(generator);
  699. generator.emit<Bytecode::Op::Jump>().set_targets(
  700. Bytecode::Label { end_block },
  701. {});
  702. generator.switch_to_basic_block(false_block);
  703. m_alternate->generate_bytecode(generator);
  704. generator.emit<Bytecode::Op::Jump>().set_targets(
  705. Bytecode::Label { end_block },
  706. {});
  707. generator.switch_to_basic_block(end_block);
  708. }
  709. void SequenceExpression::generate_bytecode(Bytecode::Generator& generator) const
  710. {
  711. for (auto& expression : m_expressions)
  712. expression.generate_bytecode(generator);
  713. }
  714. void TemplateLiteral::generate_bytecode(Bytecode::Generator& generator) const
  715. {
  716. auto string_reg = generator.allocate_register();
  717. for (size_t i = 0; i < m_expressions.size(); i++) {
  718. m_expressions[i].generate_bytecode(generator);
  719. if (i == 0) {
  720. generator.emit<Bytecode::Op::Store>(string_reg);
  721. } else {
  722. generator.emit<Bytecode::Op::ConcatString>(string_reg);
  723. }
  724. }
  725. generator.emit<Bytecode::Op::Load>(string_reg);
  726. }
  727. void TaggedTemplateLiteral::generate_bytecode(Bytecode::Generator& generator) const
  728. {
  729. m_tag->generate_bytecode(generator);
  730. auto tag_reg = generator.allocate_register();
  731. generator.emit<Bytecode::Op::Store>(tag_reg);
  732. Vector<Bytecode::Register> string_regs;
  733. auto& expressions = m_template_literal->expressions();
  734. for (size_t i = 0; i < expressions.size(); ++i) {
  735. if (i % 2 != 0)
  736. continue;
  737. expressions[i].generate_bytecode(generator);
  738. auto string_reg = generator.allocate_register();
  739. generator.emit<Bytecode::Op::Store>(string_reg);
  740. string_regs.append(string_reg);
  741. }
  742. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(string_regs.size(), string_regs);
  743. auto strings_reg = generator.allocate_register();
  744. generator.emit<Bytecode::Op::Store>(strings_reg);
  745. Vector<Bytecode::Register> argument_regs;
  746. argument_regs.append(strings_reg);
  747. for (size_t i = 0; i < expressions.size(); ++i) {
  748. if (i % 2 == 0)
  749. continue;
  750. expressions[i].generate_bytecode(generator);
  751. auto string_reg = generator.allocate_register();
  752. generator.emit<Bytecode::Op::Store>(string_reg);
  753. argument_regs.append(string_reg);
  754. }
  755. Vector<Bytecode::Register> raw_string_regs;
  756. for (auto& raw_string : m_template_literal->raw_strings()) {
  757. raw_string.generate_bytecode(generator);
  758. auto raw_string_reg = generator.allocate_register();
  759. generator.emit<Bytecode::Op::Store>(raw_string_reg);
  760. raw_string_regs.append(raw_string_reg);
  761. }
  762. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(raw_string_regs.size(), raw_string_regs);
  763. auto raw_strings_reg = generator.allocate_register();
  764. generator.emit<Bytecode::Op::Store>(raw_strings_reg);
  765. generator.emit<Bytecode::Op::Load>(strings_reg);
  766. generator.emit<Bytecode::Op::PutById>(raw_strings_reg, generator.intern_string("raw"));
  767. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  768. auto this_reg = generator.allocate_register();
  769. generator.emit<Bytecode::Op::Store>(this_reg);
  770. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_regs.size(), Bytecode::Op::Call::CallType::Call, tag_reg, this_reg, move(argument_regs));
  771. }
  772. void UpdateExpression::generate_bytecode(Bytecode::Generator& generator) const
  773. {
  774. if (is<Identifier>(*m_argument)) {
  775. auto& identifier = static_cast<Identifier const&>(*m_argument);
  776. generator.emit<Bytecode::Op::GetVariable>(generator.intern_string(identifier.string()));
  777. Optional<Bytecode::Register> previous_value_for_postfix_reg;
  778. if (!m_prefixed) {
  779. previous_value_for_postfix_reg = generator.allocate_register();
  780. generator.emit<Bytecode::Op::Store>(*previous_value_for_postfix_reg);
  781. }
  782. if (m_op == UpdateOp::Increment)
  783. generator.emit<Bytecode::Op::Increment>();
  784. else
  785. generator.emit<Bytecode::Op::Decrement>();
  786. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier.string()));
  787. if (!m_prefixed)
  788. generator.emit<Bytecode::Op::Load>(*previous_value_for_postfix_reg);
  789. return;
  790. }
  791. TODO();
  792. }
  793. void ThrowStatement::generate_bytecode(Bytecode::Generator& generator) const
  794. {
  795. m_argument->generate_bytecode(generator);
  796. generator.emit<Bytecode::Op::Throw>();
  797. }
  798. void BreakStatement::generate_bytecode(Bytecode::Generator& generator) const
  799. {
  800. generator.emit<Bytecode::Op::Jump>().set_targets(
  801. generator.nearest_breakable_scope(),
  802. {});
  803. }
  804. void TryStatement::generate_bytecode(Bytecode::Generator& generator) const
  805. {
  806. auto& saved_block = generator.current_block();
  807. Optional<Bytecode::Label> handler_target;
  808. Optional<Bytecode::Label> finalizer_target;
  809. Bytecode::BasicBlock* next_block { nullptr };
  810. if (m_finalizer) {
  811. auto& finalizer_block = generator.make_block();
  812. generator.switch_to_basic_block(finalizer_block);
  813. m_finalizer->generate_bytecode(generator);
  814. if (!generator.is_current_block_terminated()) {
  815. next_block = &generator.make_block();
  816. auto next_target = Bytecode::Label { *next_block };
  817. generator.emit<Bytecode::Op::ContinuePendingUnwind>(next_target);
  818. }
  819. finalizer_target = Bytecode::Label { finalizer_block };
  820. }
  821. if (m_handler) {
  822. auto& handler_block = generator.make_block();
  823. generator.switch_to_basic_block(handler_block);
  824. if (!m_finalizer)
  825. generator.emit<Bytecode::Op::LeaveUnwindContext>();
  826. if (!m_handler->parameter().is_empty()) {
  827. // FIXME: We need a separate LexicalEnvironment here
  828. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(m_handler->parameter()));
  829. }
  830. m_handler->body().generate_bytecode(generator);
  831. handler_target = Bytecode::Label { handler_block };
  832. if (!generator.is_current_block_terminated()) {
  833. if (m_finalizer) {
  834. generator.emit<Bytecode::Op::LeaveUnwindContext>();
  835. generator.emit<Bytecode::Op::Jump>(finalizer_target);
  836. } else {
  837. VERIFY(!next_block);
  838. next_block = &generator.make_block();
  839. auto next_target = Bytecode::Label { *next_block };
  840. generator.emit<Bytecode::Op::Jump>(next_target);
  841. }
  842. }
  843. }
  844. generator.switch_to_basic_block(saved_block);
  845. generator.emit<Bytecode::Op::EnterUnwindContext>(handler_target, finalizer_target);
  846. m_block->generate_bytecode(generator);
  847. if (m_finalizer && !generator.is_current_block_terminated())
  848. generator.emit<Bytecode::Op::Jump>(finalizer_target);
  849. generator.switch_to_basic_block(next_block ? *next_block : saved_block);
  850. }
  851. void SwitchStatement::generate_bytecode(Bytecode::Generator& generator) const
  852. {
  853. auto discriminant_reg = generator.allocate_register();
  854. m_discriminant->generate_bytecode(generator);
  855. generator.emit<Bytecode::Op::Store>(discriminant_reg);
  856. Vector<Bytecode::BasicBlock&> case_blocks;
  857. Bytecode::BasicBlock* default_block { nullptr };
  858. Bytecode::BasicBlock* next_test_block = &generator.make_block();
  859. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { *next_test_block }, {});
  860. for (auto& switch_case : m_cases) {
  861. auto& case_block = generator.make_block();
  862. if (switch_case.test()) {
  863. generator.switch_to_basic_block(*next_test_block);
  864. switch_case.test()->generate_bytecode(generator);
  865. generator.emit<Bytecode::Op::TypedEquals>(discriminant_reg);
  866. next_test_block = &generator.make_block();
  867. generator.emit<Bytecode::Op::JumpConditional>().set_targets(Bytecode::Label { case_block }, Bytecode::Label { *next_test_block });
  868. } else {
  869. default_block = &case_block;
  870. }
  871. case_blocks.append(case_block);
  872. }
  873. generator.switch_to_basic_block(*next_test_block);
  874. auto& end_block = generator.make_block();
  875. if (default_block != nullptr) {
  876. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { *default_block }, {});
  877. } else {
  878. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  879. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { end_block }, {});
  880. }
  881. auto current_block = case_blocks.begin();
  882. generator.begin_breakable_scope(Bytecode::Label { end_block });
  883. for (auto& switch_case : m_cases) {
  884. generator.switch_to_basic_block(*current_block);
  885. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  886. for (auto& statement : switch_case.consequent()) {
  887. statement.generate_bytecode(generator);
  888. }
  889. if (!generator.is_current_block_terminated()) {
  890. auto next_block = current_block;
  891. next_block++;
  892. if (next_block.is_end()) {
  893. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { end_block }, {});
  894. } else {
  895. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { *next_block }, {});
  896. }
  897. }
  898. current_block++;
  899. }
  900. generator.end_breakable_scope();
  901. generator.switch_to_basic_block(end_block);
  902. }
  903. }