livecodingspace-app/public/lib/ui/solid-js/s-js/bench/benchNode.js

S = typeof S === 'undefined' ? require('..') : S;

var now = typeof process === 'undefined' ? browserNow : nodeNow;

var COUNT = 1e5;

main();

function main() {
    var total = 0;
    total += bench(createDataSignals, COUNT, COUNT);
    total += bench(createComputations0to1, COUNT, 0);
    total += bench(createComputations1to1, COUNT, COUNT);
    total += bench(createComputations2to1, COUNT / 2, COUNT);
    total += bench(createComputations4to1, COUNT / 4, COUNT);
    total += bench(createComputations1000to1, COUNT / 1000, COUNT);
    //total += bench1(createComputations8, COUNT, 8 * COUNT);
    total += bench(createComputations1to2, COUNT, COUNT / 2);
    total += bench(createComputations1to4, COUNT, COUNT / 4);
    total += bench(createComputations1to8, COUNT, COUNT / 8);
    total += bench(createComputations1to1000, COUNT, COUNT / 1000);
    console.log('---');
    total += bench(updateComputations1to1, COUNT * 4, 1);
    total += bench(updateComputations2to1, COUNT * 2, 2);
    total += bench(updateComputations4to1, COUNT, 4);
    total += bench(updateComputations1000to1, COUNT / 100, 1000);
    total += bench(updateComputations1to2, COUNT * 4, 1);
    total += bench(updateComputations1to4, COUNT * 4, 1);
    total += bench(updateComputations1to1000, COUNT * 4, 1);
    console.log(`total: ${total.toFixed(0)}`);
}

function bench(fn, count, scount) {
    var time = run(fn, count, scount);
    console.log(`${fn.name}: ${time.toFixed(0)}`);
    return time;
}

function run(fn, n, scount) {
    // prep n * arity sources
    var start,
        end;

    S.root(function () {
        // run 3 times to warm up 
        var sources = createDataSignals(scount, []);
        fn(n / 100, sources);
        sources = createDataSignals(scount, []);
        fn(n / 100, sources);
        sources = createDataSignals(scount, []);
        %OptimizeFunctionOnNextCall(fn);
        fn(n / 100, sources);
        sources = createDataSignals(scount, []);
        for (var i = 0; i < scount; i++) {
            sources[i].current();
            sources[i].current();
            %OptimizeFunctionOnNextCall(sources[i]);
            sources[i].current();
        }

        // start GC clean
        %CollectGarbage(null);

        start = now();

        fn(n, sources);

        // end GC clean
        sources = null;
        %CollectGarbage(null);

        end = now();
    });

    return end - start;
}

function createDataSignals(n, sources) {
    for (var i = 0; i < n; i++) {
        sources[i] = S.makeDataNode(i);
    }
    return sources;
}

function createComputations0to1(n, sources) {
    for (var i = 0; i < n; i++) {
        createComputation0(i);
    }
}

function createComputations1to1000(n, sources) {
    for (var i = 0; i < n / 1000; i++) {
        for (var j = 0; j < 1000; j++) {
            createComputation1(sources[i]);
        }
        //sources[i] = null;
    }
}

function createComputations1to8(n, sources) {
    for (var i = 0; i < n / 8; i++) {
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        //sources[i] = null;
    }
}

function createComputations1to4(n, sources) {
    for (var i = 0; i < n / 4; i++) {
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        //sources[i] = null;
    }
}

function createComputations1to2(n, sources) {
    for (var i = 0; i < n / 2; i++) {
        createComputation1(sources[i]);
        createComputation1(sources[i]);
        //sources[i] = null;
    }
}

function createComputations1to1(n, sources) {
    for (var i = 0; i < n; i++) {
        createComputation1(sources[i]);
        //sources[i] = null;
    }
}

function createComputations2to1(n, sources) {
    for (var i = 0; i < n; i++) {
        createComputation2(
            sources[i * 2],
            sources[i * 2 + 1]
        );
        //sources[i * 2] = null;
        //sources[i * 2 + 1] = null;
    }
}

function createComputations4to1(n, sources) {
    for (var i = 0; i < n; i++) {
        createComputation4(
            sources[i * 4],
            sources[i * 4 + 1],
            sources[i * 4 + 2],
            sources[i * 4 + 3]
        );
        //sources[i * 4] = null;
        //sources[i * 4 + 1] = null;
        //sources[i * 4 + 2] = null;
        //sources[i * 4 + 3] = null;
    }
}

function createComputations8(n, sources) {
    for (var i = 0; i < n; i++) {
        createComputation8(
            sources[i * 8],
            sources[i * 8 + 1],
            sources[i * 8 + 2],
            sources[i * 8 + 3],
            sources[i * 8 + 4],
            sources[i * 8 + 5],
            sources[i * 8 + 6],
            sources[i * 8 + 7]
        );
        sources[i * 8] = null;
        sources[i * 8 + 1] = null;
        sources[i * 8 + 2] = null;
        sources[i * 8 + 3] = null;
        sources[i * 8 + 4] = null;
        sources[i * 8 + 5] = null;
        sources[i * 8 + 6] = null;
        sources[i * 8 + 7] = null;
    }
}

// only create n / 100 computations, as otherwise takes too long
function createComputations1000to1(n, sources) {
    for (var i = 0; i < n; i++) {
        createComputation1000(sources, i * 1000);
    }
}

function createComputation0(i) {
    S.makeComputationNode(function () { return i; }, undefined);
}

function createComputation1(s1) {
    S.makeComputationNode(function () { return s1.current(); }, undefined);
}

function createComputation2(s1, s2) {
    S.makeComputationNode(function () { return s1.current() + s2.current(); }, undefined);
}

function createComputation4(s1, s2, s3, s4) {
    S.makeComputationNode(function () { return s1.current() + s2.current() + s3.current() + s4.current(); }, undefined);
}

function createComputation8(s1, s2, s3, s4, s5, s6, s7, s8) {
    S.makeComputationNode(function () { return s1.current() + s2.current() + s3.current() + s4.current() + s5.current() + s6.current() + s7.current() + s8.current(); }, undefined);
}

function createComputation1000(ss, offset) {
    S.makeComputationNode(function () {
        var sum = 0;
        for (var i = 0; i < 1000; i++) {
            sum += ss[offset + i].current();
        }
        return sum;
    }, undefined);
}

function updateComputations1to1(n, sources) {
    var s1 = sources[0],
        c = S.makeComputationNode(function () { return s1.current(); }, undefined);
    for (var i = 0; i < n; i++) {
        s1.next(i);
    }
}

function updateComputations2to1(n, sources) {
    var s1 = sources[0],
        s2 = sources[1],
        c = S.makeComputationNode(function () { return s1.current() + s2.current(); }, undefined);
    for (var i = 0; i < n; i++) {
        s1.next(i);
    }
}

function updateComputations4to1(n, sources) {
    var s1 = sources[0],
        s2 = sources[1],
        s3 = sources[2],
        s4 = sources[3],
        c = S.makeComputationNode(function () { return s1.current() + s2.current() + s3.current() + s4.current(); }, undefined);
    for (var i = 0; i < n; i++) {
        s1.next(i);
    }
}

function updateComputations1000to1(n, sources) {
    var s1 = sources[0],
        c = S.makeComputationNode(function () {
            var sum = 0;
            for (var i = 0; i < 1000; i++) {
                sum += sources[i].current();
            }
            return sum;
        }, undefined);
    for (var i = 0; i < n; i++) {
        s1.next(i);
    }
}

function updateComputations1to2(n, sources) {
    var s1 = sources[0],
        c1 = S.makeComputationNode(function () { return s1.current(); }, undefined),
        c2 = S.makeComputationNode(function () { return s1.current(); }, undefined);
    for (var i = 0; i < n / 2; i++) {
        s1.next(i);
    }
}

function updateComputations1to4(n, sources) {
    var s1 = sources[0],
        c1 = S.makeComputationNode(function () { return s1.current(); }, undefined),
        c2 = S.makeComputationNode(function () { return s1.current(); }, undefined),
        c3 = S.makeComputationNode(function () { return s1.current(); }, undefined),
        c4 = S.makeComputationNode(function () { return s1.current(); }, undefined);
    for (var i = 0; i < n / 4; i++) {
        s1.next(i);
    }
}

function updateComputations1to1000(n, sources) {
    var s1 = sources[0];
    for (var i = 0; i < 1000; i++) {
        S.makeComputationNode(function () { return s1.current(); }, undefined);
    }
    for (var i = 0; i < n / 1000; i++) {
        s1.next(i);
    }
}

function browserNow() {
    return performance.now();
}

function nodeNow() {
    var hrt = process.hrtime();
    return hrt[0] * 1000 + hrt[1] / 1e6;
}

function repeat(n, val) {
    var arr = [];
    for (var i = 0; i < n; i++) {
        arr[i] = val;
    }
    return arr;
}