BytecodeInterpreter.cpp 50 KB

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