ASTCodegen.cpp 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745
  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. *
  6. * SPDX-License-Identifier: BSD-2-Clause
  7. */
  8. #include <LibJS/AST.h>
  9. #include <LibJS/Bytecode/Generator.h>
  10. #include <LibJS/Bytecode/Instruction.h>
  11. #include <LibJS/Bytecode/Op.h>
  12. #include <LibJS/Bytecode/Register.h>
  13. namespace JS {
  14. void ASTNode::generate_bytecode(Bytecode::Generator&) const
  15. {
  16. dbgln("Missing generate_bytecode() in {}", class_name());
  17. TODO();
  18. }
  19. void ScopeNode::generate_bytecode(Bytecode::Generator& generator) const
  20. {
  21. generator.emit<Bytecode::Op::EnterScope>(*this);
  22. for (auto& child : children()) {
  23. child.generate_bytecode(generator);
  24. if (generator.is_current_block_terminated())
  25. break;
  26. }
  27. }
  28. void EmptyStatement::generate_bytecode(Bytecode::Generator&) const
  29. {
  30. }
  31. void ExpressionStatement::generate_bytecode(Bytecode::Generator& generator) const
  32. {
  33. m_expression->generate_bytecode(generator);
  34. }
  35. void BinaryExpression::generate_bytecode(Bytecode::Generator& generator) const
  36. {
  37. m_lhs->generate_bytecode(generator);
  38. auto lhs_reg = generator.allocate_register();
  39. generator.emit<Bytecode::Op::Store>(lhs_reg);
  40. m_rhs->generate_bytecode(generator);
  41. switch (m_op) {
  42. case BinaryOp::Addition:
  43. generator.emit<Bytecode::Op::Add>(lhs_reg);
  44. break;
  45. case BinaryOp::Subtraction:
  46. generator.emit<Bytecode::Op::Sub>(lhs_reg);
  47. break;
  48. case BinaryOp::Multiplication:
  49. generator.emit<Bytecode::Op::Mul>(lhs_reg);
  50. break;
  51. case BinaryOp::Division:
  52. generator.emit<Bytecode::Op::Div>(lhs_reg);
  53. break;
  54. case BinaryOp::Modulo:
  55. generator.emit<Bytecode::Op::Mod>(lhs_reg);
  56. break;
  57. case BinaryOp::Exponentiation:
  58. generator.emit<Bytecode::Op::Exp>(lhs_reg);
  59. break;
  60. case BinaryOp::GreaterThan:
  61. generator.emit<Bytecode::Op::GreaterThan>(lhs_reg);
  62. break;
  63. case BinaryOp::GreaterThanEquals:
  64. generator.emit<Bytecode::Op::GreaterThanEquals>(lhs_reg);
  65. break;
  66. case BinaryOp::LessThan:
  67. generator.emit<Bytecode::Op::LessThan>(lhs_reg);
  68. break;
  69. case BinaryOp::LessThanEquals:
  70. generator.emit<Bytecode::Op::LessThanEquals>(lhs_reg);
  71. break;
  72. case BinaryOp::AbstractInequals:
  73. generator.emit<Bytecode::Op::AbstractInequals>(lhs_reg);
  74. break;
  75. case BinaryOp::AbstractEquals:
  76. generator.emit<Bytecode::Op::AbstractEquals>(lhs_reg);
  77. break;
  78. case BinaryOp::TypedInequals:
  79. generator.emit<Bytecode::Op::TypedInequals>(lhs_reg);
  80. break;
  81. case BinaryOp::TypedEquals:
  82. generator.emit<Bytecode::Op::TypedEquals>(lhs_reg);
  83. break;
  84. case BinaryOp::BitwiseAnd:
  85. generator.emit<Bytecode::Op::BitwiseAnd>(lhs_reg);
  86. break;
  87. case BinaryOp::BitwiseOr:
  88. generator.emit<Bytecode::Op::BitwiseOr>(lhs_reg);
  89. break;
  90. case BinaryOp::BitwiseXor:
  91. generator.emit<Bytecode::Op::BitwiseXor>(lhs_reg);
  92. break;
  93. case BinaryOp::LeftShift:
  94. generator.emit<Bytecode::Op::LeftShift>(lhs_reg);
  95. break;
  96. case BinaryOp::RightShift:
  97. generator.emit<Bytecode::Op::RightShift>(lhs_reg);
  98. break;
  99. case BinaryOp::UnsignedRightShift:
  100. generator.emit<Bytecode::Op::UnsignedRightShift>(lhs_reg);
  101. break;
  102. case BinaryOp::In:
  103. generator.emit<Bytecode::Op::In>(lhs_reg);
  104. break;
  105. case BinaryOp::InstanceOf:
  106. generator.emit<Bytecode::Op::InstanceOf>(lhs_reg);
  107. break;
  108. default:
  109. VERIFY_NOT_REACHED();
  110. }
  111. }
  112. void LogicalExpression::generate_bytecode(Bytecode::Generator& generator) const
  113. {
  114. m_lhs->generate_bytecode(generator);
  115. // lhs
  116. // jump op (true) end (false) rhs
  117. // rhs
  118. // jump always (true) end
  119. // end
  120. auto& rhs_block = generator.make_block();
  121. auto& end_block = generator.make_block();
  122. switch (m_op) {
  123. case LogicalOp::And:
  124. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  125. Bytecode::Label { rhs_block },
  126. Bytecode::Label { end_block });
  127. break;
  128. case LogicalOp::Or:
  129. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  130. Bytecode::Label { end_block },
  131. Bytecode::Label { rhs_block });
  132. break;
  133. case LogicalOp::NullishCoalescing:
  134. generator.emit<Bytecode::Op::JumpNullish>().set_targets(
  135. Bytecode::Label { rhs_block },
  136. Bytecode::Label { end_block });
  137. break;
  138. default:
  139. VERIFY_NOT_REACHED();
  140. }
  141. generator.switch_to_basic_block(rhs_block);
  142. m_rhs->generate_bytecode(generator);
  143. generator.emit<Bytecode::Op::Jump>().set_targets(
  144. Bytecode::Label { end_block },
  145. {});
  146. generator.switch_to_basic_block(end_block);
  147. }
  148. void UnaryExpression::generate_bytecode(Bytecode::Generator& generator) const
  149. {
  150. m_lhs->generate_bytecode(generator);
  151. switch (m_op) {
  152. case UnaryOp::BitwiseNot:
  153. generator.emit<Bytecode::Op::BitwiseNot>();
  154. break;
  155. case UnaryOp::Not:
  156. generator.emit<Bytecode::Op::Not>();
  157. break;
  158. case UnaryOp::Plus:
  159. generator.emit<Bytecode::Op::UnaryPlus>();
  160. break;
  161. case UnaryOp::Minus:
  162. generator.emit<Bytecode::Op::UnaryMinus>();
  163. break;
  164. case UnaryOp::Typeof:
  165. generator.emit<Bytecode::Op::Typeof>();
  166. break;
  167. case UnaryOp::Void:
  168. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  169. break;
  170. default:
  171. TODO();
  172. }
  173. }
  174. void NumericLiteral::generate_bytecode(Bytecode::Generator& generator) const
  175. {
  176. generator.emit<Bytecode::Op::LoadImmediate>(m_value);
  177. }
  178. void BooleanLiteral::generate_bytecode(Bytecode::Generator& generator) const
  179. {
  180. generator.emit<Bytecode::Op::LoadImmediate>(Value(m_value));
  181. }
  182. void NullLiteral::generate_bytecode(Bytecode::Generator& generator) const
  183. {
  184. generator.emit<Bytecode::Op::LoadImmediate>(js_null());
  185. }
  186. void BigIntLiteral::generate_bytecode(Bytecode::Generator& generator) const
  187. {
  188. generator.emit<Bytecode::Op::NewBigInt>(Crypto::SignedBigInteger::from_base10(m_value.substring(0, m_value.length() - 1)));
  189. }
  190. void StringLiteral::generate_bytecode(Bytecode::Generator& generator) const
  191. {
  192. generator.emit<Bytecode::Op::NewString>(generator.intern_string(m_value));
  193. }
  194. void Identifier::generate_bytecode(Bytecode::Generator& generator) const
  195. {
  196. generator.emit<Bytecode::Op::GetVariable>(generator.intern_string(m_string));
  197. }
  198. void AssignmentExpression::generate_bytecode(Bytecode::Generator& generator) const
  199. {
  200. if (is<Identifier>(*m_lhs)) {
  201. auto& identifier = static_cast<Identifier const&>(*m_lhs);
  202. if (m_op == AssignmentOp::Assignment) {
  203. m_rhs->generate_bytecode(generator);
  204. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier.string()));
  205. return;
  206. }
  207. m_lhs->generate_bytecode(generator);
  208. auto lhs_reg = generator.allocate_register();
  209. generator.emit<Bytecode::Op::Store>(lhs_reg);
  210. m_rhs->generate_bytecode(generator);
  211. switch (m_op) {
  212. case AssignmentOp::AdditionAssignment:
  213. generator.emit<Bytecode::Op::Add>(lhs_reg);
  214. break;
  215. case AssignmentOp::SubtractionAssignment:
  216. generator.emit<Bytecode::Op::Sub>(lhs_reg);
  217. break;
  218. case AssignmentOp::MultiplicationAssignment:
  219. generator.emit<Bytecode::Op::Mul>(lhs_reg);
  220. break;
  221. case AssignmentOp::DivisionAssignment:
  222. generator.emit<Bytecode::Op::Div>(lhs_reg);
  223. break;
  224. case AssignmentOp::ModuloAssignment:
  225. generator.emit<Bytecode::Op::Mod>(lhs_reg);
  226. break;
  227. case AssignmentOp::ExponentiationAssignment:
  228. generator.emit<Bytecode::Op::Exp>(lhs_reg);
  229. break;
  230. case AssignmentOp::BitwiseAndAssignment:
  231. generator.emit<Bytecode::Op::BitwiseAnd>(lhs_reg);
  232. break;
  233. case AssignmentOp::BitwiseOrAssignment:
  234. generator.emit<Bytecode::Op::BitwiseOr>(lhs_reg);
  235. break;
  236. case AssignmentOp::BitwiseXorAssignment:
  237. generator.emit<Bytecode::Op::BitwiseXor>(lhs_reg);
  238. break;
  239. case AssignmentOp::LeftShiftAssignment:
  240. generator.emit<Bytecode::Op::LeftShift>(lhs_reg);
  241. break;
  242. case AssignmentOp::RightShiftAssignment:
  243. generator.emit<Bytecode::Op::RightShift>(lhs_reg);
  244. break;
  245. case AssignmentOp::UnsignedRightShiftAssignment:
  246. generator.emit<Bytecode::Op::UnsignedRightShift>(lhs_reg);
  247. break;
  248. default:
  249. TODO();
  250. }
  251. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier.string()));
  252. return;
  253. }
  254. if (is<MemberExpression>(*m_lhs)) {
  255. auto& expression = static_cast<MemberExpression const&>(*m_lhs);
  256. expression.object().generate_bytecode(generator);
  257. auto object_reg = generator.allocate_register();
  258. generator.emit<Bytecode::Op::Store>(object_reg);
  259. if (expression.is_computed()) {
  260. TODO();
  261. } else {
  262. VERIFY(is<Identifier>(expression.property()));
  263. m_rhs->generate_bytecode(generator);
  264. auto identifier_table_ref = generator.intern_string(static_cast<Identifier const&>(expression.property()).string());
  265. generator.emit<Bytecode::Op::PutById>(object_reg, identifier_table_ref);
  266. return;
  267. }
  268. }
  269. TODO();
  270. }
  271. void WhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  272. {
  273. // test
  274. // jump if_false (true) end (false) body
  275. // body
  276. // jump always (true) test
  277. // end
  278. auto& test_block = generator.make_block();
  279. auto& body_block = generator.make_block();
  280. auto& end_block = generator.make_block();
  281. // Init result register
  282. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  283. auto result_reg = generator.allocate_register();
  284. generator.emit<Bytecode::Op::Store>(result_reg);
  285. // jump to the test block
  286. generator.emit<Bytecode::Op::Jump>().set_targets(
  287. Bytecode::Label { test_block },
  288. {});
  289. generator.switch_to_basic_block(test_block);
  290. m_test->generate_bytecode(generator);
  291. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  292. Bytecode::Label { body_block },
  293. Bytecode::Label { end_block });
  294. generator.switch_to_basic_block(body_block);
  295. generator.begin_continuable_scope(Bytecode::Label { test_block });
  296. m_body->generate_bytecode(generator);
  297. if (!generator.is_current_block_terminated()) {
  298. generator.emit<Bytecode::Op::Jump>().set_targets(
  299. Bytecode::Label { test_block },
  300. {});
  301. generator.end_continuable_scope();
  302. generator.switch_to_basic_block(end_block);
  303. generator.emit<Bytecode::Op::Load>(result_reg);
  304. }
  305. }
  306. void DoWhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  307. {
  308. // jump always (true) body
  309. // test
  310. // jump if_false (true) end (false) body
  311. // body
  312. // jump always (true) test
  313. // end
  314. auto& test_block = generator.make_block();
  315. auto& body_block = generator.make_block();
  316. auto& end_block = generator.make_block();
  317. // Init result register
  318. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  319. auto result_reg = generator.allocate_register();
  320. generator.emit<Bytecode::Op::Store>(result_reg);
  321. // jump to the body block
  322. generator.emit<Bytecode::Op::Jump>().set_targets(
  323. Bytecode::Label { body_block },
  324. {});
  325. generator.switch_to_basic_block(test_block);
  326. m_test->generate_bytecode(generator);
  327. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  328. Bytecode::Label { body_block },
  329. Bytecode::Label { end_block });
  330. generator.switch_to_basic_block(body_block);
  331. generator.begin_continuable_scope(Bytecode::Label { test_block });
  332. m_body->generate_bytecode(generator);
  333. if (!generator.is_current_block_terminated()) {
  334. generator.emit<Bytecode::Op::Jump>().set_targets(
  335. Bytecode::Label { test_block },
  336. {});
  337. generator.end_continuable_scope();
  338. generator.switch_to_basic_block(end_block);
  339. generator.emit<Bytecode::Op::Load>(result_reg);
  340. }
  341. }
  342. void ForStatement::generate_bytecode(Bytecode::Generator& generator) const
  343. {
  344. // init
  345. // jump always (true) test
  346. // test
  347. // jump if_true (true) body (false) end
  348. // body
  349. // jump always (true) update
  350. // update
  351. // jump always (true) test
  352. // end
  353. // If 'test' is missing, fuse the 'test' and 'body' basic blocks
  354. // If 'update' is missing, fuse the 'body' and 'update' basic blocks
  355. Bytecode::BasicBlock* test_block_ptr { nullptr };
  356. Bytecode::BasicBlock* body_block_ptr { nullptr };
  357. Bytecode::BasicBlock* update_block_ptr { nullptr };
  358. auto& end_block = generator.make_block();
  359. if (m_init)
  360. m_init->generate_bytecode(generator);
  361. body_block_ptr = &generator.make_block();
  362. if (m_test)
  363. test_block_ptr = &generator.make_block();
  364. else
  365. test_block_ptr = body_block_ptr;
  366. if (m_update)
  367. update_block_ptr = &generator.make_block();
  368. else
  369. update_block_ptr = body_block_ptr;
  370. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  371. auto result_reg = generator.allocate_register();
  372. generator.emit<Bytecode::Op::Store>(result_reg);
  373. generator.emit<Bytecode::Op::Jump>().set_targets(
  374. Bytecode::Label { *test_block_ptr },
  375. {});
  376. if (m_test) {
  377. generator.switch_to_basic_block(*test_block_ptr);
  378. m_test->generate_bytecode(generator);
  379. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  380. Bytecode::Label { *body_block_ptr },
  381. Bytecode::Label { end_block });
  382. }
  383. generator.switch_to_basic_block(*body_block_ptr);
  384. generator.begin_continuable_scope(Bytecode::Label { *update_block_ptr });
  385. m_body->generate_bytecode(generator);
  386. generator.end_continuable_scope();
  387. if (!generator.is_current_block_terminated()) {
  388. if (m_update) {
  389. generator.emit<Bytecode::Op::Jump>().set_targets(
  390. Bytecode::Label { *update_block_ptr },
  391. {});
  392. generator.switch_to_basic_block(*update_block_ptr);
  393. m_update->generate_bytecode(generator);
  394. }
  395. generator.emit<Bytecode::Op::Jump>().set_targets(
  396. Bytecode::Label { *test_block_ptr },
  397. {});
  398. generator.switch_to_basic_block(end_block);
  399. generator.emit<Bytecode::Op::Load>(result_reg);
  400. }
  401. }
  402. void ObjectExpression::generate_bytecode(Bytecode::Generator& generator) const
  403. {
  404. generator.emit<Bytecode::Op::NewObject>();
  405. if (!m_properties.is_empty())
  406. TODO();
  407. }
  408. void ArrayExpression::generate_bytecode(Bytecode::Generator& generator) const
  409. {
  410. Vector<Bytecode::Register> element_regs;
  411. for (auto& element : m_elements) {
  412. if (element) {
  413. element->generate_bytecode(generator);
  414. if (is<SpreadExpression>(*element)) {
  415. TODO();
  416. continue;
  417. }
  418. } else {
  419. generator.emit<Bytecode::Op::LoadImmediate>(Value {});
  420. }
  421. auto element_reg = generator.allocate_register();
  422. generator.emit<Bytecode::Op::Store>(element_reg);
  423. element_regs.append(element_reg);
  424. }
  425. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(element_regs.size(), element_regs);
  426. }
  427. void MemberExpression::generate_bytecode(Bytecode::Generator& generator) const
  428. {
  429. object().generate_bytecode(generator);
  430. if (is_computed()) {
  431. TODO();
  432. } else {
  433. VERIFY(is<Identifier>(property()));
  434. auto identifier_table_ref = generator.intern_string(static_cast<Identifier const&>(property()).string());
  435. generator.emit<Bytecode::Op::GetById>(identifier_table_ref);
  436. }
  437. }
  438. void FunctionDeclaration::generate_bytecode(Bytecode::Generator&) const
  439. {
  440. }
  441. void CallExpression::generate_bytecode(Bytecode::Generator& generator) const
  442. {
  443. m_callee->generate_bytecode(generator);
  444. auto callee_reg = generator.allocate_register();
  445. generator.emit<Bytecode::Op::Store>(callee_reg);
  446. // FIXME: Load the correct 'this' value into 'this_reg'.
  447. auto this_reg = generator.allocate_register();
  448. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  449. generator.emit<Bytecode::Op::Store>(this_reg);
  450. Vector<Bytecode::Register> argument_registers;
  451. for (auto& arg : m_arguments) {
  452. arg.value->generate_bytecode(generator);
  453. auto arg_reg = generator.allocate_register();
  454. generator.emit<Bytecode::Op::Store>(arg_reg);
  455. argument_registers.append(arg_reg);
  456. }
  457. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_registers.size(), callee_reg, this_reg, argument_registers);
  458. }
  459. void ReturnStatement::generate_bytecode(Bytecode::Generator& generator) const
  460. {
  461. if (m_argument)
  462. m_argument->generate_bytecode(generator);
  463. generator.emit<Bytecode::Op::Return>();
  464. }
  465. void IfStatement::generate_bytecode(Bytecode::Generator& generator) const
  466. {
  467. // test
  468. // jump if_true (true) true (false) false
  469. // true
  470. // jump always (true) end
  471. // false
  472. // jump always (true) end
  473. // end
  474. // If the 'false' branch doesn't exist, we're just gonna substitute it for 'end' and elide the last two entries above.
  475. auto& true_block = generator.make_block();
  476. auto& false_block = generator.make_block();
  477. m_predicate->generate_bytecode(generator);
  478. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  479. Bytecode::Label { true_block },
  480. Bytecode::Label { false_block });
  481. Bytecode::Op::Jump* true_block_jump { nullptr };
  482. generator.switch_to_basic_block(true_block);
  483. m_consequent->generate_bytecode(generator);
  484. if (!generator.is_current_block_terminated())
  485. true_block_jump = &generator.emit<Bytecode::Op::Jump>();
  486. generator.switch_to_basic_block(false_block);
  487. if (m_alternate) {
  488. auto& end_block = generator.make_block();
  489. m_alternate->generate_bytecode(generator);
  490. if (!generator.is_current_block_terminated())
  491. generator.emit<Bytecode::Op::Jump>().set_targets(
  492. Bytecode::Label { end_block },
  493. {});
  494. if (true_block_jump)
  495. true_block_jump->set_targets(
  496. Bytecode::Label { end_block },
  497. {});
  498. generator.switch_to_basic_block(end_block);
  499. } else {
  500. if (true_block_jump)
  501. true_block_jump->set_targets(
  502. Bytecode::Label { false_block },
  503. {});
  504. }
  505. }
  506. void ContinueStatement::generate_bytecode(Bytecode::Generator& generator) const
  507. {
  508. generator.emit<Bytecode::Op::Jump>().set_targets(
  509. generator.nearest_continuable_scope(),
  510. {});
  511. }
  512. void DebuggerStatement::generate_bytecode(Bytecode::Generator&) const
  513. {
  514. }
  515. void ConditionalExpression::generate_bytecode(Bytecode::Generator& generator) const
  516. {
  517. // test
  518. // jump if_true (true) true (false) false
  519. // true
  520. // jump always (true) end
  521. // false
  522. // jump always (true) end
  523. // end
  524. auto& true_block = generator.make_block();
  525. auto& false_block = generator.make_block();
  526. auto& end_block = generator.make_block();
  527. m_test->generate_bytecode(generator);
  528. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  529. Bytecode::Label { true_block },
  530. Bytecode::Label { false_block });
  531. generator.switch_to_basic_block(true_block);
  532. m_consequent->generate_bytecode(generator);
  533. generator.emit<Bytecode::Op::Jump>().set_targets(
  534. Bytecode::Label { end_block },
  535. {});
  536. generator.switch_to_basic_block(false_block);
  537. m_alternate->generate_bytecode(generator);
  538. generator.emit<Bytecode::Op::Jump>().set_targets(
  539. Bytecode::Label { end_block },
  540. {});
  541. generator.switch_to_basic_block(end_block);
  542. }
  543. void SequenceExpression::generate_bytecode(Bytecode::Generator& generator) const
  544. {
  545. for (auto& expression : m_expressions)
  546. expression.generate_bytecode(generator);
  547. }
  548. void TemplateLiteral::generate_bytecode(Bytecode::Generator& generator) const
  549. {
  550. auto string_reg = generator.allocate_register();
  551. for (size_t i = 0; i < m_expressions.size(); i++) {
  552. m_expressions[i].generate_bytecode(generator);
  553. if (i == 0) {
  554. generator.emit<Bytecode::Op::Store>(string_reg);
  555. } else {
  556. generator.emit<Bytecode::Op::ConcatString>(string_reg);
  557. }
  558. }
  559. generator.emit<Bytecode::Op::Load>(string_reg);
  560. }
  561. void TaggedTemplateLiteral::generate_bytecode(Bytecode::Generator& generator) const
  562. {
  563. m_tag->generate_bytecode(generator);
  564. auto tag_reg = generator.allocate_register();
  565. generator.emit<Bytecode::Op::Store>(tag_reg);
  566. Vector<Bytecode::Register> string_regs;
  567. auto& expressions = m_template_literal->expressions();
  568. for (size_t i = 0; i < expressions.size(); ++i) {
  569. if (i % 2 != 0)
  570. continue;
  571. expressions[i].generate_bytecode(generator);
  572. auto string_reg = generator.allocate_register();
  573. generator.emit<Bytecode::Op::Store>(string_reg);
  574. string_regs.append(string_reg);
  575. }
  576. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(string_regs.size(), string_regs);
  577. auto strings_reg = generator.allocate_register();
  578. generator.emit<Bytecode::Op::Store>(strings_reg);
  579. Vector<Bytecode::Register> argument_regs;
  580. argument_regs.append(strings_reg);
  581. for (size_t i = 0; i < expressions.size(); ++i) {
  582. if (i % 2 == 0)
  583. continue;
  584. expressions[i].generate_bytecode(generator);
  585. auto string_reg = generator.allocate_register();
  586. generator.emit<Bytecode::Op::Store>(string_reg);
  587. argument_regs.append(string_reg);
  588. }
  589. Vector<Bytecode::Register> raw_string_regs;
  590. for (auto& raw_string : m_template_literal->raw_strings()) {
  591. raw_string.generate_bytecode(generator);
  592. auto raw_string_reg = generator.allocate_register();
  593. generator.emit<Bytecode::Op::Store>(raw_string_reg);
  594. raw_string_regs.append(raw_string_reg);
  595. }
  596. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(raw_string_regs.size(), raw_string_regs);
  597. auto raw_strings_reg = generator.allocate_register();
  598. generator.emit<Bytecode::Op::Store>(raw_strings_reg);
  599. generator.emit<Bytecode::Op::Load>(strings_reg);
  600. generator.emit<Bytecode::Op::PutById>(raw_strings_reg, generator.intern_string("raw"));
  601. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  602. auto this_reg = generator.allocate_register();
  603. generator.emit<Bytecode::Op::Store>(this_reg);
  604. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_regs.size(), tag_reg, this_reg, move(argument_regs));
  605. }
  606. void UpdateExpression::generate_bytecode(Bytecode::Generator& generator) const
  607. {
  608. if (is<Identifier>(*m_argument)) {
  609. auto& identifier = static_cast<Identifier const&>(*m_argument);
  610. generator.emit<Bytecode::Op::GetVariable>(generator.intern_string(identifier.string()));
  611. Optional<Bytecode::Register> previous_value_for_postfix_reg;
  612. if (!m_prefixed) {
  613. previous_value_for_postfix_reg = generator.allocate_register();
  614. generator.emit<Bytecode::Op::Store>(*previous_value_for_postfix_reg);
  615. }
  616. if (m_op == UpdateOp::Increment)
  617. generator.emit<Bytecode::Op::Increment>();
  618. else
  619. generator.emit<Bytecode::Op::Decrement>();
  620. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier.string()));
  621. if (!m_prefixed)
  622. generator.emit<Bytecode::Op::Load>(*previous_value_for_postfix_reg);
  623. return;
  624. }
  625. TODO();
  626. }
  627. void ThrowStatement::generate_bytecode(Bytecode::Generator& generator) const
  628. {
  629. m_argument->generate_bytecode(generator);
  630. generator.emit<Bytecode::Op::Throw>();
  631. }
  632. }