ASTCodegen.cpp 40 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123
  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, bool object_pattern)
  556. {
  557. for (auto& [name, alias, initializer, is_rest] : pattern.entries) {
  558. if (is_rest)
  559. TODO();
  560. if (object_pattern) {
  561. Bytecode::StringTableIndex name_index;
  562. if (name.has<NonnullRefPtr<Identifier>>()) {
  563. auto identifier = name.get<NonnullRefPtr<Identifier>>()->string();
  564. name_index = generator.intern_string(identifier);
  565. generator.emit<Bytecode::Op::Load>(value);
  566. generator.emit<Bytecode::Op::GetById>(name_index);
  567. } else {
  568. auto expression = name.get<NonnullRefPtr<Expression>>();
  569. expression->generate_bytecode(generator);
  570. generator.emit<Bytecode::Op::GetByValue>(value);
  571. }
  572. if (initializer) {
  573. auto& if_undefined_block = generator.make_block();
  574. auto& if_not_undefined_block = generator.make_block();
  575. generator.emit<Bytecode::Op::JumpUndefined>().set_targets(
  576. Bytecode::Label { if_undefined_block },
  577. Bytecode::Label { if_not_undefined_block });
  578. generator.switch_to_basic_block(if_undefined_block);
  579. initializer->generate_bytecode(generator);
  580. generator.emit<Bytecode::Op::Jump>().set_targets(
  581. Bytecode::Label { if_not_undefined_block },
  582. {});
  583. generator.switch_to_basic_block(if_not_undefined_block);
  584. }
  585. if (alias.has<NonnullRefPtr<BindingPattern>>()) {
  586. auto& binding_pattern = *alias.get<NonnullRefPtr<BindingPattern>>();
  587. auto nested_value_reg = generator.allocate_register();
  588. generator.emit<Bytecode::Op::Store>(nested_value_reg);
  589. generate_binding_pattern_bytecode(generator, binding_pattern, nested_value_reg, binding_pattern.kind == BindingPattern::Kind::Object);
  590. } else if (alias.has<Empty>()) {
  591. if (name.has<NonnullRefPtr<Expression>>()) {
  592. // This needs some sort of SetVariableByValue opcode, as it's a runtime binding
  593. TODO();
  594. }
  595. generator.emit<Bytecode::Op::SetVariable>(name_index);
  596. } else {
  597. auto& identifier = alias.get<NonnullRefPtr<Identifier>>()->string();
  598. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier));
  599. }
  600. } else {
  601. TODO();
  602. }
  603. }
  604. };
  605. void VariableDeclaration::generate_bytecode(Bytecode::Generator& generator) const
  606. {
  607. for (auto& declarator : m_declarations) {
  608. if (declarator.init())
  609. declarator.init()->generate_bytecode(generator);
  610. else
  611. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  612. declarator.target().visit(
  613. [&](NonnullRefPtr<Identifier> const& id) {
  614. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(id->string()));
  615. },
  616. [&](NonnullRefPtr<BindingPattern> const& pattern) {
  617. auto value_register = generator.allocate_register();
  618. generator.emit<Bytecode::Op::Store>(value_register);
  619. generate_binding_pattern_bytecode(generator, pattern, value_register, pattern->kind == BindingPattern::Kind::Object);
  620. });
  621. }
  622. }
  623. void CallExpression::generate_bytecode(Bytecode::Generator& generator) const
  624. {
  625. auto callee_reg = generator.allocate_register();
  626. auto this_reg = generator.allocate_register();
  627. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  628. generator.emit<Bytecode::Op::Store>(this_reg);
  629. if (is<NewExpression>(this)) {
  630. m_callee->generate_bytecode(generator);
  631. generator.emit<Bytecode::Op::Store>(callee_reg);
  632. } else if (is<SuperExpression>(*m_callee)) {
  633. TODO();
  634. } else if (is<MemberExpression>(*m_callee)) {
  635. auto& member_expression = static_cast<const MemberExpression&>(*m_callee);
  636. if (is<SuperExpression>(member_expression.object())) {
  637. TODO();
  638. } else {
  639. member_expression.object().generate_bytecode(generator);
  640. generator.emit<Bytecode::Op::Store>(this_reg);
  641. // FIXME: Don't copy this logic here, make MemberExpression generate it.
  642. if (!is<Identifier>(member_expression.property()))
  643. TODO();
  644. auto identifier_table_ref = generator.intern_string(static_cast<Identifier const&>(member_expression.property()).string());
  645. generator.emit<Bytecode::Op::GetById>(identifier_table_ref);
  646. generator.emit<Bytecode::Op::Store>(callee_reg);
  647. }
  648. } else {
  649. // FIXME: this = global object in sloppy mode.
  650. m_callee->generate_bytecode(generator);
  651. generator.emit<Bytecode::Op::Store>(callee_reg);
  652. }
  653. Vector<Bytecode::Register> argument_registers;
  654. for (auto& arg : m_arguments) {
  655. arg.value->generate_bytecode(generator);
  656. auto arg_reg = generator.allocate_register();
  657. generator.emit<Bytecode::Op::Store>(arg_reg);
  658. argument_registers.append(arg_reg);
  659. }
  660. Bytecode::Op::Call::CallType call_type;
  661. if (is<NewExpression>(*this)) {
  662. call_type = Bytecode::Op::Call::CallType::Construct;
  663. } else {
  664. call_type = Bytecode::Op::Call::CallType::Call;
  665. }
  666. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_registers.size(), call_type, callee_reg, this_reg, argument_registers);
  667. }
  668. void ReturnStatement::generate_bytecode(Bytecode::Generator& generator) const
  669. {
  670. if (m_argument)
  671. m_argument->generate_bytecode(generator);
  672. if (generator.is_in_generator_function())
  673. generator.emit<Bytecode::Op::Yield>(nullptr);
  674. else
  675. generator.emit<Bytecode::Op::Return>();
  676. }
  677. void YieldExpression::generate_bytecode(Bytecode::Generator& generator) const
  678. {
  679. VERIFY(generator.is_in_generator_function());
  680. if (m_is_yield_from)
  681. TODO();
  682. if (m_argument)
  683. m_argument->generate_bytecode(generator);
  684. auto& continuation_block = generator.make_block();
  685. generator.emit<Bytecode::Op::Yield>(Bytecode::Label { continuation_block });
  686. generator.switch_to_basic_block(continuation_block);
  687. }
  688. void IfStatement::generate_bytecode(Bytecode::Generator& generator) const
  689. {
  690. // test
  691. // jump if_true (true) true (false) false
  692. // true
  693. // jump always (true) end
  694. // false
  695. // jump always (true) end
  696. // end
  697. // If the 'false' branch doesn't exist, we're just gonna substitute it for 'end' and elide the last two entries above.
  698. auto& true_block = generator.make_block();
  699. auto& false_block = generator.make_block();
  700. m_predicate->generate_bytecode(generator);
  701. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  702. Bytecode::Label { true_block },
  703. Bytecode::Label { false_block });
  704. Bytecode::Op::Jump* true_block_jump { nullptr };
  705. generator.switch_to_basic_block(true_block);
  706. m_consequent->generate_bytecode(generator);
  707. if (!generator.is_current_block_terminated())
  708. true_block_jump = &generator.emit<Bytecode::Op::Jump>();
  709. generator.switch_to_basic_block(false_block);
  710. if (m_alternate) {
  711. auto& end_block = generator.make_block();
  712. m_alternate->generate_bytecode(generator);
  713. if (!generator.is_current_block_terminated())
  714. generator.emit<Bytecode::Op::Jump>().set_targets(
  715. Bytecode::Label { end_block },
  716. {});
  717. if (true_block_jump)
  718. true_block_jump->set_targets(
  719. Bytecode::Label { end_block },
  720. {});
  721. generator.switch_to_basic_block(end_block);
  722. } else {
  723. if (true_block_jump)
  724. true_block_jump->set_targets(
  725. Bytecode::Label { false_block },
  726. {});
  727. }
  728. }
  729. void ContinueStatement::generate_bytecode(Bytecode::Generator& generator) const
  730. {
  731. generator.emit<Bytecode::Op::Jump>().set_targets(
  732. generator.nearest_continuable_scope(),
  733. {});
  734. }
  735. void DebuggerStatement::generate_bytecode(Bytecode::Generator&) const
  736. {
  737. }
  738. void ConditionalExpression::generate_bytecode(Bytecode::Generator& generator) const
  739. {
  740. // test
  741. // jump if_true (true) true (false) false
  742. // true
  743. // jump always (true) end
  744. // false
  745. // jump always (true) end
  746. // end
  747. auto& true_block = generator.make_block();
  748. auto& false_block = generator.make_block();
  749. auto& end_block = generator.make_block();
  750. m_test->generate_bytecode(generator);
  751. generator.emit<Bytecode::Op::JumpConditional>().set_targets(
  752. Bytecode::Label { true_block },
  753. Bytecode::Label { false_block });
  754. generator.switch_to_basic_block(true_block);
  755. m_consequent->generate_bytecode(generator);
  756. generator.emit<Bytecode::Op::Jump>().set_targets(
  757. Bytecode::Label { end_block },
  758. {});
  759. generator.switch_to_basic_block(false_block);
  760. m_alternate->generate_bytecode(generator);
  761. generator.emit<Bytecode::Op::Jump>().set_targets(
  762. Bytecode::Label { end_block },
  763. {});
  764. generator.switch_to_basic_block(end_block);
  765. }
  766. void SequenceExpression::generate_bytecode(Bytecode::Generator& generator) const
  767. {
  768. for (auto& expression : m_expressions)
  769. expression.generate_bytecode(generator);
  770. }
  771. void TemplateLiteral::generate_bytecode(Bytecode::Generator& generator) const
  772. {
  773. auto string_reg = generator.allocate_register();
  774. for (size_t i = 0; i < m_expressions.size(); i++) {
  775. m_expressions[i].generate_bytecode(generator);
  776. if (i == 0) {
  777. generator.emit<Bytecode::Op::Store>(string_reg);
  778. } else {
  779. generator.emit<Bytecode::Op::ConcatString>(string_reg);
  780. }
  781. }
  782. generator.emit<Bytecode::Op::Load>(string_reg);
  783. }
  784. void TaggedTemplateLiteral::generate_bytecode(Bytecode::Generator& generator) const
  785. {
  786. m_tag->generate_bytecode(generator);
  787. auto tag_reg = generator.allocate_register();
  788. generator.emit<Bytecode::Op::Store>(tag_reg);
  789. Vector<Bytecode::Register> string_regs;
  790. auto& expressions = m_template_literal->expressions();
  791. for (size_t i = 0; i < expressions.size(); ++i) {
  792. if (i % 2 != 0)
  793. continue;
  794. expressions[i].generate_bytecode(generator);
  795. auto string_reg = generator.allocate_register();
  796. generator.emit<Bytecode::Op::Store>(string_reg);
  797. string_regs.append(string_reg);
  798. }
  799. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(string_regs.size(), string_regs);
  800. auto strings_reg = generator.allocate_register();
  801. generator.emit<Bytecode::Op::Store>(strings_reg);
  802. Vector<Bytecode::Register> argument_regs;
  803. argument_regs.append(strings_reg);
  804. for (size_t i = 0; i < expressions.size(); ++i) {
  805. if (i % 2 == 0)
  806. continue;
  807. expressions[i].generate_bytecode(generator);
  808. auto string_reg = generator.allocate_register();
  809. generator.emit<Bytecode::Op::Store>(string_reg);
  810. argument_regs.append(string_reg);
  811. }
  812. Vector<Bytecode::Register> raw_string_regs;
  813. for (auto& raw_string : m_template_literal->raw_strings()) {
  814. raw_string.generate_bytecode(generator);
  815. auto raw_string_reg = generator.allocate_register();
  816. generator.emit<Bytecode::Op::Store>(raw_string_reg);
  817. raw_string_regs.append(raw_string_reg);
  818. }
  819. generator.emit_with_extra_register_slots<Bytecode::Op::NewArray>(raw_string_regs.size(), raw_string_regs);
  820. auto raw_strings_reg = generator.allocate_register();
  821. generator.emit<Bytecode::Op::Store>(raw_strings_reg);
  822. generator.emit<Bytecode::Op::Load>(strings_reg);
  823. generator.emit<Bytecode::Op::PutById>(raw_strings_reg, generator.intern_string("raw"));
  824. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  825. auto this_reg = generator.allocate_register();
  826. generator.emit<Bytecode::Op::Store>(this_reg);
  827. generator.emit_with_extra_register_slots<Bytecode::Op::Call>(argument_regs.size(), Bytecode::Op::Call::CallType::Call, tag_reg, this_reg, move(argument_regs));
  828. }
  829. void UpdateExpression::generate_bytecode(Bytecode::Generator& generator) const
  830. {
  831. if (is<Identifier>(*m_argument)) {
  832. auto& identifier = static_cast<Identifier const&>(*m_argument);
  833. generator.emit<Bytecode::Op::GetVariable>(generator.intern_string(identifier.string()));
  834. Optional<Bytecode::Register> previous_value_for_postfix_reg;
  835. if (!m_prefixed) {
  836. previous_value_for_postfix_reg = generator.allocate_register();
  837. generator.emit<Bytecode::Op::Store>(*previous_value_for_postfix_reg);
  838. }
  839. if (m_op == UpdateOp::Increment)
  840. generator.emit<Bytecode::Op::Increment>();
  841. else
  842. generator.emit<Bytecode::Op::Decrement>();
  843. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(identifier.string()));
  844. if (!m_prefixed)
  845. generator.emit<Bytecode::Op::Load>(*previous_value_for_postfix_reg);
  846. return;
  847. }
  848. TODO();
  849. }
  850. void ThrowStatement::generate_bytecode(Bytecode::Generator& generator) const
  851. {
  852. m_argument->generate_bytecode(generator);
  853. generator.emit<Bytecode::Op::Throw>();
  854. }
  855. void BreakStatement::generate_bytecode(Bytecode::Generator& generator) const
  856. {
  857. generator.emit<Bytecode::Op::Jump>().set_targets(
  858. generator.nearest_breakable_scope(),
  859. {});
  860. }
  861. void TryStatement::generate_bytecode(Bytecode::Generator& generator) const
  862. {
  863. auto& saved_block = generator.current_block();
  864. Optional<Bytecode::Label> handler_target;
  865. Optional<Bytecode::Label> finalizer_target;
  866. Bytecode::BasicBlock* next_block { nullptr };
  867. if (m_finalizer) {
  868. auto& finalizer_block = generator.make_block();
  869. generator.switch_to_basic_block(finalizer_block);
  870. m_finalizer->generate_bytecode(generator);
  871. if (!generator.is_current_block_terminated()) {
  872. next_block = &generator.make_block();
  873. auto next_target = Bytecode::Label { *next_block };
  874. generator.emit<Bytecode::Op::ContinuePendingUnwind>(next_target);
  875. }
  876. finalizer_target = Bytecode::Label { finalizer_block };
  877. }
  878. if (m_handler) {
  879. auto& handler_block = generator.make_block();
  880. generator.switch_to_basic_block(handler_block);
  881. if (!m_finalizer)
  882. generator.emit<Bytecode::Op::LeaveUnwindContext>();
  883. if (!m_handler->parameter().is_empty()) {
  884. // FIXME: We need a separate LexicalEnvironment here
  885. generator.emit<Bytecode::Op::SetVariable>(generator.intern_string(m_handler->parameter()));
  886. }
  887. m_handler->body().generate_bytecode(generator);
  888. handler_target = Bytecode::Label { handler_block };
  889. if (!generator.is_current_block_terminated()) {
  890. if (m_finalizer) {
  891. generator.emit<Bytecode::Op::LeaveUnwindContext>();
  892. generator.emit<Bytecode::Op::Jump>(finalizer_target);
  893. } else {
  894. VERIFY(!next_block);
  895. next_block = &generator.make_block();
  896. auto next_target = Bytecode::Label { *next_block };
  897. generator.emit<Bytecode::Op::Jump>(next_target);
  898. }
  899. }
  900. }
  901. auto& target_block = generator.make_block();
  902. generator.switch_to_basic_block(saved_block);
  903. generator.emit<Bytecode::Op::EnterUnwindContext>(Bytecode::Label { target_block }, handler_target, finalizer_target);
  904. generator.switch_to_basic_block(target_block);
  905. m_block->generate_bytecode(generator);
  906. if (m_finalizer && !generator.is_current_block_terminated())
  907. generator.emit<Bytecode::Op::Jump>(finalizer_target);
  908. generator.switch_to_basic_block(next_block ? *next_block : saved_block);
  909. }
  910. void SwitchStatement::generate_bytecode(Bytecode::Generator& generator) const
  911. {
  912. auto discriminant_reg = generator.allocate_register();
  913. m_discriminant->generate_bytecode(generator);
  914. generator.emit<Bytecode::Op::Store>(discriminant_reg);
  915. Vector<Bytecode::BasicBlock&> case_blocks;
  916. Bytecode::BasicBlock* default_block { nullptr };
  917. Bytecode::BasicBlock* next_test_block = &generator.make_block();
  918. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { *next_test_block }, {});
  919. for (auto& switch_case : m_cases) {
  920. auto& case_block = generator.make_block();
  921. if (switch_case.test()) {
  922. generator.switch_to_basic_block(*next_test_block);
  923. switch_case.test()->generate_bytecode(generator);
  924. generator.emit<Bytecode::Op::TypedEquals>(discriminant_reg);
  925. next_test_block = &generator.make_block();
  926. generator.emit<Bytecode::Op::JumpConditional>().set_targets(Bytecode::Label { case_block }, Bytecode::Label { *next_test_block });
  927. } else {
  928. default_block = &case_block;
  929. }
  930. case_blocks.append(case_block);
  931. }
  932. generator.switch_to_basic_block(*next_test_block);
  933. auto& end_block = generator.make_block();
  934. if (default_block != nullptr) {
  935. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { *default_block }, {});
  936. } else {
  937. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  938. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { end_block }, {});
  939. }
  940. auto current_block = case_blocks.begin();
  941. generator.begin_breakable_scope(Bytecode::Label { end_block });
  942. for (auto& switch_case : m_cases) {
  943. generator.switch_to_basic_block(*current_block);
  944. generator.emit<Bytecode::Op::LoadImmediate>(js_undefined());
  945. for (auto& statement : switch_case.consequent()) {
  946. statement.generate_bytecode(generator);
  947. }
  948. if (!generator.is_current_block_terminated()) {
  949. auto next_block = current_block;
  950. next_block++;
  951. if (next_block.is_end()) {
  952. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { end_block }, {});
  953. } else {
  954. generator.emit<Bytecode::Op::Jump>().set_targets(Bytecode::Label { *next_block }, {});
  955. }
  956. }
  957. current_block++;
  958. }
  959. generator.end_breakable_scope();
  960. generator.switch_to_basic_block(end_block);
  961. }
  962. }