// |jit-test| skip-if: !hasDisassembler() || wasmCompileMode() != "ion" || getBuildConfiguration("windows") || (!getBuildConfiguration("x64") && !getBuildConfiguration("x86") && !getBuildConfiguration("arm64") && !getBuildConfiguration("arm")); include:adhoc-multiplatform-test.js // // These tests push wasm functions through the ion pipe and specify an expected // disassembly output on all 4 primary targets, x64 / x86 / arm64 / arm(32). // Results must be provided for the first 3, but can optionally be skipped // for arm(32). // // Hence: disassembler is needed, compiler must be ion. // // Windows is disallowed because the argument registers are different from on // Linux, and matching both is both difficult and not of much value. // Tests are "end-to-end" in the sense that we don't care whether the // tested-for code improvement is done by MIR optimisation, or later in the // pipe. Observed defects are marked with FIXMEs for future easy finding. // Note that identities involving AND, OR and XOR are tested by // binop-x64-ion-folding.js // Multiplication with magic constant on the left // // 0 * x => 0 // 1 * x => x // -1 * x => -x // 2 * x => x + x // 4 * x => x << 2 "mul32_zeroL" ) (param $p1 i32) (result i32)const 0 ) (local.get $p1))))`,"mul32_zeroL" ,0 `},true }}"mul64_zeroL" ) (param $p1 i64) (result i64)const 0 ) (local.get $p1))))`,"mul64_zeroL" ,// FIXME zero-creation insns could be improved // REX.W is redundant 0 0 ` },true }}"mul32_oneL" ) (param $p1 i32) (result i32)const 1 ) (local.get $p1))))`,"mul32_oneL" ,// We move edi to eax unnecessarily via ecx (bug 1752520). // Presumably because the folding 1 * x => x is done at the LIR // level, not the MIR level, hence the now-pointless WasmParameter // node is not DCE'd away, since DCE only happens at the MIR level. // In fact all targets suffer from the latter problem, but on x86 // no_prefix_x86:true hides it, and on arm32/64 the pointless move // is correctly transformed by RA into a no-op. 0 x10\\(%rbp\\), %eax`,true }}"mul64_oneL" ) (param $p1 i64) (result i64)const 1 ) (local.get $p1))))`,"mul64_oneL" ,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax`,true }}"mul32_minusOneL" ) (param $p1 i32) (result i32)const -1 ) (local.get $p1))))`,"mul32_minusOneL" ,0 `},true }, x64: {no_prefix:true }}"mul64_minusOneL" ) (param $p1 i64) (result i64)const -1 ) (local.get $p1))))`,"mul64_minusOneL" ,0 x00, %edx0 0 `},true }}"mul32_twoL" ) (param $p1 i32) (result i32)const 2 ) (local.get $p1))))`,"mul32_twoL" ,1 \\), %eax`,0 x10\\(%rbp\\), %eaxtrue }}"mul64_twoL" ) (param $p1 i64) (result i64)const 2 ) (local.get $p1))))`,"mul64_twoL" ,1 \\), %rax`,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eaxtrue }}"mul32_fourL" ) (param $p1 i32) (result i32)const 4 ) (local.get $p1))))`,"mul32_fourL" ,4 \\), %eax`,0 x10\\(%rbp\\), %eax0 x02, %eax`,2 `,2 `},true }}"mul64_fourL" ) (param $p1 i64) (result i64)const 4 ) (local.get $p1))))`,"mul64_fourL" ,4 \\), %rax`,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax0 x02, %eax, %edx0 x02, %eax`,2 `,2 30 2 `},true }}// Multiplication with magic constant on the right // // x * 0 => 0 // x * 1 => x // x * -1 => -x // x * 2 => x + x // x * 4 => x << 2 "mul32_zeroR" ) (param $p1 i32) (result i32)const 0 ))))`,"mul32_zeroR" ,0 `},true }}"mul64_zeroR" ) (param $p1 i64) (result i64)const 0 ))))`,"mul64_zeroR" ,// REX.W is redundant 0 0 ` },true }}"mul32_oneR" ) (param $p1 i32) (result i32)const 1 ))))`,"mul32_oneR" ,0 x10\\(%rbp\\), %eax`,true }}"mul64_oneR" ) (param $p1 i64) (result i64)const 1 ))))`,"mul64_oneR" ,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax`,true }}"mul32_minusOneR" ) (param $p1 i32) (result i32)const -1 ))))`,"mul32_minusOneR" ,0 `},true }, x64: {no_prefix:true }}"mul64_minusOneR" ) (param $p1 i64) (result i64)const -1 ))))`,"mul64_minusOneR" ,0 x00, %edx0 0 `},true }}"mul32_twoR" ) (param $p1 i32) (result i32)const 2 ))))`,"mul32_twoR" ,1 \\), %eax`,0 x10\\(%rbp\\), %eaxtrue }}"mul64_twoR" ) (param $p1 i64) (result i64)const 2 ))))`,"mul64_twoR" ,1 \\), %rax`,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eaxtrue }}"mul32_fourR" ) (param $p1 i32) (result i32)const 4 ))))`,"mul32_fourR" ,4 \\), %eax`,0 x10\\(%rbp\\), %eax0 x02, %eax`,2 `,2 `},true }}"mul64_fourR" ) (param $p1 i64) (result i64)const 4 ))))`,"mul64_fourR" ,4 \\), %rax`,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax0 x02, %eax, %edx0 x02, %eax`,2 `,2 30 2 `true }}// Shifts by zero (the right arg is zero) // // x >> 0 => x (any shift kind: shl, shrU, shrS) "shl32_zeroR" ) (param $p1 i32) (result i32)const 0 ))))`,"shl32_zeroR" ,// FIXME check these are consistently folded out at the MIR level 0 x10\\(%rbp\\), %eax`,// no-op true }}"shl64_zeroR" ) (param $p1 i64) (result i64)const 0 ))))`,"shl64_zeroR" ,// FIXME why is this code so much better than the 32-bit case? 0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax`,// no-op // no-op true }}"shrU32_zeroR" ) (param $p1 i32) (result i32)const 0 ))))`,"shrU32_zeroR" ,0 x10\\(%rbp\\), %eax`,true }}"shrU64_zeroR" ) (param $p1 i64) (result i64)const 0 ))))`,"shrU64_zeroR" ,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax`,true }}"shrS32_zeroR" ) (param $p1 i32) (result i32)const 0 ))))`,"shrS32_zeroR" ,0 x10\\(%rbp\\), %eax`,true }}"shrS64_zeroR" ) (param $p1 i64) (result i64)const 0 ))))`,"shrS64_zeroR" ,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax`,true }}// Identities involving addition // // x + 0 => x // 0 + x => x // x + x => x << 1 "add32_zeroR" ) (param $p1 i32) (result i32)const 0 ))))`,"add32_zeroR" ,0 x10\\(%rbp\\), %eax`,true }}"add64_zeroR" ) (param $p1 i64) (result i64)const 0 ))))`,"add64_zeroR" ,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax`,true }}"add32_zeroL" ) (param $p1 i32) (result i32)const 0 ) (local.get $p1))))`,"add32_zeroL" ,0 x10\\(%rbp\\), %eax`,true }}"add64_zeroL" ) (param $p1 i64) (result i64)const 0 ) (local.get $p1))))`,"add64_zeroL" ,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax`,true }}"add32_self" ) (param $p1 i32) (result i32)"add32_self" ,0 x10\\(%rbp\\), %eax0 x10\\(%rbp\\), %eax`,true }}"add64_self" ) (param $p1 i64) (result i64)"add64_self" ,// FIXME outstandingly bad 32-bit sequences, probably due to the RA // -0x21524111 is 0xDEADBEEF 0 x14\\(%rbp\\), %ebx0 x10\\(%rbp\\), %ecx0 x21524111, %edi0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax// play Musical Chairs for a while true }}// Identities involving subtraction // // x - 0 => x // 0 - x => -x // x - x => 0 "sub32_zeroR" ) (param $p1 i32) (result i32)const 0 ))))`,"sub32_zeroR" ,0 x10\\(%rbp\\), %eax`,true }}"sub64_zeroR" ) (param $p1 i64) (result i64)const 0 ))))`,"sub64_zeroR" ,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax`,true }}"sub32_zeroL" ) (param $p1 i32) (result i32)const 0 ) (local.get $p1))))`,"sub32_zeroL" ,0 x10\\(%rbp\\), %eax0 `true }}"sub64_zeroL" ) (param $p1 i64) (result i64)const 0 ) (local.get $p1))))`,"sub64_zeroL" ,0 x14\\(%rbp\\), %edx0 x10\\(%rbp\\), %eax0 x00, %edx0 0 `true }}"sub32_self" ) (param $p1 i32) (result i32)"sub32_self" ,0 x0`,0 `true }}"sub64_self" ) (param $p1 i64) (result i64)"sub64_self" ,0 x0`,0 0 `true }}
Messung V0.5 in Prozent C=90 H=100 G=95
¤ Dauer der Verarbeitung: 0.16 Sekunden
(vorverarbeitet am 2026-08-26)
¤ *© Formatika GbR, Deutschland
