BytecodeInterpreter.cpp 50 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137
  1. /*
  2. * Copyright (c) 2021, Ali Mohammad Pur <mpfard@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/Debug.h>
  7. #include <LibWasm/AbstractMachine/AbstractMachine.h>
  8. #include <LibWasm/AbstractMachine/BytecodeInterpreter.h>
  9. #include <LibWasm/AbstractMachine/Configuration.h>
  10. #include <LibWasm/Opcode.h>
  11. #include <LibWasm/Printer/Printer.h>
  12. #include <limits.h>
  13. #include <math.h>
  14. namespace Wasm {
  15. #define TRAP_IF_NOT(x) \
  16. do { \
  17. if (trap_if_not(x, #x##sv)) { \
  18. dbgln_if(WASM_TRACE_DEBUG, "Trapped because {} failed, at line {}", #x, __LINE__); \
  19. return; \
  20. } \
  21. } while (false)
  22. #define TRAP_IF_NOT_NORETURN(x) \
  23. do { \
  24. if (trap_if_not(x, #x##sv)) { \
  25. dbgln_if(WASM_TRACE_DEBUG, "Trapped because {} failed, at line {}", #x, __LINE__); \
  26. } \
  27. } while (false)
  28. void BytecodeInterpreter::interpret(Configuration& configuration)
  29. {
  30. m_trap.clear();
  31. auto& instructions = configuration.frame().expression().instructions();
  32. auto max_ip_value = InstructionPointer { instructions.size() };
  33. auto& current_ip_value = configuration.ip();
  34. u64 executed_instructions = 0;
  35. while (current_ip_value < max_ip_value) {
  36. if (executed_instructions++ >= Constants::max_allowed_executed_instructions_per_call) [[unlikely]] {
  37. m_trap = Trap { "Exceeded maximum allowed number of instructions" };
  38. return;
  39. }
  40. auto& instruction = instructions[current_ip_value.value()];
  41. auto old_ip = current_ip_value;
  42. interpret(configuration, current_ip_value, instruction);
  43. if (m_trap.has_value())
  44. return;
  45. if (current_ip_value == old_ip) // If no jump occurred
  46. ++current_ip_value;
  47. }
  48. }
  49. void BytecodeInterpreter::branch_to_label(Configuration& configuration, LabelIndex index)
  50. {
  51. dbgln_if(WASM_TRACE_DEBUG, "Branch to label with index {}...", index.value());
  52. auto label = configuration.nth_label(index.value());
  53. TRAP_IF_NOT(label.has_value());
  54. dbgln_if(WASM_TRACE_DEBUG, "...which is actually IP {}, and has {} result(s)", label->continuation().value(), label->arity());
  55. auto results = pop_values(configuration, label->arity());
  56. size_t drop_count = index.value() + 1;
  57. for (; !configuration.stack().is_empty();) {
  58. auto& entry = configuration.stack().peek();
  59. if (entry.has<Label>()) {
  60. if (--drop_count == 0)
  61. break;
  62. }
  63. configuration.stack().pop();
  64. }
  65. for (auto& result : results)
  66. configuration.stack().push(move(result));
  67. configuration.ip() = label->continuation();
  68. }
  69. template<typename ReadType, typename PushType>
  70. void BytecodeInterpreter::load_and_push(Configuration& configuration, Instruction const& instruction)
  71. {
  72. auto& address = configuration.frame().module().memories().first();
  73. auto memory = configuration.store().get(address);
  74. if (!memory) {
  75. m_trap = Trap { "Nonexistent memory" };
  76. return;
  77. }
  78. auto& arg = instruction.arguments().get<Instruction::MemoryArgument>();
  79. TRAP_IF_NOT(!configuration.stack().is_empty());
  80. auto& entry = configuration.stack().peek();
  81. TRAP_IF_NOT(entry.has<Value>());
  82. auto base = entry.get<Value>().to<i32>();
  83. if (!base.has_value()) {
  84. m_trap = Trap { "Memory access out of bounds" };
  85. return;
  86. }
  87. auto instance_address = base.value() + static_cast<i64>(arg.offset);
  88. if (instance_address < 0 || static_cast<u64>(instance_address + sizeof(ReadType)) > memory->size()) {
  89. m_trap = Trap { "Memory access out of bounds" };
  90. dbgln("LibWasm: Memory access out of bounds (expected 0 <= {} and {} <= {})", instance_address, instance_address + sizeof(ReadType), memory->size());
  91. return;
  92. }
  93. dbgln_if(WASM_TRACE_DEBUG, "load({} : {}) -> stack", instance_address, sizeof(ReadType));
  94. auto slice = memory->data().bytes().slice(instance_address, sizeof(ReadType));
  95. configuration.stack().peek() = Value(static_cast<PushType>(read_value<ReadType>(slice)));
  96. }
  97. void BytecodeInterpreter::store_to_memory(Configuration& configuration, Instruction const& instruction, ReadonlyBytes data)
  98. {
  99. auto& address = configuration.frame().module().memories().first();
  100. auto memory = configuration.store().get(address);
  101. TRAP_IF_NOT(memory);
  102. auto& arg = instruction.arguments().get<Instruction::MemoryArgument>();
  103. TRAP_IF_NOT(!configuration.stack().is_empty());
  104. auto entry = configuration.stack().pop();
  105. TRAP_IF_NOT(entry.has<Value>());
  106. auto base = entry.get<Value>().to<i32>();
  107. TRAP_IF_NOT(base.has_value());
  108. auto instance_address = base.value() + static_cast<i64>(arg.offset);
  109. if (instance_address < 0 || static_cast<u64>(instance_address + data.size()) > memory->size()) {
  110. m_trap = Trap { "Memory access out of bounds" };
  111. dbgln("LibWasm: Memory access out of bounds (expected 0 <= {} and {} <= {})", instance_address, instance_address + data.size(), memory->size());
  112. return;
  113. }
  114. dbgln_if(WASM_TRACE_DEBUG, "tempoaray({}b) -> store({})", data.size(), instance_address);
  115. data.copy_to(memory->data().bytes().slice(instance_address, data.size()));
  116. }
  117. void BytecodeInterpreter::call_address(Configuration& configuration, FunctionAddress address)
  118. {
  119. TRAP_IF_NOT(configuration.depth() <= Constants::max_allowed_call_stack_depth);
  120. auto instance = configuration.store().get(address);
  121. TRAP_IF_NOT(instance);
  122. FunctionType const* type { nullptr };
  123. instance->visit([&](auto const& function) { type = &function.type(); });
  124. TRAP_IF_NOT(type);
  125. TRAP_IF_NOT(configuration.stack().entries().size() > type->parameters().size());
  126. Vector<Value> args;
  127. args.ensure_capacity(type->parameters().size());
  128. auto span = configuration.stack().entries().span().slice_from_end(type->parameters().size());
  129. for (auto& entry : span) {
  130. auto* ptr = entry.get_pointer<Value>();
  131. TRAP_IF_NOT(ptr != nullptr);
  132. args.unchecked_append(*ptr);
  133. }
  134. configuration.stack().entries().remove(configuration.stack().size() - span.size(), span.size());
  135. Result result { Trap { ""sv } };
  136. {
  137. CallFrameHandle handle { *this, configuration };
  138. result = configuration.call(*this, address, move(args));
  139. }
  140. if (result.is_trap()) {
  141. m_trap = move(result.trap());
  142. return;
  143. }
  144. configuration.stack().entries().ensure_capacity(configuration.stack().size() + result.values().size());
  145. for (auto& entry : result.values())
  146. configuration.stack().entries().unchecked_append(move(entry));
  147. }
  148. #define BINARY_NUMERIC_OPERATION(type, operator, cast, ...) \
  149. do { \
  150. TRAP_IF_NOT(!configuration.stack().is_empty()); \
  151. auto rhs_entry = configuration.stack().pop(); \
  152. auto& lhs_entry = configuration.stack().peek(); \
  153. TRAP_IF_NOT(rhs_entry.has<Value>()); \
  154. TRAP_IF_NOT(lhs_entry.has<Value>()); \
  155. auto rhs = rhs_entry.get<Value>().to<type>(); \
  156. auto lhs = lhs_entry.get<Value>().to<type>(); \
  157. TRAP_IF_NOT(lhs.has_value()); \
  158. TRAP_IF_NOT(rhs.has_value()); \
  159. __VA_ARGS__; \
  160. auto result = lhs.value() operator rhs.value(); \
  161. dbgln_if(WASM_TRACE_DEBUG, "{} {} {} = {}", lhs.value(), #operator, rhs.value(), result); \
  162. configuration.stack().peek() = Value(cast(result)); \
  163. return; \
  164. } while (false)
  165. #define OVF_CHECKED_BINARY_NUMERIC_OPERATION(type, operator, cast, ...) \
  166. do { \
  167. TRAP_IF_NOT(!configuration.stack().is_empty()); \
  168. auto rhs_entry = configuration.stack().pop(); \
  169. auto& lhs_entry = configuration.stack().peek(); \
  170. TRAP_IF_NOT(rhs_entry.has<Value>()); \
  171. TRAP_IF_NOT(lhs_entry.has<Value>()); \
  172. auto rhs = rhs_entry.get<Value>().to<type>(); \
  173. auto ulhs = lhs_entry.get<Value>().to<type>(); \
  174. TRAP_IF_NOT(ulhs.has_value()); \
  175. TRAP_IF_NOT(rhs.has_value()); \
  176. dbgln_if(WASM_TRACE_DEBUG, "{} {} {} = ??", ulhs.value(), #operator, rhs.value()); \
  177. __VA_ARGS__; \
  178. Checked<type> lhs = ulhs.value(); \
  179. lhs operator##= rhs.value(); \
  180. TRAP_IF_NOT(!lhs.has_overflow()); \
  181. auto result = lhs.value(); \
  182. dbgln_if(WASM_TRACE_DEBUG, "{} {} {} = {}", ulhs.value(), #operator, rhs.value(), result); \
  183. configuration.stack().peek() = Value(cast(result)); \
  184. return; \
  185. } while (false)
  186. #define BINARY_PREFIX_NUMERIC_OPERATION(type, operation, cast, ...) \
  187. do { \
  188. TRAP_IF_NOT(!configuration.stack().is_empty()); \
  189. auto rhs_entry = configuration.stack().pop(); \
  190. auto& lhs_entry = configuration.stack().peek(); \
  191. TRAP_IF_NOT(rhs_entry.has<Value>()); \
  192. TRAP_IF_NOT(lhs_entry.has<Value>()); \
  193. auto rhs = rhs_entry.get<Value>().to<type>(); \
  194. auto lhs = lhs_entry.get<Value>().to<type>(); \
  195. TRAP_IF_NOT(lhs.has_value()); \
  196. TRAP_IF_NOT(rhs.has_value()); \
  197. auto result = operation(lhs.value(), rhs.value()); \
  198. dbgln_if(WASM_TRACE_DEBUG, "{}({} {}) = {}", #operation, lhs.value(), rhs.value(), result); \
  199. configuration.stack().peek() = Value(cast(result)); \
  200. return; \
  201. } while (false)
  202. #define UNARY_MAP(pop_type, operation, ...) \
  203. do { \
  204. TRAP_IF_NOT(!configuration.stack().is_empty()); \
  205. auto& entry = configuration.stack().peek(); \
  206. TRAP_IF_NOT(entry.has<Value>()); \
  207. auto value = entry.get<Value>().to<pop_type>(); \
  208. TRAP_IF_NOT(value.has_value()); \
  209. auto result = operation(value.value()); \
  210. dbgln_if(WASM_TRACE_DEBUG, "map({}) {} = {}", #operation, value.value(), result); \
  211. configuration.stack().peek() = Value(__VA_ARGS__(result)); \
  212. return; \
  213. } while (false)
  214. #define UNARY_NUMERIC_OPERATION(type, operation) \
  215. UNARY_MAP(type, operation, type)
  216. #define LOAD_AND_PUSH(read_type, push_type) \
  217. do { \
  218. return load_and_push<read_type, push_type>(configuration, instruction); \
  219. } while (false)
  220. #define POP_AND_STORE(pop_type, store_type) \
  221. do { \
  222. TRAP_IF_NOT(!configuration.stack().is_empty()); \
  223. auto entry = configuration.stack().pop(); \
  224. TRAP_IF_NOT(entry.has<Value>()); \
  225. auto value = ConvertToRaw<store_type> {}(*entry.get<Value>().to<pop_type>()); \
  226. dbgln_if(WASM_TRACE_DEBUG, "stack({}) -> temporary({}b)", value, sizeof(store_type)); \
  227. store_to_memory(configuration, instruction, { &value, sizeof(store_type) }); \
  228. return; \
  229. } while (false)
  230. template<typename T>
  231. T BytecodeInterpreter::read_value(ReadonlyBytes data)
  232. {
  233. LittleEndian<T> value;
  234. InputMemoryStream stream { data };
  235. stream >> value;
  236. if (stream.handle_any_error()) {
  237. dbgln("Read from {} failed", data.data());
  238. m_trap = Trap { "Read from memory failed" };
  239. }
  240. return value;
  241. }
  242. template<>
  243. float BytecodeInterpreter::read_value<float>(ReadonlyBytes data)
  244. {
  245. InputMemoryStream stream { data };
  246. LittleEndian<u32> raw_value;
  247. stream >> raw_value;
  248. if (stream.handle_any_error())
  249. m_trap = Trap { "Read from memory failed" };
  250. return bit_cast<float>(static_cast<u32>(raw_value));
  251. }
  252. template<>
  253. double BytecodeInterpreter::read_value<double>(ReadonlyBytes data)
  254. {
  255. InputMemoryStream stream { data };
  256. LittleEndian<u64> raw_value;
  257. stream >> raw_value;
  258. if (stream.handle_any_error())
  259. m_trap = Trap { "Read from memory failed" };
  260. return bit_cast<double>(static_cast<u64>(raw_value));
  261. }
  262. template<typename T>
  263. struct ConvertToRaw {
  264. T operator()(T value)
  265. {
  266. return LittleEndian<T>(value);
  267. }
  268. };
  269. template<>
  270. struct ConvertToRaw<float> {
  271. u32 operator()(float value)
  272. {
  273. LittleEndian<u32> res;
  274. ReadonlyBytes bytes { &value, sizeof(float) };
  275. InputMemoryStream stream { bytes };
  276. stream >> res;
  277. VERIFY(!stream.has_any_error());
  278. return static_cast<u32>(res);
  279. }
  280. };
  281. template<>
  282. struct ConvertToRaw<double> {
  283. u64 operator()(double value)
  284. {
  285. LittleEndian<u64> res;
  286. ReadonlyBytes bytes { &value, sizeof(double) };
  287. InputMemoryStream stream { bytes };
  288. stream >> res;
  289. VERIFY(!stream.has_any_error());
  290. return static_cast<u64>(res);
  291. }
  292. };
  293. template<typename V, typename T>
  294. MakeSigned<T> BytecodeInterpreter::checked_signed_truncate(V value)
  295. {
  296. if (isnan(value) || isinf(value)) { // "undefined", let's just trap.
  297. m_trap = Trap { "Signed truncation undefined behaviour" };
  298. return 0;
  299. }
  300. double truncated;
  301. if constexpr (IsSame<float, V>)
  302. truncated = truncf(value);
  303. else
  304. truncated = trunc(value);
  305. using SignedT = MakeSigned<T>;
  306. if (NumericLimits<SignedT>::min() <= truncated && static_cast<double>(NumericLimits<SignedT>::max()) >= truncated)
  307. return static_cast<SignedT>(truncated);
  308. dbgln_if(WASM_TRACE_DEBUG, "Truncate out of range error");
  309. m_trap = Trap { "Signed truncation out of range" };
  310. return true;
  311. }
  312. template<typename V, typename T>
  313. MakeUnsigned<T> BytecodeInterpreter::checked_unsigned_truncate(V value)
  314. {
  315. if (isnan(value) || isinf(value)) { // "undefined", let's just trap.
  316. m_trap = Trap { "Unsigned truncation undefined behaviour" };
  317. return 0;
  318. }
  319. double truncated;
  320. if constexpr (IsSame<float, V>)
  321. truncated = truncf(value);
  322. else
  323. truncated = trunc(value);
  324. using UnsignedT = MakeUnsigned<T>;
  325. if (NumericLimits<UnsignedT>::min() <= truncated && static_cast<double>(NumericLimits<UnsignedT>::max()) >= truncated)
  326. return static_cast<UnsignedT>(truncated);
  327. dbgln_if(WASM_TRACE_DEBUG, "Truncate out of range error");
  328. m_trap = Trap { "Unsigned truncation out of range" };
  329. return true;
  330. }
  331. Vector<Value> BytecodeInterpreter::pop_values(Configuration& configuration, size_t count)
  332. {
  333. Vector<Value> results;
  334. results.resize(count);
  335. for (size_t i = 0; i < count; ++i) {
  336. auto top_of_stack = configuration.stack().pop();
  337. if (auto value = top_of_stack.get_pointer<Value>())
  338. results[i] = move(*value);
  339. else
  340. TRAP_IF_NOT_NORETURN(value);
  341. }
  342. return results;
  343. }
  344. template<typename T, typename R>
  345. ALWAYS_INLINE static T rotl(T value, R shift)
  346. {
  347. // generates a single 'rol' instruction if shift is positive
  348. // otherwise generate a `ror`
  349. auto const mask = CHAR_BIT * sizeof(T) - 1;
  350. shift &= mask;
  351. return (value << shift) | (value >> ((-shift) & mask));
  352. }
  353. template<typename T, typename R>
  354. ALWAYS_INLINE static T rotr(T value, R shift)
  355. {
  356. // generates a single 'ror' instruction if shift is positive
  357. // otherwise generate a `rol`
  358. auto const mask = CHAR_BIT * sizeof(T) - 1;
  359. shift &= mask;
  360. return (value >> shift) | (value << ((-shift) & mask));
  361. }
  362. template<typename T>
  363. ALWAYS_INLINE static i32 clz(T value)
  364. {
  365. if (value == 0)
  366. return sizeof(T) * CHAR_BIT;
  367. if constexpr (sizeof(T) == 4)
  368. return __builtin_clz(value);
  369. else if constexpr (sizeof(T) == 8)
  370. return __builtin_clzll(value);
  371. else
  372. VERIFY_NOT_REACHED();
  373. }
  374. template<typename T>
  375. ALWAYS_INLINE static i32 ctz(T value)
  376. {
  377. if (value == 0)
  378. return sizeof(T) * CHAR_BIT;
  379. if constexpr (sizeof(T) == 4)
  380. return __builtin_ctz(value);
  381. else if constexpr (sizeof(T) == 8)
  382. return __builtin_ctzll(value);
  383. else
  384. VERIFY_NOT_REACHED();
  385. }
  386. template<typename InputT, typename OutputT>
  387. ALWAYS_INLINE static OutputT extend_signed(InputT value)
  388. {
  389. // Note: C++ will take care of sign extension.
  390. return value;
  391. }
  392. template<typename TruncT, typename T>
  393. ALWAYS_INLINE static TruncT saturating_truncate(T value)
  394. {
  395. if (isnan(value))
  396. return 0;
  397. if (isinf(value)) {
  398. if (value < 0)
  399. return NumericLimits<TruncT>::min();
  400. return NumericLimits<TruncT>::max();
  401. }
  402. constexpr auto convert = [](auto truncated_value) {
  403. if (truncated_value < NumericLimits<TruncT>::min())
  404. return NumericLimits<TruncT>::min();
  405. if (static_cast<double>(truncated_value) > static_cast<double>(NumericLimits<TruncT>::max()))
  406. return NumericLimits<TruncT>::max();
  407. return static_cast<TruncT>(truncated_value);
  408. };
  409. if constexpr (IsSame<T, float>)
  410. return convert(truncf(value));
  411. else
  412. return convert(trunc(value));
  413. }
  414. template<typename T>
  415. ALWAYS_INLINE static T float_max(T lhs, T rhs)
  416. {
  417. if (isnan(lhs))
  418. return lhs;
  419. if (isnan(rhs))
  420. return rhs;
  421. if (isinf(lhs))
  422. return lhs > 0 ? lhs : rhs;
  423. if (isinf(rhs))
  424. return rhs > 0 ? rhs : lhs;
  425. return max(lhs, rhs);
  426. }
  427. template<typename T>
  428. ALWAYS_INLINE static T float_min(T lhs, T rhs)
  429. {
  430. if (isnan(lhs))
  431. return lhs;
  432. if (isnan(rhs))
  433. return rhs;
  434. if (isinf(lhs))
  435. return lhs > 0 ? rhs : lhs;
  436. if (isinf(rhs))
  437. return rhs > 0 ? lhs : rhs;
  438. return min(lhs, rhs);
  439. }
  440. void BytecodeInterpreter::interpret(Configuration& configuration, InstructionPointer& ip, Instruction const& instruction)
  441. {
  442. dbgln_if(WASM_TRACE_DEBUG, "Executing instruction {} at ip {}", instruction_name(instruction.opcode()), ip.value());
  443. switch (instruction.opcode().value()) {
  444. case Instructions::unreachable.value():
  445. m_trap = Trap { "Unreachable" };
  446. return;
  447. case Instructions::nop.value():
  448. return;
  449. case Instructions::local_get.value():
  450. configuration.stack().push(Value(configuration.frame().locals()[instruction.arguments().get<LocalIndex>().value()]));
  451. return;
  452. case Instructions::local_set.value(): {
  453. TRAP_IF_NOT(!configuration.stack().is_empty());
  454. auto entry = configuration.stack().pop();
  455. TRAP_IF_NOT(entry.has<Value>());
  456. configuration.frame().locals()[instruction.arguments().get<LocalIndex>().value()] = move(entry.get<Value>());
  457. return;
  458. }
  459. case Instructions::i32_const.value():
  460. configuration.stack().push(Value(ValueType { ValueType::I32 }, static_cast<i64>(instruction.arguments().get<i32>())));
  461. return;
  462. case Instructions::i64_const.value():
  463. configuration.stack().push(Value(ValueType { ValueType::I64 }, instruction.arguments().get<i64>()));
  464. return;
  465. case Instructions::f32_const.value():
  466. configuration.stack().push(Value(ValueType { ValueType::F32 }, static_cast<double>(instruction.arguments().get<float>())));
  467. return;
  468. case Instructions::f64_const.value():
  469. configuration.stack().push(Value(ValueType { ValueType::F64 }, instruction.arguments().get<double>()));
  470. return;
  471. case Instructions::block.value(): {
  472. size_t arity = 0;
  473. auto& args = instruction.arguments().get<Instruction::StructuredInstructionArgs>();
  474. if (args.block_type.kind() != BlockType::Empty)
  475. arity = 1;
  476. configuration.stack().push(Label(arity, args.end_ip));
  477. return;
  478. }
  479. case Instructions::loop.value(): {
  480. size_t arity = 0;
  481. auto& args = instruction.arguments().get<Instruction::StructuredInstructionArgs>();
  482. if (args.block_type.kind() != BlockType::Empty)
  483. arity = 1;
  484. configuration.stack().push(Label(arity, ip.value() + 1));
  485. return;
  486. }
  487. case Instructions::if_.value(): {
  488. size_t arity = 0;
  489. auto& args = instruction.arguments().get<Instruction::StructuredInstructionArgs>();
  490. if (args.block_type.kind() != BlockType::Empty)
  491. arity = 1;
  492. TRAP_IF_NOT(!configuration.stack().is_empty());
  493. auto entry = configuration.stack().pop();
  494. TRAP_IF_NOT(entry.has<Value>());
  495. auto value = entry.get<Value>().to<i32>();
  496. TRAP_IF_NOT(value.has_value());
  497. auto end_label = Label(arity, args.end_ip.value());
  498. if (value.value() == 0) {
  499. if (args.else_ip.has_value()) {
  500. configuration.ip() = args.else_ip.value();
  501. configuration.stack().push(move(end_label));
  502. } else {
  503. configuration.ip() = args.end_ip.value() + 1;
  504. }
  505. } else {
  506. configuration.stack().push(move(end_label));
  507. }
  508. return;
  509. }
  510. case Instructions::structured_end.value():
  511. case Instructions::structured_else.value(): {
  512. auto label = configuration.nth_label(0);
  513. TRAP_IF_NOT(label.has_value());
  514. size_t end = configuration.stack().size() - label->arity() - 1;
  515. size_t start = end;
  516. while (start > 0 && start < configuration.stack().size() && !configuration.stack().entries()[start].has<Label>())
  517. --start;
  518. configuration.stack().entries().remove(start, end - start + 1);
  519. if (instruction.opcode() == Instructions::structured_end)
  520. return;
  521. // Jump to the end label
  522. configuration.ip() = label->continuation();
  523. return;
  524. }
  525. case Instructions::return_.value(): {
  526. auto& frame = configuration.frame();
  527. size_t end = configuration.stack().size() - frame.arity();
  528. size_t start = end;
  529. for (; start + 1 > 0 && start < configuration.stack().size(); --start) {
  530. auto& entry = configuration.stack().entries()[start];
  531. if (entry.has<Frame>()) {
  532. // Leave the frame, _and_ its label.
  533. start += 2;
  534. break;
  535. }
  536. }
  537. configuration.stack().entries().remove(start, end - start);
  538. // Jump past the call/indirect instruction
  539. configuration.ip() = configuration.frame().expression().instructions().size();
  540. return;
  541. }
  542. case Instructions::br.value():
  543. return branch_to_label(configuration, instruction.arguments().get<LabelIndex>());
  544. case Instructions::br_if.value(): {
  545. TRAP_IF_NOT(!configuration.stack().is_empty());
  546. auto entry = configuration.stack().pop();
  547. TRAP_IF_NOT(entry.has<Value>());
  548. if (entry.get<Value>().to<i32>().value_or(0) == 0)
  549. return;
  550. return branch_to_label(configuration, instruction.arguments().get<LabelIndex>());
  551. }
  552. case Instructions::br_table.value(): {
  553. auto& arguments = instruction.arguments().get<Instruction::TableBranchArgs>();
  554. TRAP_IF_NOT(!configuration.stack().is_empty());
  555. auto entry = configuration.stack().pop();
  556. TRAP_IF_NOT(entry.has<Value>());
  557. auto maybe_i = entry.get<Value>().to<i32>();
  558. TRAP_IF_NOT(maybe_i.has_value());
  559. if (0 <= *maybe_i) {
  560. size_t i = *maybe_i;
  561. if (i < arguments.labels.size())
  562. return branch_to_label(configuration, arguments.labels[i]);
  563. }
  564. return branch_to_label(configuration, arguments.default_);
  565. }
  566. case Instructions::call.value(): {
  567. auto index = instruction.arguments().get<FunctionIndex>();
  568. TRAP_IF_NOT(index.value() < configuration.frame().module().functions().size());
  569. auto address = configuration.frame().module().functions()[index.value()];
  570. dbgln_if(WASM_TRACE_DEBUG, "call({})", address.value());
  571. call_address(configuration, address);
  572. return;
  573. }
  574. case Instructions::call_indirect.value(): {
  575. auto& args = instruction.arguments().get<Instruction::IndirectCallArgs>();
  576. TRAP_IF_NOT(args.table.value() < configuration.frame().module().tables().size());
  577. auto table_address = configuration.frame().module().tables()[args.table.value()];
  578. auto table_instance = configuration.store().get(table_address);
  579. TRAP_IF_NOT(!configuration.stack().is_empty());
  580. auto entry = configuration.stack().pop();
  581. TRAP_IF_NOT(entry.has<Value>());
  582. auto index = entry.get<Value>().to<i32>();
  583. TRAP_IF_NOT(index.has_value());
  584. TRAP_IF_NOT(index.value() >= 0);
  585. TRAP_IF_NOT(static_cast<size_t>(index.value()) < table_instance->elements().size());
  586. auto element = table_instance->elements()[index.value()];
  587. TRAP_IF_NOT(element.has_value());
  588. TRAP_IF_NOT(element->ref().has<Reference::Func>());
  589. auto address = element->ref().get<Reference::Func>().address;
  590. dbgln_if(WASM_TRACE_DEBUG, "call_indirect({} -> {})", index.value(), address.value());
  591. call_address(configuration, address);
  592. return;
  593. }
  594. case Instructions::i32_load.value():
  595. LOAD_AND_PUSH(i32, i32);
  596. case Instructions::i64_load.value():
  597. LOAD_AND_PUSH(i64, i64);
  598. case Instructions::f32_load.value():
  599. LOAD_AND_PUSH(float, float);
  600. case Instructions::f64_load.value():
  601. LOAD_AND_PUSH(double, double);
  602. case Instructions::i32_load8_s.value():
  603. LOAD_AND_PUSH(i8, i32);
  604. case Instructions::i32_load8_u.value():
  605. LOAD_AND_PUSH(u8, i32);
  606. case Instructions::i32_load16_s.value():
  607. LOAD_AND_PUSH(i16, i32);
  608. case Instructions::i32_load16_u.value():
  609. LOAD_AND_PUSH(u16, i32);
  610. case Instructions::i64_load8_s.value():
  611. LOAD_AND_PUSH(i8, i64);
  612. case Instructions::i64_load8_u.value():
  613. LOAD_AND_PUSH(u8, i64);
  614. case Instructions::i64_load16_s.value():
  615. LOAD_AND_PUSH(i16, i64);
  616. case Instructions::i64_load16_u.value():
  617. LOAD_AND_PUSH(u16, i64);
  618. case Instructions::i64_load32_s.value():
  619. LOAD_AND_PUSH(i32, i64);
  620. case Instructions::i64_load32_u.value():
  621. LOAD_AND_PUSH(u32, i64);
  622. case Instructions::i32_store.value():
  623. POP_AND_STORE(i32, i32);
  624. case Instructions::i64_store.value():
  625. POP_AND_STORE(i64, i64);
  626. case Instructions::f32_store.value():
  627. POP_AND_STORE(float, float);
  628. case Instructions::f64_store.value():
  629. POP_AND_STORE(double, double);
  630. case Instructions::i32_store8.value():
  631. POP_AND_STORE(i32, i8);
  632. case Instructions::i32_store16.value():
  633. POP_AND_STORE(i32, i16);
  634. case Instructions::i64_store8.value():
  635. POP_AND_STORE(i64, i8);
  636. case Instructions::i64_store16.value():
  637. POP_AND_STORE(i64, i16);
  638. case Instructions::i64_store32.value():
  639. POP_AND_STORE(i64, i32);
  640. case Instructions::local_tee.value(): {
  641. TRAP_IF_NOT(!configuration.stack().is_empty());
  642. auto& entry = configuration.stack().peek();
  643. TRAP_IF_NOT(entry.has<Value>());
  644. auto value = entry.get<Value>();
  645. auto local_index = instruction.arguments().get<LocalIndex>();
  646. TRAP_IF_NOT(configuration.frame().locals().size() > local_index.value());
  647. dbgln_if(WASM_TRACE_DEBUG, "stack:peek -> locals({})", local_index.value());
  648. configuration.frame().locals()[local_index.value()] = move(value);
  649. return;
  650. }
  651. case Instructions::global_get.value(): {
  652. auto global_index = instruction.arguments().get<GlobalIndex>();
  653. TRAP_IF_NOT(configuration.frame().module().globals().size() > global_index.value());
  654. auto address = configuration.frame().module().globals()[global_index.value()];
  655. dbgln_if(WASM_TRACE_DEBUG, "global({}) -> stack", address.value());
  656. auto global = configuration.store().get(address);
  657. configuration.stack().push(Value(global->value()));
  658. return;
  659. }
  660. case Instructions::global_set.value(): {
  661. auto global_index = instruction.arguments().get<GlobalIndex>();
  662. TRAP_IF_NOT(configuration.frame().module().globals().size() > global_index.value());
  663. auto address = configuration.frame().module().globals()[global_index.value()];
  664. TRAP_IF_NOT(!configuration.stack().is_empty());
  665. auto entry = configuration.stack().pop();
  666. TRAP_IF_NOT(entry.has<Value>());
  667. auto value = entry.get<Value>();
  668. dbgln_if(WASM_TRACE_DEBUG, "stack -> global({})", address.value());
  669. auto global = configuration.store().get(address);
  670. global->set_value(move(value));
  671. return;
  672. }
  673. case Instructions::memory_size.value(): {
  674. TRAP_IF_NOT(configuration.frame().module().memories().size() > 0);
  675. auto address = configuration.frame().module().memories()[0];
  676. auto instance = configuration.store().get(address);
  677. auto pages = instance->size() / Constants::page_size;
  678. dbgln_if(WASM_TRACE_DEBUG, "memory.size -> stack({})", pages);
  679. configuration.stack().push(Value((i32)pages));
  680. return;
  681. }
  682. case Instructions::memory_grow.value(): {
  683. TRAP_IF_NOT(configuration.frame().module().memories().size() > 0);
  684. auto address = configuration.frame().module().memories()[0];
  685. auto instance = configuration.store().get(address);
  686. i32 old_pages = instance->size() / Constants::page_size;
  687. TRAP_IF_NOT(!configuration.stack().is_empty());
  688. auto& entry = configuration.stack().peek();
  689. TRAP_IF_NOT(entry.has<Value>());
  690. auto new_pages = entry.get<Value>().to<i32>();
  691. TRAP_IF_NOT(new_pages.has_value());
  692. dbgln_if(WASM_TRACE_DEBUG, "memory.grow({}), previously {} pages...", *new_pages, old_pages);
  693. if (instance->grow(new_pages.value() * Constants::page_size))
  694. configuration.stack().peek() = Value((i32)old_pages);
  695. else
  696. configuration.stack().peek() = Value((i32)-1);
  697. return;
  698. }
  699. case Instructions::table_get.value():
  700. case Instructions::table_set.value():
  701. goto unimplemented;
  702. case Instructions::ref_null.value(): {
  703. auto type = instruction.arguments().get<ValueType>();
  704. TRAP_IF_NOT(type.is_reference());
  705. configuration.stack().push(Value(Reference(Reference::Null { type })));
  706. return;
  707. };
  708. case Instructions::ref_func.value(): {
  709. auto index = instruction.arguments().get<FunctionIndex>().value();
  710. auto& functions = configuration.frame().module().functions();
  711. TRAP_IF_NOT(functions.size() > index);
  712. auto address = functions[index];
  713. configuration.stack().push(Value(ValueType(ValueType::FunctionReference), address.value()));
  714. return;
  715. }
  716. case Instructions::ref_is_null.value(): {
  717. TRAP_IF_NOT(!configuration.stack().is_empty());
  718. auto top = configuration.stack().peek().get_pointer<Value>();
  719. TRAP_IF_NOT(top);
  720. TRAP_IF_NOT(top->type().is_reference());
  721. auto is_null = top->to<Reference::Null>().has_value();
  722. configuration.stack().peek() = Value(ValueType(ValueType::I32), static_cast<u64>(is_null ? 1 : 0));
  723. return;
  724. }
  725. case Instructions::drop.value():
  726. TRAP_IF_NOT(!configuration.stack().is_empty());
  727. configuration.stack().pop();
  728. return;
  729. case Instructions::select.value():
  730. case Instructions::select_typed.value(): {
  731. // Note: The type seems to only be used for validation.
  732. TRAP_IF_NOT(!configuration.stack().is_empty());
  733. auto entry = configuration.stack().pop();
  734. TRAP_IF_NOT(entry.has<Value>());
  735. auto value = entry.get<Value>().to<i32>();
  736. TRAP_IF_NOT(value.has_value());
  737. dbgln_if(WASM_TRACE_DEBUG, "select({})", value.value());
  738. auto rhs_entry = configuration.stack().pop();
  739. TRAP_IF_NOT(rhs_entry.has<Value>());
  740. auto& lhs_entry = configuration.stack().peek();
  741. TRAP_IF_NOT(lhs_entry.has<Value>());
  742. auto rhs = move(rhs_entry.get<Value>());
  743. auto lhs = move(lhs_entry.get<Value>());
  744. configuration.stack().peek() = value.value() != 0 ? move(lhs) : move(rhs);
  745. return;
  746. }
  747. case Instructions::i32_eqz.value():
  748. UNARY_NUMERIC_OPERATION(i32, 0 ==);
  749. case Instructions::i32_eq.value():
  750. BINARY_NUMERIC_OPERATION(i32, ==, i32);
  751. case Instructions::i32_ne.value():
  752. BINARY_NUMERIC_OPERATION(i32, !=, i32);
  753. case Instructions::i32_lts.value():
  754. BINARY_NUMERIC_OPERATION(i32, <, i32);
  755. case Instructions::i32_ltu.value():
  756. BINARY_NUMERIC_OPERATION(u32, <, i32);
  757. case Instructions::i32_gts.value():
  758. BINARY_NUMERIC_OPERATION(i32, >, i32);
  759. case Instructions::i32_gtu.value():
  760. BINARY_NUMERIC_OPERATION(u32, >, i32);
  761. case Instructions::i32_les.value():
  762. BINARY_NUMERIC_OPERATION(i32, <=, i32);
  763. case Instructions::i32_leu.value():
  764. BINARY_NUMERIC_OPERATION(u32, <=, i32);
  765. case Instructions::i32_ges.value():
  766. BINARY_NUMERIC_OPERATION(i32, >=, i32);
  767. case Instructions::i32_geu.value():
  768. BINARY_NUMERIC_OPERATION(u32, >=, i32);
  769. case Instructions::i64_eqz.value():
  770. UNARY_NUMERIC_OPERATION(i64, 0ull ==);
  771. case Instructions::i64_eq.value():
  772. BINARY_NUMERIC_OPERATION(i64, ==, i32);
  773. case Instructions::i64_ne.value():
  774. BINARY_NUMERIC_OPERATION(i64, !=, i32);
  775. case Instructions::i64_lts.value():
  776. BINARY_NUMERIC_OPERATION(i64, <, i32);
  777. case Instructions::i64_ltu.value():
  778. BINARY_NUMERIC_OPERATION(u64, <, i32);
  779. case Instructions::i64_gts.value():
  780. BINARY_NUMERIC_OPERATION(i64, >, i32);
  781. case Instructions::i64_gtu.value():
  782. BINARY_NUMERIC_OPERATION(u64, >, i32);
  783. case Instructions::i64_les.value():
  784. BINARY_NUMERIC_OPERATION(i64, <=, i32);
  785. case Instructions::i64_leu.value():
  786. BINARY_NUMERIC_OPERATION(u64, <=, i32);
  787. case Instructions::i64_ges.value():
  788. BINARY_NUMERIC_OPERATION(i64, >=, i32);
  789. case Instructions::i64_geu.value():
  790. BINARY_NUMERIC_OPERATION(u64, >=, i32);
  791. case Instructions::f32_eq.value():
  792. BINARY_NUMERIC_OPERATION(float, ==, i32);
  793. case Instructions::f32_ne.value():
  794. BINARY_NUMERIC_OPERATION(float, !=, i32);
  795. case Instructions::f32_lt.value():
  796. BINARY_NUMERIC_OPERATION(float, <, i32);
  797. case Instructions::f32_gt.value():
  798. BINARY_NUMERIC_OPERATION(float, >, i32);
  799. case Instructions::f32_le.value():
  800. BINARY_NUMERIC_OPERATION(float, <=, i32);
  801. case Instructions::f32_ge.value():
  802. BINARY_NUMERIC_OPERATION(float, >=, i32);
  803. case Instructions::f64_eq.value():
  804. BINARY_NUMERIC_OPERATION(double, ==, i32);
  805. case Instructions::f64_ne.value():
  806. BINARY_NUMERIC_OPERATION(double, !=, i32);
  807. case Instructions::f64_lt.value():
  808. BINARY_NUMERIC_OPERATION(double, <, i32);
  809. case Instructions::f64_gt.value():
  810. BINARY_NUMERIC_OPERATION(double, >, i32);
  811. case Instructions::f64_le.value():
  812. BINARY_NUMERIC_OPERATION(double, <=, i32);
  813. case Instructions::f64_ge.value():
  814. BINARY_NUMERIC_OPERATION(double, >, i32);
  815. case Instructions::i32_clz.value():
  816. UNARY_NUMERIC_OPERATION(i32, clz);
  817. case Instructions::i32_ctz.value():
  818. UNARY_NUMERIC_OPERATION(i32, ctz);
  819. case Instructions::i32_popcnt.value():
  820. UNARY_NUMERIC_OPERATION(i32, __builtin_popcount);
  821. case Instructions::i32_add.value():
  822. BINARY_NUMERIC_OPERATION(i32, +, i32);
  823. case Instructions::i32_sub.value():
  824. BINARY_NUMERIC_OPERATION(i32, -, i32);
  825. case Instructions::i32_mul.value():
  826. BINARY_NUMERIC_OPERATION(i32, *, i32);
  827. case Instructions::i32_divs.value():
  828. BINARY_NUMERIC_OPERATION(i32, /, i32, TRAP_IF_NOT(!(Checked<i32>(lhs.value()) /= rhs.value()).has_overflow()));
  829. case Instructions::i32_divu.value():
  830. BINARY_NUMERIC_OPERATION(u32, /, i32, TRAP_IF_NOT(rhs.value() != 0));
  831. case Instructions::i32_rems.value():
  832. BINARY_NUMERIC_OPERATION(i32, %, i32, TRAP_IF_NOT(!(Checked<i32>(lhs.value()) /= rhs.value()).has_overflow()));
  833. case Instructions::i32_remu.value():
  834. BINARY_NUMERIC_OPERATION(u32, %, i32, TRAP_IF_NOT(rhs.value() != 0));
  835. case Instructions::i32_and.value():
  836. BINARY_NUMERIC_OPERATION(i32, &, i32);
  837. case Instructions::i32_or.value():
  838. BINARY_NUMERIC_OPERATION(i32, |, i32);
  839. case Instructions::i32_xor.value():
  840. BINARY_NUMERIC_OPERATION(i32, ^, i32);
  841. case Instructions::i32_shl.value():
  842. BINARY_NUMERIC_OPERATION(i32, <<, i32);
  843. case Instructions::i32_shrs.value():
  844. BINARY_NUMERIC_OPERATION(i32, >>, i32);
  845. case Instructions::i32_shru.value():
  846. BINARY_NUMERIC_OPERATION(u32, >>, i32);
  847. case Instructions::i32_rotl.value():
  848. BINARY_PREFIX_NUMERIC_OPERATION(u32, rotl, i32);
  849. case Instructions::i32_rotr.value():
  850. BINARY_PREFIX_NUMERIC_OPERATION(u32, rotr, i32);
  851. case Instructions::i64_clz.value():
  852. UNARY_NUMERIC_OPERATION(i64, clz);
  853. case Instructions::i64_ctz.value():
  854. UNARY_NUMERIC_OPERATION(i64, ctz);
  855. case Instructions::i64_popcnt.value():
  856. UNARY_NUMERIC_OPERATION(i64, __builtin_popcountll);
  857. case Instructions::i64_add.value():
  858. BINARY_NUMERIC_OPERATION(i64, +, i64);
  859. case Instructions::i64_sub.value():
  860. BINARY_NUMERIC_OPERATION(i64, -, i64);
  861. case Instructions::i64_mul.value():
  862. BINARY_NUMERIC_OPERATION(i64, *, i64);
  863. case Instructions::i64_divs.value():
  864. OVF_CHECKED_BINARY_NUMERIC_OPERATION(i64, /, i64, TRAP_IF_NOT(rhs.value() != 0));
  865. case Instructions::i64_divu.value():
  866. OVF_CHECKED_BINARY_NUMERIC_OPERATION(u64, /, i64, TRAP_IF_NOT(rhs.value() != 0));
  867. case Instructions::i64_rems.value():
  868. BINARY_NUMERIC_OPERATION(i64, %, i64, TRAP_IF_NOT(!(Checked<i32>(lhs.value()) /= rhs.value()).has_overflow()));
  869. case Instructions::i64_remu.value():
  870. BINARY_NUMERIC_OPERATION(u64, %, i64, TRAP_IF_NOT(rhs.value() != 0));
  871. case Instructions::i64_and.value():
  872. BINARY_NUMERIC_OPERATION(i64, &, i64);
  873. case Instructions::i64_or.value():
  874. BINARY_NUMERIC_OPERATION(i64, |, i64);
  875. case Instructions::i64_xor.value():
  876. BINARY_NUMERIC_OPERATION(i64, ^, i64);
  877. case Instructions::i64_shl.value():
  878. BINARY_NUMERIC_OPERATION(i64, <<, i64);
  879. case Instructions::i64_shrs.value():
  880. BINARY_NUMERIC_OPERATION(i64, >>, i64);
  881. case Instructions::i64_shru.value():
  882. BINARY_NUMERIC_OPERATION(u64, >>, i64);
  883. case Instructions::i64_rotl.value():
  884. BINARY_PREFIX_NUMERIC_OPERATION(u64, rotl, i64);
  885. case Instructions::i64_rotr.value():
  886. BINARY_PREFIX_NUMERIC_OPERATION(u64, rotr, i64);
  887. case Instructions::f32_abs.value():
  888. UNARY_NUMERIC_OPERATION(float, fabsf);
  889. case Instructions::f32_neg.value():
  890. UNARY_NUMERIC_OPERATION(float, -);
  891. case Instructions::f32_ceil.value():
  892. UNARY_NUMERIC_OPERATION(float, ceilf);
  893. case Instructions::f32_floor.value():
  894. UNARY_NUMERIC_OPERATION(float, floorf);
  895. case Instructions::f32_trunc.value():
  896. UNARY_NUMERIC_OPERATION(float, truncf);
  897. case Instructions::f32_nearest.value():
  898. UNARY_NUMERIC_OPERATION(float, roundf);
  899. case Instructions::f32_sqrt.value():
  900. UNARY_NUMERIC_OPERATION(float, sqrtf);
  901. case Instructions::f32_add.value():
  902. BINARY_NUMERIC_OPERATION(float, +, float);
  903. case Instructions::f32_sub.value():
  904. BINARY_NUMERIC_OPERATION(float, -, float);
  905. case Instructions::f32_mul.value():
  906. BINARY_NUMERIC_OPERATION(float, *, float);
  907. case Instructions::f32_div.value():
  908. BINARY_NUMERIC_OPERATION(float, /, float);
  909. case Instructions::f32_min.value():
  910. BINARY_PREFIX_NUMERIC_OPERATION(float, float_min, float);
  911. case Instructions::f32_max.value():
  912. BINARY_PREFIX_NUMERIC_OPERATION(float, float_max, float);
  913. case Instructions::f32_copysign.value():
  914. BINARY_PREFIX_NUMERIC_OPERATION(float, copysignf, float);
  915. case Instructions::f64_abs.value():
  916. UNARY_NUMERIC_OPERATION(double, fabs);
  917. case Instructions::f64_neg.value():
  918. UNARY_NUMERIC_OPERATION(double, -);
  919. case Instructions::f64_ceil.value():
  920. UNARY_NUMERIC_OPERATION(double, ceil);
  921. case Instructions::f64_floor.value():
  922. UNARY_NUMERIC_OPERATION(double, floor);
  923. case Instructions::f64_trunc.value():
  924. UNARY_NUMERIC_OPERATION(double, trunc);
  925. case Instructions::f64_nearest.value():
  926. UNARY_NUMERIC_OPERATION(double, round);
  927. case Instructions::f64_sqrt.value():
  928. UNARY_NUMERIC_OPERATION(double, sqrt);
  929. case Instructions::f64_add.value():
  930. BINARY_NUMERIC_OPERATION(double, +, double);
  931. case Instructions::f64_sub.value():
  932. BINARY_NUMERIC_OPERATION(double, -, double);
  933. case Instructions::f64_mul.value():
  934. BINARY_NUMERIC_OPERATION(double, *, double);
  935. case Instructions::f64_div.value():
  936. BINARY_NUMERIC_OPERATION(double, /, double);
  937. case Instructions::f64_min.value():
  938. BINARY_PREFIX_NUMERIC_OPERATION(double, float_min, double);
  939. case Instructions::f64_max.value():
  940. BINARY_PREFIX_NUMERIC_OPERATION(double, float_max, double);
  941. case Instructions::f64_copysign.value():
  942. BINARY_PREFIX_NUMERIC_OPERATION(double, copysign, double);
  943. case Instructions::i32_wrap_i64.value():
  944. UNARY_MAP(i64, i32, i32);
  945. case Instructions::i32_trunc_sf32.value(): {
  946. auto fn = [this](auto& v) { return checked_signed_truncate<float, i32>(v); };
  947. UNARY_MAP(float, fn, i32);
  948. }
  949. case Instructions::i32_trunc_uf32.value(): {
  950. auto fn = [this](auto& value) { return checked_unsigned_truncate<float, i32>(value); };
  951. UNARY_MAP(float, fn, i32);
  952. }
  953. case Instructions::i32_trunc_sf64.value(): {
  954. auto fn = [this](auto& value) { return checked_signed_truncate<double, i32>(value); };
  955. UNARY_MAP(double, fn, i32);
  956. }
  957. case Instructions::i32_trunc_uf64.value(): {
  958. auto fn = [this](auto& value) { return checked_unsigned_truncate<double, i32>(value); };
  959. UNARY_MAP(double, fn, i32);
  960. }
  961. case Instructions::i64_trunc_sf32.value(): {
  962. auto fn = [this](auto& value) { return checked_signed_truncate<float, i64>(value); };
  963. UNARY_MAP(float, fn, i64);
  964. }
  965. case Instructions::i64_trunc_uf32.value(): {
  966. auto fn = [this](auto& value) { return checked_unsigned_truncate<float, i64>(value); };
  967. UNARY_MAP(float, fn, i64);
  968. }
  969. case Instructions::i64_trunc_sf64.value(): {
  970. auto fn = [this](auto& value) { return checked_signed_truncate<double, i64>(value); };
  971. UNARY_MAP(double, fn, i64);
  972. }
  973. case Instructions::i64_trunc_uf64.value(): {
  974. auto fn = [this](auto& value) { return checked_unsigned_truncate<double, i64>(value); };
  975. UNARY_MAP(double, fn, i64);
  976. }
  977. case Instructions::i64_extend_si32.value():
  978. UNARY_MAP(i32, i64, i64);
  979. case Instructions::i64_extend_ui32.value():
  980. UNARY_MAP(u32, i64, i64);
  981. case Instructions::f32_convert_si32.value():
  982. UNARY_MAP(i32, float, float);
  983. case Instructions::f32_convert_ui32.value():
  984. UNARY_MAP(u32, float, float);
  985. case Instructions::f32_convert_si64.value():
  986. UNARY_MAP(i64, float, float);
  987. case Instructions::f32_convert_ui64.value():
  988. UNARY_MAP(u32, float, float);
  989. case Instructions::f32_demote_f64.value():
  990. UNARY_MAP(double, float, float);
  991. case Instructions::f64_convert_si32.value():
  992. UNARY_MAP(i32, double, double);
  993. case Instructions::f64_convert_ui32.value():
  994. UNARY_MAP(u32, double, double);
  995. case Instructions::f64_convert_si64.value():
  996. UNARY_MAP(i64, double, double);
  997. case Instructions::f64_convert_ui64.value():
  998. UNARY_MAP(u64, double, double);
  999. case Instructions::f64_promote_f32.value():
  1000. UNARY_MAP(float, double, double);
  1001. case Instructions::i32_reinterpret_f32.value():
  1002. UNARY_MAP(float, bit_cast<i32>, i32);
  1003. case Instructions::i64_reinterpret_f64.value():
  1004. UNARY_MAP(double, bit_cast<i64>, i64);
  1005. case Instructions::f32_reinterpret_i32.value():
  1006. UNARY_MAP(i32, bit_cast<float>, float);
  1007. case Instructions::f64_reinterpret_i64.value():
  1008. UNARY_MAP(i64, bit_cast<double>, double);
  1009. case Instructions::i32_extend8_s.value():
  1010. UNARY_MAP(i32, (extend_signed<i8, i32>), i32);
  1011. case Instructions::i32_extend16_s.value():
  1012. UNARY_MAP(i32, (extend_signed<i16, i32>), i32);
  1013. case Instructions::i64_extend8_s.value():
  1014. UNARY_MAP(i64, (extend_signed<i8, i64>), i64);
  1015. case Instructions::i64_extend16_s.value():
  1016. UNARY_MAP(i64, (extend_signed<i16, i64>), i64);
  1017. case Instructions::i64_extend32_s.value():
  1018. UNARY_MAP(i64, (extend_signed<i32, i64>), i64);
  1019. case Instructions::i32_trunc_sat_f32_s.value():
  1020. UNARY_MAP(float, saturating_truncate<i32>, i32);
  1021. case Instructions::i32_trunc_sat_f32_u.value():
  1022. UNARY_MAP(float, saturating_truncate<u32>, i32);
  1023. case Instructions::i32_trunc_sat_f64_s.value():
  1024. UNARY_MAP(double, saturating_truncate<i32>, i32);
  1025. case Instructions::i32_trunc_sat_f64_u.value():
  1026. UNARY_MAP(double, saturating_truncate<u32>, i32);
  1027. case Instructions::i64_trunc_sat_f32_s.value():
  1028. UNARY_MAP(float, saturating_truncate<i64>, i64);
  1029. case Instructions::i64_trunc_sat_f32_u.value():
  1030. UNARY_MAP(float, saturating_truncate<u64>, i64);
  1031. case Instructions::i64_trunc_sat_f64_s.value():
  1032. UNARY_MAP(double, saturating_truncate<i64>, i64);
  1033. case Instructions::i64_trunc_sat_f64_u.value():
  1034. UNARY_MAP(double, saturating_truncate<u64>, i64);
  1035. case Instructions::memory_init.value():
  1036. case Instructions::data_drop.value():
  1037. case Instructions::memory_copy.value():
  1038. case Instructions::memory_fill.value():
  1039. case Instructions::table_init.value():
  1040. case Instructions::elem_drop.value():
  1041. case Instructions::table_copy.value():
  1042. case Instructions::table_grow.value():
  1043. case Instructions::table_size.value():
  1044. case Instructions::table_fill.value():
  1045. default:
  1046. unimplemented:;
  1047. dbgln("Instruction '{}' not implemented", instruction_name(instruction.opcode()));
  1048. m_trap = Trap { String::formatted("Unimplemented instruction {}", instruction_name(instruction.opcode())) };
  1049. return;
  1050. }
  1051. }
  1052. void DebuggerBytecodeInterpreter::interpret(Configuration& configuration, InstructionPointer& ip, Instruction const& instruction)
  1053. {
  1054. if (pre_interpret_hook) {
  1055. auto result = pre_interpret_hook(configuration, ip, instruction);
  1056. if (!result) {
  1057. m_trap = Trap { "Trapped by user request" };
  1058. return;
  1059. }
  1060. }
  1061. ScopeGuard guard { [&] {
  1062. if (post_interpret_hook) {
  1063. auto result = post_interpret_hook(configuration, ip, instruction, *this);
  1064. if (!result) {
  1065. m_trap = Trap { "Trapped by user request" };
  1066. return;
  1067. }
  1068. }
  1069. } };
  1070. BytecodeInterpreter::interpret(configuration, ip, instruction);
  1071. }
  1072. }