099669ecf3
Bug: v8:9240 Change-Id: I704e0932b00baf84c4203baa8336809b250855d9 Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/1611681 Commit-Queue: Nico Hartmann <nicohartmann@google.com> Reviewed-by: Sigurd Schneider <sigurds@chromium.org> Reviewed-by: Georg Neis <neis@chromium.org> Cr-Commit-Position: refs/heads/master@{#61507}
60 lines
1.8 KiB
JavaScript
60 lines
1.8 KiB
JavaScript
// 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('BigInt-ToBoolean', [10000], [
|
|
new Benchmark('BigInt-ToBoolean', true, false, 0, TestToBoolean),
|
|
]);
|
|
|
|
new BenchmarkSuite('BigInt-BooleanConstructor', [10000], [
|
|
new Benchmark('BigInt-BooleanConstructor', true, false, 0, TestBooleanConstructor),
|
|
]);
|
|
|
|
new BenchmarkSuite('BigInt-NewBooleanConstructor', [10000], [
|
|
new Benchmark('BigInt-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;
|
|
}
|