litmus1.js (1486B)
1 // Mutually recursive functions implement a multi-entry loop using tail calls. 2 // The functions do not have the same signatures, so if all arguments are stack 3 // arguments then these use different amounts of stack space. 4 // 5 // The variable ballast is intended to test that we handle various combinations 6 // of stack and register arguments properly. 7 8 for ( let ballast=1; ballast < TailCallBallast; ballast++ ) { 9 let vals = iota(ballast,1); 10 let ps = vals.map(_ => 'i32').join(' ') 11 let es = vals.map(i => `(local.get ${i})`).join(' ') 12 let sum = vals.reduceRight((p,c) => `(i32.add (local.get ${c}) ${p})`, `(i32.const 0)`) 13 let sumv = vals.reduce((p,c) => p+c); 14 let text = ` 15 (module 16 (func $odd (export "odd") (param $n i32) (param ${ps}) (param $dummy i32) (result i32) 17 (if (result i32) (i32.eqz (local.get $n)) 18 (then (return (i32.or (i32.shl ${sum} (i32.const 1)) (i32.const 0)))) 19 (else (return_call $even (i32.sub (local.get $n) (i32.const 1)) ${es})))) 20 21 (func $even (export "even") (param $n i32) (param ${ps}) (result i32) 22 (if (result i32) (i32.eqz (local.get $n)) 23 (then (return (i32.or (i32.shl ${sum} (i32.const 1)) (i32.const 1)))) 24 (else (return_call $odd (i32.sub (local.get $n) (i32.const 1)) ${es} (i32.const 33))))))`; 25 26 let ins = wasmEvalText(text); 27 assertEq(ins.exports.even(TailCallIterations, ...vals), (sumv*2) + 1); 28 assertEq(ins.exports.odd(TailCallIterations, ...vals, 33), (sumv*2) + 0); 29 }