ASTCodegen.cpp 48 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311
  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_bound_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_bound_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. if (m_argument_index.has_value())
  236. generator.emit<Bytecode::Op::LoadArgument>(m_argument_index.value());
  237. else
  238. generator.emit<Bytecode::Op::GetVariable>(generator.intern_string(m_string));
  239. }
  240. void AssignmentExpression::generate_bytecode(Bytecode::Generator& generator) const
  241. {
  242. if (is<Identifier>(*m_lhs)) {
  243. auto& identifier = static_cast<Identifier const&>(*m_lhs);
  244. if (m_op == AssignmentOp::Assignment) {
  245. m_rhs->generate_bytecode(generator);
  246. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier.string()));
  247. return;
  248. }
  249. m_lhs->generate_bytecode(generator);
  250. Bytecode::BasicBlock* rhs_block_ptr { nullptr };
  251. Bytecode::BasicBlock* end_block_ptr { nullptr };
  252. // Logical assignments short circuit.
  253. if (m_op == AssignmentOp::AndAssignment) { // &&=
  254. rhs_block_ptr = &generator.make_block();
  255. end_block_ptr = &generator.make_block();
  256. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  257. Bytecode::Label { *rhs_block_ptr },
  258. Bytecode::Label { *end_block_ptr });
  259. } else if (m_op == AssignmentOp::OrAssignment) { // ||=
  260. rhs_block_ptr = &generator.make_block();
  261. end_block_ptr = &generator.make_block();
  262. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  263. Bytecode::Label { *end_block_ptr },
  264. Bytecode::Label { *rhs_block_ptr });
  265. } else if (m_op == AssignmentOp::NullishAssignment) { // ??=
  266. rhs_block_ptr = &generator.make_block();
  267. end_block_ptr = &generator.make_block();
  268. generator.emit<Bytecode::Op::JumpNullish>().set_targets(
  269. Bytecode::Label { *rhs_block_ptr },
  270. Bytecode::Label { *end_block_ptr });
  271. }
  272. if (rhs_block_ptr)
  273. generator.switch_to_basic_block(*rhs_block_ptr);
  274. // lhs_reg is a part of the rhs_block because the store isn't necessary
  275. // if the logical assignment condition fails.
  276. auto lhs_reg = generator.allocate_register();
  277. generator.emit<Bytecode::Op::Store>(lhs_reg);
  278. m_rhs->generate_bytecode(generator);
  279. switch (m_op) {
  280. case AssignmentOp::AdditionAssignment:
  281. generator.emit<Bytecode::Op::Add>(lhs_reg);
  282. break;
  283. case AssignmentOp::SubtractionAssignment:
  284. generator.emit<Bytecode::Op::Sub>(lhs_reg);
  285. break;
  286. case AssignmentOp::MultiplicationAssignment:
  287. generator.emit<Bytecode::Op::Mul>(lhs_reg);
  288. break;
  289. case AssignmentOp::DivisionAssignment:
  290. generator.emit<Bytecode::Op::Div>(lhs_reg);
  291. break;
  292. case AssignmentOp::ModuloAssignment:
  293. generator.emit<Bytecode::Op::Mod>(lhs_reg);
  294. break;
  295. case AssignmentOp::ExponentiationAssignment:
  296. generator.emit<Bytecode::Op::Exp>(lhs_reg);
  297. break;
  298. case AssignmentOp::BitwiseAndAssignment:
  299. generator.emit<Bytecode::Op::BitwiseAnd>(lhs_reg);
  300. break;
  301. case AssignmentOp::BitwiseOrAssignment:
  302. generator.emit<Bytecode::Op::BitwiseOr>(lhs_reg);
  303. break;
  304. case AssignmentOp::BitwiseXorAssignment:
  305. generator.emit<Bytecode::Op::BitwiseXor>(lhs_reg);
  306. break;
  307. case AssignmentOp::LeftShiftAssignment:
  308. generator.emit<Bytecode::Op::LeftShift>(lhs_reg);
  309. break;
  310. case AssignmentOp::RightShiftAssignment:
  311. generator.emit<Bytecode::Op::RightShift>(lhs_reg);
  312. break;
  313. case AssignmentOp::UnsignedRightShiftAssignment:
  314. generator.emit<Bytecode::Op::UnsignedRightShift>(lhs_reg);
  315. break;
  316. case AssignmentOp::AndAssignment:
  317. case AssignmentOp::OrAssignment:
  318. case AssignmentOp::NullishAssignment:
  319. break; // These are handled above.
  320. default:
  321. TODO();
  322. }
  323. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier.string()));
  324. if (end_block_ptr) {
  325. generator.emit<Bytecode::Op::Jump>().set_targets(
  326. Bytecode::Label { *end_block_ptr },
  327. {});
  328. generator.switch_to_basic_block(*end_block_ptr);
  329. }
  330. return;
  331. }
  332. if (is<MemberExpression>(*m_lhs)) {
  333. auto& expression = static_cast<MemberExpression const&>(*m_lhs);
  334. expression.object().generate_bytecode(generator);
  335. auto object_reg = generator.allocate_register();
  336. generator.emit<Bytecode::Op::Store>(object_reg);
  337. if (expression.is_computed()) {
  338. expression.property().generate_bytecode(generator);
  339. auto property_reg = generator.allocate_register();
  340. generator.emit<Bytecode::Op::Store>(property_reg);
  341. m_rhs->generate_bytecode(generator);
  342. generator.emit<Bytecode::Op::PutByValue>(object_reg, property_reg);
  343. } else {
  344. VERIFY(is<Identifier>(expression.property()));
  345. m_rhs->generate_bytecode(generator);
  346. auto identifier_table_ref = generator.intern_string(static_cast<Identifier const&>(expression.property()).string());
  347. generator.emit<Bytecode::Op::PutById>(object_reg, identifier_table_ref);
  348. }
  349. return;
  350. }
  351. TODO();
  352. }
  353. void WhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  354. {
  355. // test
  356. // jump if_false (true) end (false) body
  357. // body
  358. // jump always (true) test
  359. // end
  360. auto& test_block = generator.make_block();
  361. auto& body_block = generator.make_block();
  362. auto& end_block = generator.make_block();
  363. // Init result register
  364. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  365. auto result_reg = generator.allocate_register();
  366. generator.emit<Bytecode::Op::Store>(result_reg);
  367. // jump to the test block
  368. generator.emit<Bytecode::Op::Jump>().set_targets(
  369. Bytecode::Label { test_block },
  370. {});
  371. generator.switch_to_basic_block(test_block);
  372. m_test->generate_bytecode(generator);
  373. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  374. Bytecode::Label { body_block },
  375. Bytecode::Label { end_block });
  376. generator.switch_to_basic_block(body_block);
  377. generator.begin_continuable_scope(Bytecode::Label { test_block });
  378. generator.begin_breakable_scope(Bytecode::Label { end_block });
  379. m_body->generate_bytecode(generator);
  380. if (!generator.is_current_block_terminated()) {
  381. generator.emit<Bytecode::Op::Jump>().set_targets(
  382. Bytecode::Label { test_block },
  383. {});
  384. generator.end_continuable_scope();
  385. generator.end_breakable_scope();
  386. generator.switch_to_basic_block(end_block);
  387. generator.emit<Bytecode::Op::Load>(result_reg);
  388. }
  389. }
  390. void DoWhileStatement::generate_bytecode(Bytecode::Generator& generator) const
  391. {
  392. // jump always (true) body
  393. // test
  394. // jump if_false (true) end (false) body
  395. // body
  396. // jump always (true) test
  397. // end
  398. auto& test_block = generator.make_block();
  399. auto& body_block = generator.make_block();
  400. auto& end_block = generator.make_block();
  401. // Init result register
  402. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  403. auto result_reg = generator.allocate_register();
  404. generator.emit<Bytecode::Op::Store>(result_reg);
  405. // jump to the body block
  406. generator.emit<Bytecode::Op::Jump>().set_targets(
  407. Bytecode::Label { body_block },
  408. {});
  409. generator.switch_to_basic_block(test_block);
  410. m_test->generate_bytecode(generator);
  411. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  412. Bytecode::Label { body_block },
  413. Bytecode::Label { end_block });
  414. generator.switch_to_basic_block(body_block);
  415. generator.begin_continuable_scope(Bytecode::Label { test_block });
  416. generator.begin_breakable_scope(Bytecode::Label { end_block });
  417. m_body->generate_bytecode(generator);
  418. if (!generator.is_current_block_terminated()) {
  419. generator.emit<Bytecode::Op::Jump>().set_targets(
  420. Bytecode::Label { test_block },
  421. {});
  422. generator.end_continuable_scope();
  423. generator.end_breakable_scope();
  424. generator.switch_to_basic_block(end_block);
  425. generator.emit<Bytecode::Op::Load>(result_reg);
  426. }
  427. }
  428. void ForStatement::generate_bytecode(Bytecode::Generator& generator) const
  429. {
  430. // init
  431. // jump always (true) test
  432. // test
  433. // jump if_true (true) body (false) end
  434. // body
  435. // jump always (true) update
  436. // update
  437. // jump always (true) test
  438. // end
  439. // If 'test' is missing, fuse the 'test' and 'body' basic blocks
  440. // If 'update' is missing, fuse the 'body' and 'update' basic blocks
  441. Bytecode::BasicBlock* test_block_ptr { nullptr };
  442. Bytecode::BasicBlock* body_block_ptr { nullptr };
  443. Bytecode::BasicBlock* update_block_ptr { nullptr };
  444. auto& end_block = generator.make_block();
  445. if (m_init)
  446. m_init->generate_bytecode(generator);
  447. body_block_ptr = &generator.make_block();
  448. if (m_test)
  449. test_block_ptr = &generator.make_block();
  450. else
  451. test_block_ptr = body_block_ptr;
  452. if (m_update)
  453. update_block_ptr = &generator.make_block();
  454. else
  455. update_block_ptr = body_block_ptr;
  456. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  457. auto result_reg = generator.allocate_register();
  458. generator.emit<Bytecode::Op::Store>(result_reg);
  459. generator.emit<Bytecode::Op::Jump>().set_targets(
  460. Bytecode::Label { *test_block_ptr },
  461. {});
  462. if (m_test) {
  463. generator.switch_to_basic_block(*test_block_ptr);
  464. m_test->generate_bytecode(generator);
  465. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  466. Bytecode::Label { *body_block_ptr },
  467. Bytecode::Label { end_block });
  468. }
  469. generator.switch_to_basic_block(*body_block_ptr);
  470. generator.begin_continuable_scope(Bytecode::Label { *update_block_ptr });
  471. generator.begin_breakable_scope(Bytecode::Label { end_block });
  472. m_body->generate_bytecode(generator);
  473. generator.end_continuable_scope();
  474. if (!generator.is_current_block_terminated()) {
  475. if (m_update) {
  476. generator.emit<Bytecode::Op::Jump>().set_targets(
  477. Bytecode::Label { *update_block_ptr },
  478. {});
  479. generator.switch_to_basic_block(*update_block_ptr);
  480. m_update->generate_bytecode(generator);
  481. }
  482. generator.emit<Bytecode::Op::Jump>().set_targets(
  483. Bytecode::Label { *test_block_ptr },
  484. {});
  485. generator.end_breakable_scope();
  486. generator.switch_to_basic_block(end_block);
  487. generator.emit<Bytecode::Op::Load>(result_reg);
  488. }
  489. }
  490. void ObjectExpression::generate_bytecode(Bytecode::Generator& generator) const
  491. {
  492. generator.emit<Bytecode::Op::NewObject>();
  493. if (m_properties.is_empty())
  494. return;
  495. auto object_reg = generator.allocate_register();
  496. generator.emit<Bytecode::Op::Store>(object_reg);
  497. for (auto& property : m_properties) {
  498. if (property.type() != ObjectProperty::Type::KeyValue)
  499. TODO();
  500. if (is<StringLiteral>(property.key())) {
  501. auto& string_literal = static_cast<StringLiteral const&>(property.key());
  502. Bytecode::StringTableIndex key_name = generator.intern_string(string_literal.value());
  503. property.value().generate_bytecode(generator);
  504. generator.emit<Bytecode::Op::PutById>(object_reg, key_name);
  505. } else {
  506. property.key().generate_bytecode(generator);
  507. auto property_reg = generator.allocate_register();
  508. generator.emit<Bytecode::Op::Store>(property_reg);
  509. property.value().generate_bytecode(generator);
  510. generator.emit<Bytecode::Op::PutByValue>(object_reg, property_reg);
  511. }
  512. }
  513. generator.emit<Bytecode::Op::Load>(object_reg);
  514. }
  515. void ArrayExpression::generate_bytecode(Bytecode::Generator& generator) const
  516. {
  517. Vector<Bytecode::Register> element_regs;
  518. for (auto& element : m_elements) {
  519. if (element) {
  520. element->generate_bytecode(generator);
  521. if (is<SpreadExpression>(*element)) {
  522. TODO();
  523. continue;
  524. }
  525. } else {
  526. generator.emit<Bytecode::Op::LoadImmediate>(Value {});
  527. }
  528. auto element_reg = generator.allocate_register();
  529. generator.emit<Bytecode::Op::Store>(element_reg);
  530. element_regs.append(element_reg);
  531. }
  532. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(element_regs.size(), element_regs);
  533. }
  534. void MemberExpression::generate_bytecode(Bytecode::Generator& generator) const
  535. {
  536. object().generate_bytecode(generator);
  537. if (is_computed()) {
  538. auto object_reg = generator.allocate_register();
  539. generator.emit<Bytecode::Op::Store>(object_reg);
  540. property().generate_bytecode(generator);
  541. generator.emit<Bytecode::Op::GetByValue>(object_reg);
  542. } else {
  543. VERIFY(is<Identifier>(property()));
  544. auto identifier_table_ref = generator.intern_string(static_cast<Identifier const&>(property()).string());
  545. generator.emit<Bytecode::Op::GetById>(identifier_table_ref);
  546. }
  547. }
  548. void FunctionDeclaration::generate_bytecode(Bytecode::Generator&) const
  549. {
  550. }
  551. void FunctionExpression::generate_bytecode(Bytecode::Generator& generator) const
  552. {
  553. generator.emit<Bytecode::Op::NewFunction>(*this);
  554. }
  555. static void generate_binding_pattern_bytecode(Bytecode::Generator& generator, BindingPattern const& pattern, Bytecode::Register const& value_reg);
  556. static void generate_object_binding_pattern_bytecode(Bytecode::Generator& generator, BindingPattern const& pattern, Bytecode::Register const& value_reg)
  557. {
  558. Vector<Bytecode::Register> excluded_property_names;
  559. auto has_rest = false;
  560. if (pattern.entries.size() > 0)
  561. has_rest = pattern.entries[pattern.entries.size() - 1].is_rest;
  562. for (auto& [name, alias, initializer, is_rest] : pattern.entries) {
  563. if (is_rest) {
  564. VERIFY(name.has<NonnullRefPtr<Identifier>>());
  565. VERIFY(alias.has<Empty>());
  566. VERIFY(!initializer);
  567. auto identifier = name.get<NonnullRefPtr<Identifier>>()->string();
  568. auto interned_identifier = generator.intern_string(identifier);
  569. generator.emit_with_extra_register_slots<Bytecode::Op::CopyObjectExcludingProperties>(excluded_property_names.size(), value_reg, excluded_property_names);
  570. generator.emit<Bytecode::Op::SetVariable>(interned_identifier);
  571. return;
  572. }
  573. Bytecode::StringTableIndex name_index;
  574. if (name.has<NonnullRefPtr<Identifier>>()) {
  575. auto identifier = name.get<NonnullRefPtr<Identifier>>()->string();
  576. name_index = generator.intern_string(identifier);
  577. if (has_rest) {
  578. auto excluded_name_reg = generator.allocate_register();
  579. excluded_property_names.append(excluded_name_reg);
  580. generator.emit<Bytecode::Op::NewString>(name_index);
  581. generator.emit<Bytecode::Op::Store>(excluded_name_reg);
  582. }
  583. generator.emit<Bytecode::Op::Load>(value_reg);
  584. generator.emit<Bytecode::Op::GetById>(name_index);
  585. } else {
  586. auto expression = name.get<NonnullRefPtr<Expression>>();
  587. expression->generate_bytecode(generator);
  588. if (has_rest) {
  589. auto excluded_name_reg = generator.allocate_register();
  590. excluded_property_names.append(excluded_name_reg);
  591. generator.emit<Bytecode::Op::Store>(excluded_name_reg);
  592. }
  593. generator.emit<Bytecode::Op::GetByValue>(value_reg);
  594. }
  595. if (initializer) {
  596. auto& if_undefined_block = generator.make_block();
  597. auto& if_not_undefined_block = generator.make_block();
  598. generator.emit<Bytecode::Op::JumpUndefined>().set_targets(
  599. Bytecode::Label { if_undefined_block },
  600. Bytecode::Label { if_not_undefined_block });
  601. generator.switch_to_basic_block(if_undefined_block);
  602. initializer->generate_bytecode(generator);
  603. generator.emit<Bytecode::Op::Jump>().set_targets(
  604. Bytecode::Label { if_not_undefined_block },
  605. {});
  606. generator.switch_to_basic_block(if_not_undefined_block);
  607. }
  608. if (alias.has<NonnullRefPtr<BindingPattern>>()) {
  609. auto& binding_pattern = *alias.get<NonnullRefPtr<BindingPattern>>();
  610. auto nested_value_reg = generator.allocate_register();
  611. generator.emit<Bytecode::Op::Store>(nested_value_reg);
  612. generate_binding_pattern_bytecode(generator, binding_pattern, nested_value_reg);
  613. } else if (alias.has<Empty>()) {
  614. if (name.has<NonnullRefPtr<Expression>>()) {
  615. // This needs some sort of SetVariableByValue opcode, as it's a runtime binding
  616. TODO();
  617. }
  618. generator.emit<Bytecode::Op::SetVariable>(name_index);
  619. } else {
  620. auto& identifier = alias.get<NonnullRefPtr<Identifier>>()->string();
  621. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier));
  622. }
  623. }
  624. }
  625. static void generate_array_binding_pattern_bytecode(Bytecode::Generator& generator, BindingPattern const& pattern, Bytecode::Register const& value_reg)
  626. {
  627. /*
  628. * Consider the following destructuring assignment:
  629. *
  630. * let [a, b, c, d, e] = o;
  631. *
  632. * It would be fairly trivial to just loop through this iterator, getting the value
  633. * at each step and assigning them to the binding sequentially. However, this is not
  634. * correct: once an iterator is exhausted, it must not be called again. This complicates
  635. * the bytecode. In order to accomplish this, we do the following:
  636. *
  637. * - Reserve a special boolean register which holds 'true' if the iterator is exhausted,
  638. * and false otherwise
  639. * - When we are retrieving the value which should be bound, we first check this register.
  640. * If it is 'true', we load undefined into the accumulator. Otherwise, we grab the next
  641. * value from the iterator and store it into the accumulator.
  642. *
  643. * Note that the is_exhausted register does not need to be loaded with false because the
  644. * first IteratorNext bytecode is _not_ proceeded by an exhausted check, as it is
  645. * unnecessary.
  646. */
  647. auto is_iterator_exhausted_register = generator.allocate_register();
  648. auto iterator_reg = generator.allocate_register();
  649. generator.emit<Bytecode::Op::Load>(value_reg);
  650. generator.emit<Bytecode::Op::GetIterator>();
  651. generator.emit<Bytecode::Op::Store>(iterator_reg);
  652. bool first = true;
  653. auto temp_iterator_result_reg = generator.allocate_register();
  654. auto assign_accumulator_to_alias = [&](auto& alias) {
  655. alias.visit(
  656. [&](Empty) {
  657. // This element is an elision
  658. },
  659. [&](NonnullRefPtr<Identifier> const& identifier) {
  660. auto interned_index = generator.intern_string(identifier->string());
  661. generator.emit<Bytecode::Op::SetVariable>(interned_index);
  662. },
  663. [&](NonnullRefPtr<BindingPattern> const& pattern) {
  664. // Store the accumulator value in a permanent register
  665. auto target_reg = generator.allocate_register();
  666. generator.emit<Bytecode::Op::Store>(target_reg);
  667. generate_binding_pattern_bytecode(generator, pattern, target_reg);
  668. });
  669. };
  670. for (auto& [name, alias, initializer, is_rest] : pattern.entries) {
  671. VERIFY(name.has<Empty>());
  672. if (is_rest) {
  673. if (first) {
  674. // The iterator has not been called, and is thus known to be not exhausted
  675. generator.emit<Bytecode::Op::Load>(iterator_reg);
  676. generator.emit<Bytecode::Op::IteratorToArray>();
  677. } else {
  678. auto& if_exhausted_block = generator.make_block();
  679. auto& if_not_exhausted_block = generator.make_block();
  680. auto& continuation_block = generator.make_block();
  681. generator.emit<Bytecode::Op::Load>(is_iterator_exhausted_register);
  682. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  683. Bytecode::Label { if_exhausted_block },
  684. Bytecode::Label { if_not_exhausted_block });
  685. generator.switch_to_basic_block(if_exhausted_block);
  686. generator.emit<Bytecode::Op::NewArray>();
  687. generator.emit<Bytecode::Op::Jump>().set_targets(
  688. Bytecode::Label { continuation_block },
  689. {});
  690. generator.switch_to_basic_block(if_not_exhausted_block);
  691. generator.emit<Bytecode::Op::Load>(iterator_reg);
  692. generator.emit<Bytecode::Op::IteratorToArray>();
  693. generator.emit<Bytecode::Op::Jump>().set_targets(
  694. Bytecode::Label { continuation_block },
  695. {});
  696. generator.switch_to_basic_block(continuation_block);
  697. }
  698. assign_accumulator_to_alias(alias);
  699. return;
  700. }
  701. // In the first iteration of the loop, a few things are true which can save
  702. // us some bytecode:
  703. // - the iterator result is still in the accumulator, so we can avoid a load
  704. // - the iterator is not yet exhausted, which can save us a jump and some
  705. // creation
  706. auto& iterator_is_exhausted_block = generator.make_block();
  707. if (!first) {
  708. auto& iterator_is_not_exhausted_block = generator.make_block();
  709. generator.emit<Bytecode::Op::Load>(is_iterator_exhausted_register);
  710. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  711. Bytecode::Label { iterator_is_exhausted_block },
  712. Bytecode::Label { iterator_is_not_exhausted_block });
  713. generator.switch_to_basic_block(iterator_is_not_exhausted_block);
  714. generator.emit<Bytecode::Op::Load>(iterator_reg);
  715. }
  716. generator.emit<Bytecode::Op::IteratorNext>();
  717. generator.emit<Bytecode::Op::Store>(temp_iterator_result_reg);
  718. generator.emit<Bytecode::Op::IteratorResultDone>();
  719. generator.emit<Bytecode::Op::Store>(is_iterator_exhausted_register);
  720. // We still have to check for exhaustion here. If the iterator is exhausted,
  721. // we need to bail before trying to get the value
  722. auto& no_bail_block = generator.make_block();
  723. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  724. Bytecode::Label { iterator_is_exhausted_block },
  725. Bytecode::Label { no_bail_block });
  726. generator.switch_to_basic_block(no_bail_block);
  727. // Get the next value in the iterator
  728. generator.emit<Bytecode::Op::Load>(temp_iterator_result_reg);
  729. generator.emit<Bytecode::Op::IteratorResultValue>();
  730. auto& create_binding_block = generator.make_block();
  731. generator.emit<Bytecode::Op::Jump>().set_targets(
  732. Bytecode::Label { create_binding_block },
  733. {});
  734. // The iterator is exhausted, so we just load undefined and continue binding
  735. generator.switch_to_basic_block(iterator_is_exhausted_block);
  736. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  737. generator.emit<Bytecode::Op::Jump>().set_targets(
  738. Bytecode::Label { create_binding_block },
  739. {});
  740. // Create the actual binding. The value which this entry must bind is now in the
  741. // accumulator. We can proceed, processing the alias as a nested destructuring
  742. // pattern if necessary.
  743. generator.switch_to_basic_block(create_binding_block);
  744. assign_accumulator_to_alias(alias);
  745. first = false;
  746. }
  747. }
  748. static void generate_binding_pattern_bytecode(Bytecode::Generator& generator, BindingPattern const& pattern, Bytecode::Register const& value_reg)
  749. {
  750. if (pattern.kind == BindingPattern::Kind::Object) {
  751. generate_object_binding_pattern_bytecode(generator, pattern, value_reg);
  752. } else {
  753. generate_array_binding_pattern_bytecode(generator, pattern, value_reg);
  754. }
  755. };
  756. void VariableDeclaration::generate_bytecode(Bytecode::Generator& generator) const
  757. {
  758. for (auto& declarator : m_declarations) {
  759. if (declarator.init())
  760. declarator.init()->generate_bytecode(generator);
  761. else
  762. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  763. declarator.target().visit(
  764. [&](NonnullRefPtr<Identifier> const& id) {
  765. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(id->string()));
  766. },
  767. [&](NonnullRefPtr<BindingPattern> const& pattern) {
  768. auto value_register = generator.allocate_register();
  769. generator.emit<Bytecode::Op::Store>(value_register);
  770. generate_binding_pattern_bytecode(generator, pattern, value_register);
  771. });
  772. }
  773. }
  774. void CallExpression::generate_bytecode(Bytecode::Generator& generator) const
  775. {
  776. auto callee_reg = generator.allocate_register();
  777. auto this_reg = generator.allocate_register();
  778. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  779. generator.emit<Bytecode::Op::Store>(this_reg);
  780. if (is<NewExpression>(this)) {
  781. m_callee->generate_bytecode(generator);
  782. generator.emit<Bytecode::Op::Store>(callee_reg);
  783. } else if (is<SuperExpression>(*m_callee)) {
  784. TODO();
  785. } else if (is<MemberExpression>(*m_callee)) {
  786. auto& member_expression = static_cast<const MemberExpression&>(*m_callee);
  787. if (is<SuperExpression>(member_expression.object())) {
  788. TODO();
  789. } else {
  790. member_expression.object().generate_bytecode(generator);
  791. generator.emit<Bytecode::Op::Store>(this_reg);
  792. // FIXME: Don't copy this logic here, make MemberExpression generate it.
  793. if (!is<Identifier>(member_expression.property()))
  794. TODO();
  795. auto identifier_table_ref = generator.intern_string(static_cast<Identifier const&>(member_expression.property()).string());
  796. generator.emit<Bytecode::Op::GetById>(identifier_table_ref);
  797. generator.emit<Bytecode::Op::Store>(callee_reg);
  798. }
  799. } else {
  800. // FIXME: this = global object in sloppy mode.
  801. m_callee->generate_bytecode(generator);
  802. generator.emit<Bytecode::Op::Store>(callee_reg);
  803. }
  804. Vector<Bytecode::Register> argument_registers;
  805. for (auto& arg : m_arguments) {
  806. arg.value->generate_bytecode(generator);
  807. auto arg_reg = generator.allocate_register();
  808. generator.emit<Bytecode::Op::Store>(arg_reg);
  809. argument_registers.append(arg_reg);
  810. }
  811. Bytecode::Op::Call::CallType call_type;
  812. if (is<NewExpression>(*this)) {
  813. call_type = Bytecode::Op::Call::CallType::Construct;
  814. } else {
  815. call_type = Bytecode::Op::Call::CallType::Call;
  816. }
  817. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_registers.size(), call_type, callee_reg, this_reg, argument_registers);
  818. }
  819. void ReturnStatement::generate_bytecode(Bytecode::Generator& generator) const
  820. {
  821. if (m_argument)
  822. m_argument->generate_bytecode(generator);
  823. if (generator.is_in_generator_function())
  824. generator.emit<Bytecode::Op::Yield>(nullptr);
  825. else
  826. generator.emit<Bytecode::Op::Return>();
  827. }
  828. void YieldExpression::generate_bytecode(Bytecode::Generator& generator) const
  829. {
  830. VERIFY(generator.is_in_generator_function());
  831. if (m_is_yield_from)
  832. TODO();
  833. if (m_argument)
  834. m_argument->generate_bytecode(generator);
  835. auto& continuation_block = generator.make_block();
  836. generator.emit<Bytecode::Op::Yield>(Bytecode::Label { continuation_block });
  837. generator.switch_to_basic_block(continuation_block);
  838. }
  839. void IfStatement::generate_bytecode(Bytecode::Generator& generator) const
  840. {
  841. // test
  842. // jump if_true (true) true (false) false
  843. // true
  844. // jump always (true) end
  845. // false
  846. // jump always (true) end
  847. // end
  848. // If the 'false' branch doesn't exist, we're just gonna substitute it for 'end' and elide the last two entries above.
  849. auto& true_block = generator.make_block();
  850. auto& false_block = generator.make_block();
  851. m_predicate->generate_bytecode(generator);
  852. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  853. Bytecode::Label { true_block },
  854. Bytecode::Label { false_block });
  855. Bytecode::Op::Jump* true_block_jump { nullptr };
  856. generator.switch_to_basic_block(true_block);
  857. m_consequent->generate_bytecode(generator);
  858. if (!generator.is_current_block_terminated())
  859. true_block_jump = &generator.emit<Bytecode::Op::Jump>();
  860. generator.switch_to_basic_block(false_block);
  861. if (m_alternate) {
  862. auto& end_block = generator.make_block();
  863. m_alternate->generate_bytecode(generator);
  864. if (!generator.is_current_block_terminated())
  865. generator.emit<Bytecode::Op::Jump>().set_targets(
  866. Bytecode::Label { end_block },
  867. {});
  868. if (true_block_jump)
  869. true_block_jump->set_targets(
  870. Bytecode::Label { end_block },
  871. {});
  872. generator.switch_to_basic_block(end_block);
  873. } else {
  874. if (true_block_jump)
  875. true_block_jump->set_targets(
  876. Bytecode::Label { false_block },
  877. {});
  878. }
  879. }
  880. void ContinueStatement::generate_bytecode(Bytecode::Generator& generator) const
  881. {
  882. generator.emit<Bytecode::Op::Jump>().set_targets(
  883. generator.nearest_continuable_scope(),
  884. {});
  885. }
  886. void DebuggerStatement::generate_bytecode(Bytecode::Generator&) const
  887. {
  888. }
  889. void ConditionalExpression::generate_bytecode(Bytecode::Generator& generator) const
  890. {
  891. // test
  892. // jump if_true (true) true (false) false
  893. // true
  894. // jump always (true) end
  895. // false
  896. // jump always (true) end
  897. // end
  898. auto& true_block = generator.make_block();
  899. auto& false_block = generator.make_block();
  900. auto& end_block = generator.make_block();
  901. m_test->generate_bytecode(generator);
  902. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  903. Bytecode::Label { true_block },
  904. Bytecode::Label { false_block });
  905. generator.switch_to_basic_block(true_block);
  906. m_consequent->generate_bytecode(generator);
  907. generator.emit<Bytecode::Op::Jump>().set_targets(
  908. Bytecode::Label { end_block },
  909. {});
  910. generator.switch_to_basic_block(false_block);
  911. m_alternate->generate_bytecode(generator);
  912. generator.emit<Bytecode::Op::Jump>().set_targets(
  913. Bytecode::Label { end_block },
  914. {});
  915. generator.switch_to_basic_block(end_block);
  916. }
  917. void SequenceExpression::generate_bytecode(Bytecode::Generator& generator) const
  918. {
  919. for (auto& expression : m_expressions)
  920. expression.generate_bytecode(generator);
  921. }
  922. void TemplateLiteral::generate_bytecode(Bytecode::Generator& generator) const
  923. {
  924. auto string_reg = generator.allocate_register();
  925. for (size_t i = 0; i < m_expressions.size(); i++) {
  926. m_expressions[i].generate_bytecode(generator);
  927. if (i == 0) {
  928. generator.emit<Bytecode::Op::Store>(string_reg);
  929. } else {
  930. generator.emit<Bytecode::Op::ConcatString>(string_reg);
  931. }
  932. }
  933. generator.emit<Bytecode::Op::Load>(string_reg);
  934. }
  935. void TaggedTemplateLiteral::generate_bytecode(Bytecode::Generator& generator) const
  936. {
  937. m_tag->generate_bytecode(generator);
  938. auto tag_reg = generator.allocate_register();
  939. generator.emit<Bytecode::Op::Store>(tag_reg);
  940. Vector<Bytecode::Register> string_regs;
  941. auto& expressions = m_template_literal->expressions();
  942. for (size_t i = 0; i < expressions.size(); ++i) {
  943. if (i % 2 != 0)
  944. continue;
  945. expressions[i].generate_bytecode(generator);
  946. auto string_reg = generator.allocate_register();
  947. generator.emit<Bytecode::Op::Store>(string_reg);
  948. string_regs.append(string_reg);
  949. }
  950. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(string_regs.size(), string_regs);
  951. auto strings_reg = generator.allocate_register();
  952. generator.emit<Bytecode::Op::Store>(strings_reg);
  953. Vector<Bytecode::Register> argument_regs;
  954. argument_regs.append(strings_reg);
  955. for (size_t i = 0; i < expressions.size(); ++i) {
  956. if (i % 2 == 0)
  957. continue;
  958. expressions[i].generate_bytecode(generator);
  959. auto string_reg = generator.allocate_register();
  960. generator.emit<Bytecode::Op::Store>(string_reg);
  961. argument_regs.append(string_reg);
  962. }
  963. Vector<Bytecode::Register> raw_string_regs;
  964. for (auto& raw_string : m_template_literal->raw_strings()) {
  965. raw_string.generate_bytecode(generator);
  966. auto raw_string_reg = generator.allocate_register();
  967. generator.emit<Bytecode::Op::Store>(raw_string_reg);
  968. raw_string_regs.append(raw_string_reg);
  969. }
  970. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(raw_string_regs.size(), raw_string_regs);
  971. auto raw_strings_reg = generator.allocate_register();
  972. generator.emit<Bytecode::Op::Store>(raw_strings_reg);
  973. generator.emit<Bytecode::Op::Load>(strings_reg);
  974. generator.emit<Bytecode::Op::PutById>(raw_strings_reg, generator.intern_string("raw"));
  975. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  976. auto this_reg = generator.allocate_register();
  977. generator.emit<Bytecode::Op::Store>(this_reg);
  978. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_regs.size(), Bytecode::Op::Call::CallType::Call, tag_reg, this_reg, move(argument_regs));
  979. }
  980. void UpdateExpression::generate_bytecode(Bytecode::Generator& generator) const
  981. {
  982. if (is<Identifier>(*m_argument)) {
  983. auto& identifier = static_cast<Identifier const&>(*m_argument);
  984. generator.emit<Bytecode::Op::GetVariable>(generator.intern_string(identifier.string()));
  985. Optional<Bytecode::Register> previous_value_for_postfix_reg;
  986. if (!m_prefixed) {
  987. previous_value_for_postfix_reg = generator.allocate_register();
  988. generator.emit<Bytecode::Op::Store>(*previous_value_for_postfix_reg);
  989. }
  990. if (m_op == UpdateOp::Increment)
  991. generator.emit<Bytecode::Op::Increment>();
  992. else
  993. generator.emit<Bytecode::Op::Decrement>();
  994. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier.string()));
  995. if (!m_prefixed)
  996. generator.emit<Bytecode::Op::Load>(*previous_value_for_postfix_reg);
  997. return;
  998. }
  999. TODO();
  1000. }
  1001. void ThrowStatement::generate_bytecode(Bytecode::Generator& generator) const
  1002. {
  1003. m_argument->generate_bytecode(generator);
  1004. generator.emit<Bytecode::Op::Throw>();
  1005. }
  1006. void BreakStatement::generate_bytecode(Bytecode::Generator& generator) const
  1007. {
  1008. generator.emit<Bytecode::Op::Jump>().set_targets(
  1009. generator.nearest_breakable_scope(),
  1010. {});
  1011. }
  1012. void TryStatement::generate_bytecode(Bytecode::Generator& generator) const
  1013. {
  1014. auto& saved_block = generator.current_block();
  1015. Optional<Bytecode::Label> handler_target;
  1016. Optional<Bytecode::Label> finalizer_target;
  1017. Bytecode::BasicBlock* next_block { nullptr };
  1018. if (m_finalizer) {
  1019. auto& finalizer_block = generator.make_block();
  1020. generator.switch_to_basic_block(finalizer_block);
  1021. m_finalizer->generate_bytecode(generator);
  1022. if (!generator.is_current_block_terminated()) {
  1023. next_block = &generator.make_block();
  1024. auto next_target = Bytecode::Label { *next_block };
  1025. generator.emit<Bytecode::Op::ContinuePendingUnwind>(next_target);
  1026. }
  1027. finalizer_target = Bytecode::Label { finalizer_block };
  1028. }
  1029. if (m_handler) {
  1030. auto& handler_block = generator.make_block();
  1031. generator.switch_to_basic_block(handler_block);
  1032. if (!m_finalizer)
  1033. generator.emit<Bytecode::Op::LeaveUnwindContext>();
  1034. if (!m_handler->parameter().is_empty()) {
  1035. // FIXME: We need a separate LexicalEnvironment here
  1036. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(m_handler->parameter()));
  1037. }
  1038. m_handler->body().generate_bytecode(generator);
  1039. handler_target = Bytecode::Label { handler_block };
  1040. if (!generator.is_current_block_terminated()) {
  1041. if (m_finalizer) {
  1042. generator.emit<Bytecode::Op::LeaveUnwindContext>();
  1043. generator.emit<Bytecode::Op::Jump>(finalizer_target);
  1044. } else {
  1045. VERIFY(!next_block);
  1046. next_block = &generator.make_block();
  1047. auto next_target = Bytecode::Label { *next_block };
  1048. generator.emit<Bytecode::Op::Jump>(next_target);
  1049. }
  1050. }
  1051. }
  1052. auto& target_block = generator.make_block();
  1053. generator.switch_to_basic_block(saved_block);
  1054. generator.emit<Bytecode::Op::EnterUnwindContext>(Bytecode::Label { target_block }, handler_target, finalizer_target);
  1055. generator.switch_to_basic_block(target_block);
  1056. m_block->generate_bytecode(generator);
  1057. if (m_finalizer && !generator.is_current_block_terminated())
  1058. generator.emit<Bytecode::Op::Jump>(finalizer_target);
  1059. generator.switch_to_basic_block(next_block ? *next_block : saved_block);
  1060. }
  1061. void SwitchStatement::generate_bytecode(Bytecode::Generator& generator) const
  1062. {
  1063. auto discriminant_reg = generator.allocate_register();
  1064. m_discriminant->generate_bytecode(generator);
  1065. generator.emit<Bytecode::Op::Store>(discriminant_reg);
  1066. Vector<Bytecode::BasicBlock&> case_blocks;
  1067. Bytecode::BasicBlock* default_block { nullptr };
  1068. Bytecode::BasicBlock* next_test_block = &generator.make_block();
  1069. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { *next_test_block }, {});
  1070. for (auto& switch_case : m_cases) {
  1071. auto& case_block = generator.make_block();
  1072. if (switch_case.test()) {
  1073. generator.switch_to_basic_block(*next_test_block);
  1074. switch_case.test()->generate_bytecode(generator);
  1075. generator.emit<Bytecode::Op::TypedEquals>(discriminant_reg);
  1076. next_test_block = &generator.make_block();
  1077. generator.emit<Bytecode::Op::JumpConditional>().set_targets(Bytecode::Label { case_block }, Bytecode::Label { *next_test_block });
  1078. } else {
  1079. default_block = &case_block;
  1080. }
  1081. case_blocks.append(case_block);
  1082. }
  1083. generator.switch_to_basic_block(*next_test_block);
  1084. auto& end_block = generator.make_block();
  1085. if (default_block != nullptr) {
  1086. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { *default_block }, {});
  1087. } else {
  1088. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  1089. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { end_block }, {});
  1090. }
  1091. auto current_block = case_blocks.begin();
  1092. generator.begin_breakable_scope(Bytecode::Label { end_block });
  1093. for (auto& switch_case : m_cases) {
  1094. generator.switch_to_basic_block(*current_block);
  1095. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  1096. for (auto& statement : switch_case.consequent()) {
  1097. statement.generate_bytecode(generator);
  1098. }
  1099. if (!generator.is_current_block_terminated()) {
  1100. auto next_block = current_block;
  1101. next_block++;
  1102. if (next_block.is_end()) {
  1103. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { end_block }, {});
  1104. } else {
  1105. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { *next_block }, {});
  1106. }
  1107. }
  1108. current_block++;
  1109. }
  1110. generator.end_breakable_scope();
  1111. generator.switch_to_basic_block(end_block);
  1112. }
  1113. }