blob: 7932f36701e545ae16773c2c2bc240b50f0850e0 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
// Copyright 2017 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
// Flags: --allow-natives-syntax --expose-gc
new BenchmarkSuite('ManyClosures', [1000], [
new Benchmark('CreateManyClosures', false, true, 1, CreateManyClosures,
CreateManyClosures_Setup)
]);
// ----------------------------------------------------------------------------
// This program creates many closures and then allocates many arrays in order
// to trigger garbage collection cycles. The goal of this micro-benchmark is to
// evaluate the overhead of keeping the weak-list of optimized JS functions.
//
// c.f. https://bugs.chromium.org/p/v8/issues/detail?id=6637#c5
var a = [];
%NeverOptimizeFunction(CreateManyClosures_Setup);
function CreateManyClosures_Setup() {
function g() {
return (i) => i + 1;
}
// Create a closure and optimize.
var f = g();
%PrepareFunctionForOptimization(f);
f(0);
f(0);
%OptimizeFunctionOnNextCall(f);
f(0);
// Create 2M closures, those will get the optimized code.
a = [];
for (var i = 0; i < 2000000; i++) {
var f = g();
f();
a.push(f);
}
}
%NeverOptimizeFunction(CreateManyClosures);
function CreateManyClosures() {
// Now cause scavenges.
for (var i = 0; i < 50; i++) {
gc(true);
}
}
|
