run.js 5.07 KB
Newer Older
1 2 3 4 5 6 7
// Copyright 2018 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.

// Comparing different copy schemes against spread initial literals.
// Benchmarks for large holey arrays.

8
const largeHoleyArray = new Array(1e5);
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 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142

for (var i = 0; i < 100; i++) {
  largeHoleyArray[i] = i;
}

for (var i = 5000; i < 5500; i++) {
  largeHoleyArray[i] = i;
}

// ----------------------------------------------------------------------------
// Benchmark: Spread
// ----------------------------------------------------------------------------

function SpreadLargeHoley() {
  var newArr = [...largeHoleyArray];
  // basic sanity check
  if (newArr.length != largeHoleyArray.length) throw 666;
  return newArr;
}

// ----------------------------------------------------------------------------
// Benchmark: ForLength
// ----------------------------------------------------------------------------

function ForLengthLargeHoley() {
  var newArr = new Array(largeHoleyArray.length);
  for (let i = 0; i < largeHoleyArray.length; i++) {
    newArr[i] = largeHoleyArray[i];
  }
  // basic sanity check
  if (newArr.length != largeHoleyArray.length) throw 666;
  return newArr;
}

// ----------------------------------------------------------------------------
// Benchmark: ForLengthEmpty
// ----------------------------------------------------------------------------

function ForLengthEmptyLargeHoley() {
  var newArr = [];
  for (let i = 0; i < largeHoleyArray.length; i++) {
    newArr[i] = largeHoleyArray[i];
  }
  // basic sanity check
  if (newArr.length != largeHoleyArray.length) throw 666;
  return newArr;
}

// ----------------------------------------------------------------------------
// Benchmark: Slice
// ----------------------------------------------------------------------------

function SliceLargeHoley() {
  var newArr = largeHoleyArray.slice();
  // basic sanity check
  if (newArr.length != largeHoleyArray.length) throw 666;
  return newArr;
}

// ----------------------------------------------------------------------------
// Benchmark: Slice0
// ----------------------------------------------------------------------------

function Slice0LargeHoley() {
  var newArr = largeHoleyArray.slice(0);
  // basic sanity check
  if (newArr.length != largeHoleyArray.length) throw 666;
  return newArr;
}

// ----------------------------------------------------------------------------
// Benchmark: ConcatReceive
// ----------------------------------------------------------------------------

function ConcatReceiveLargeHoley() {
  var newArr = largeHoleyArray.concat();
  // basic sanity check
  if (newArr.length != largeHoleyArray.length) throw 666;
  return newArr;
}

// ----------------------------------------------------------------------------
// Benchmark: ConcatArg
// ----------------------------------------------------------------------------

function ConcatArgLargeHoley() {
  var newArr = [].concat(largeHoleyArray);
  // basic sanity check
  if (newArr.length != largeHoleyArray.length) throw 666;
  return newArr;
}

// ----------------------------------------------------------------------------
// Benchmark: ForOfPush
// ----------------------------------------------------------------------------

function ForOfPushLargeHoley() {
  var newArr = [];
  for (let x of largeHoleyArray) {
    newArr.push(x)
  }
  // basic sanity check
  if (newArr.length != largeHoleyArray.length) throw 666;
  return newArr;
}

// ----------------------------------------------------------------------------
// Benchmark: MapId
// ----------------------------------------------------------------------------

function MapIdLargeHoley() {
  var newArr = largeHoleyArray.map(x => x);
  // basic sanity check
  if (newArr.length != largeHoleyArray.length) throw 666;
  return newArr;
}

// ----------------------------------------------------------------------------
// Setup and Run
// ----------------------------------------------------------------------------

load('../base.js');

var success = true;

function PrintResult(name, result) {
  print(name + '-ArrayLiteralInitialSpreadLargeHoley(Score): ' + result);
}

function PrintError(name, error) {
  PrintResult('Error: ' + name, error);
  success = false;
}

143
// Run the benchmark (5 x 100) iterations instead of 1 second.
144
function CreateBenchmark(name, f) {
145
  new BenchmarkSuite(name, [1000], [ new Benchmark(name, false, false, 5, f) ]);
146 147 148 149 150 151 152 153 154
}

CreateBenchmark('Spread', SpreadLargeHoley);
CreateBenchmark('ForLength', ForLengthLargeHoley);
CreateBenchmark('ForLengthEmpty', ForLengthEmptyLargeHoley);
CreateBenchmark('Slice', SliceLargeHoley);
CreateBenchmark('Slice0', Slice0LargeHoley);
CreateBenchmark('ConcatReceive', ConcatReceiveLargeHoley);
CreateBenchmark('ConcatArg', ConcatArgLargeHoley);
155 156 157
// The following benchmarks are so slow that they will time out.
// CreateBenchmark('ForOfPush', ForOfPushLargeHoley);
// CreateBenchmark('MapId', MapIdLargeHoley);
158 159 160 161 162


BenchmarkSuite.config.doWarmup = true;
BenchmarkSuite.config.doDeterministic = true;
BenchmarkSuite.RunSuites({NotifyResult: PrintResult, NotifyError: PrintError});