litmus7.js (1247B)
1 // Tail-call litmus test with multiple results 2 // 3 // Mutually recursive functions implement a multi-entry loop using indirect tail 4 // calls. The functions do not have the same signatures, so if all arguments 5 // are stack arguments then these use different amounts of stack space. 6 7 var ins = wasmEvalText(` 8 (module 9 (table 2 2 funcref) 10 (elem (i32.const 0) $even $odd) 11 (type $t (func (param i32) (result i32 i32 i32))) 12 (type $q (func (param i32 i32) (result i32 i32 i32))) 13 14 (func $odd (export "odd") (param $n i32) (param $dummy i32) (result i32 i32 i32) 15 (if (result i32 i32 i32) (i32.eqz (local.get $n)) 16 (then (return (i32.const 0) (i32.const 32769) (i32.const -37))) 17 (else (return_call_indirect (type $t) (i32.sub (local.get $n) (i32.const 1)) (i32.const 0))))) 18 19 (func $even (export "even") (param $n i32) (result i32 i32 i32) 20 (if (result i32 i32 i32) (i32.eqz (local.get $n)) 21 (then (return (i32.const 1) (i32.const -17) (i32.const 44021))) 22 (else (return_call_indirect (type $q) (i32.sub (local.get $n) (i32.const 1)) (i32.const 33) (i32.const 1))))) 23 ) 24 `); 25 26 assertSame(ins.exports.even(TailCallIterations), [1, -17, 44021]); 27 assertSame(ins.exports.odd(TailCallIterations, 33), [0, 32769, -37]);