ASTCodegen.cpp 48 KB

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