blob: c396da65b8de3ecc2c3a4659298d0a3c866cbc78 [file] [log] [blame]
// Copyright 2019 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
"use strict";
const ITERATIONS = 100000;
// This dummy ensures that the feedback for benchmark.run() in the Measure function
// from base.js is not monomorphic, thereby preventing the benchmarks below from being inlined.
// This ensures consistent behavior and comparable results.
new BenchmarkSuite('Prevent-Inline-Dummy', [10000], [
new Benchmark('Prevent-Inline-Dummy', true, false, 0, () => {})
]);
new BenchmarkSuite('ToBoolean', [10000], [
new Benchmark('ToBoolean', true, false, 0, TestToBoolean),
]);
new BenchmarkSuite('BooleanConstructor', [10000], [
new Benchmark('BooleanConstructor', true, false, 0, TestBooleanConstructor),
]);
new BenchmarkSuite('NewBooleanConstructor', [10000], [
new Benchmark('NewBooleanConstructor', true, false, 0, TestNewBooleanConstructor),
]);
function TestBooleanConstructor() {
let kl = true;
for (let i = 0; i < ITERATIONS; ++i) {
// Store to a variable to prevent elimination.
// Keep a depedency on the loop counter to prevent hoisting.
kl = Boolean(i % 2 == 0 ? 42n : 32n);
}
return kl;
}
function TestNewBooleanConstructor() {
let kl = true;
for (let i = 0; i < ITERATIONS; ++i) {
// Store to a variable to prevent elimination.
// Keep a depedency on the loop counter to prevent hoisting.
kl = new Boolean(i % 2 == 0 ? 42n : 32n);
}
return kl;
}
function TestToBoolean() {
let kl = true;
for (let i = 0; i < ITERATIONS; ++i) {
// Store to a variable to prevent elimination.
// Keep a depedency on the loop counter to prevent hoisting.
kl = (i % 2 == 0 ? 42n : 32n) ? true : false;
}
return kl;
}