mirror of
https://github.com/flutter/flutter.git
synced 2025-06-03 00:51:18 +00:00
8c264775bf
Reverts: flutter/flutter#154374
Initiated by: jtmcdole
Reason for reverting: A different benchmark was using the microbenchmark parser and timing out.
Original PR Author: jtmcdole
Reviewed By: {zanderso}
This change reverts the following previous change:
Two things:
**Re-land**: Uninstall microbenchmarks before running them.
Flakes in #153828 stem from adb saying the app isn't installed, but then failing to install wtih `-r`. Several other tests uninstall the app before trying to run it. Previous fix called uninstall between tests, but iOS takes 12 to 13 seconds to perform uninstall / install, which timed out the test. Just uninstall the one time since we only care about any lingering apps with different keys.
Potential solution #153828
**Make things go fast**
Instead of installing 21 different compilations of the same app to get results; compile and run them together. Locally on Mac+iOS, this should takes ~3 minutes instead of ~15 minutes.
92 lines
2.4 KiB
Dart
92 lines
2.4 KiB
Dart
// Copyright 2014 The Flutter Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file.
|
|
|
|
import '../common.dart';
|
|
|
|
const int _kNumIterations = 1000;
|
|
const int _kNumWarmUp = 100;
|
|
|
|
void main() {
|
|
assert(false, "Don't run benchmarks in debug mode! Use 'flutter run --release'.");
|
|
|
|
// Warm up lap
|
|
for (int i = 0; i < _kNumWarmUp; i += 1) {
|
|
sumIterable(generateIterableSyncStar());
|
|
sumIterable(generateIterableList());
|
|
sumIterable(Iterable<int>.generate(100, generate));
|
|
}
|
|
|
|
final Stopwatch watch = Stopwatch();
|
|
watch.start();
|
|
for (int i = 0; i < _kNumIterations; i += 1) {
|
|
sumIterable(generateIterableSyncStar());
|
|
}
|
|
final int traverseIterableSyncStar = watch.elapsedMicroseconds;
|
|
watch
|
|
..reset()
|
|
..start();
|
|
for (int i = 0; i < _kNumIterations; i += 1) {
|
|
sumIterable(generateIterableList());
|
|
}
|
|
final int traverseIterableList = watch.elapsedMicroseconds;
|
|
watch
|
|
..reset()
|
|
..start();
|
|
for (int i = 0; i < _kNumIterations; i += 1) {
|
|
sumIterable(Iterable<int>.generate(100, generate));
|
|
}
|
|
final int traverseIterableGenerated = watch.elapsedMicroseconds;
|
|
watch
|
|
..reset()
|
|
..start();
|
|
|
|
final BenchmarkResultPrinter printer = BenchmarkResultPrinter();
|
|
const double scale = 1000.0 / _kNumIterations;
|
|
printer.addResult(
|
|
description: 'traverseIterableSyncStar',
|
|
value: traverseIterableSyncStar * scale,
|
|
unit: 'ns per iteration',
|
|
name: 'traverseIterableSyncStar_iteration',
|
|
);
|
|
printer.addResult(
|
|
description: 'traverseIterableList',
|
|
value: traverseIterableList * scale,
|
|
unit: 'ns per iteration',
|
|
name: 'traverseIterableList_iteration',
|
|
);
|
|
printer.addResult(
|
|
description: 'traverseIterableGenerated',
|
|
value: traverseIterableGenerated * scale,
|
|
unit: 'ns per iteration',
|
|
name: 'traverseIterableGenerated_iteration',
|
|
);
|
|
printer.printToStdout();
|
|
}
|
|
|
|
int generate(int index) => index;
|
|
|
|
// Generate an Iterable using a sync* method.
|
|
Iterable<int> generateIterableSyncStar() sync* {
|
|
for (int i = 0; i < 100; i++) {
|
|
yield i;
|
|
}
|
|
}
|
|
|
|
// Generate an Iterable using a List.
|
|
Iterable<int> generateIterableList() {
|
|
final List<int> items = <int>[];
|
|
for (int i = 0; i < 100; i++) {
|
|
items.add(i);
|
|
}
|
|
return items;
|
|
}
|
|
|
|
int sumIterable(Iterable<int> values) {
|
|
int result = 0;
|
|
for (final int value in values) {
|
|
result += value;
|
|
}
|
|
return result;
|
|
}
|